# Feasible Mathematics

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

- Editors
- (view affiliations)

Part of the Progress in Computer Science and Applied Logic book series (PCS, volume 9)

- Editors
- (view affiliations)

Part of the Progress in Computer Science and Applied Logic book series (PCS, volume 9)

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.

Arithmetic Finite Parity algebra algorithms calculus complexity computer function mathematics pigeonhole principle recursion time

- DOI https://doi.org/10.1007/978-1-4612-3466-1
- Copyright Information Birkhäuser Boston 1990
- Publisher Name Birkhäuser Boston
- eBook Packages Springer Book Archive
- Print ISBN 978-0-8176-3483-4
- Online ISBN 978-1-4612-3466-1
- About this book