Progress in Computer Science and Applied Logic

Feasible Mathematics

A Mathematical Sciences Institute Workshop, Ithaca, New York, June 1989

Authors: Buss, Samuel, Scott, P.J.

Free Preview

Buy this book

eBook $74.99
price for USA in USD
  • ISBN 978-1-4612-3466-1
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $99.00
price for USA in USD
  • ISBN 978-0-8176-3483-4
  • Free shipping for individuals worldwide
  • Institutional customers should get in touch with their account manager
  • Covid-19 shipping restrictions
  • Usually ready to be dispatched within 3 to 5 business days, if in stock
About this book

A so-called "effective" algorithm may require arbitrarily large finite amounts of time and space resources, and hence may not be practical in the real world. A "feasible" algorithm is one which only requires a limited amount of space and/or time for execution; the general idea is that a feasible algorithm is one which may be practical on today's or at least tomorrow's computers. There is no definitive analogue of Church's thesis giving a mathematical definition of feasibility; however, the most widely studied mathematical model of feasible computability is polynomial-time computability. Feasible Mathematics includes both the study of feasible computation from a mathematical and logical point of view and the reworking of traditional mathematics from the point of view of feasible computation. The diversity of Feasible Mathematics is illustrated by the. contents of this volume which includes papers on weak fragments of arithmetic, on higher type functionals, on bounded linear logic, on sub recursive definitions of complexity classes, on finite model theory, on models of feasible computation for real numbers, on vector spaces and on recursion theory. The vVorkshop on Feasible Mathematics was sponsored by the Mathematical Sciences Institute and was held at Cornell University, June 26-28, 1989.

Table of contents (18 chapters)

Table of contents (18 chapters)

Buy this book

eBook $74.99
price for USA in USD
  • ISBN 978-1-4612-3466-1
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $99.00
price for USA in USD
  • ISBN 978-0-8176-3483-4
  • Free shipping for individuals worldwide
  • Institutional customers should get in touch with their account manager
  • Covid-19 shipping restrictions
  • Usually ready to be dispatched within 3 to 5 business days, if in stock
Loading...

Bibliographic Information

Bibliographic Information
Book Title
Feasible Mathematics
Book Subtitle
A Mathematical Sciences Institute Workshop, Ithaca, New York, June 1989
Authors
Series Title
Progress in Computer Science and Applied Logic
Series Volume
9
Copyright
1990
Publisher
Birkhäuser Basel
Copyright Holder
Birkhäuser Boston
eBook ISBN
978-1-4612-3466-1
DOI
10.1007/978-1-4612-3466-1
Softcover ISBN
978-0-8176-3483-4
Series ISSN
2297-0576
Edition Number
1
Number of Pages
VIII, 352
Topics