Feasible Mathematics
- Authorized Dealer
- Ships within 1 business day
- Free 30-Day Returns
- Secure Checkout via Shopify Payments
Details
"Feasible Mathematics" by Samuel Buss, P.J. Scott is a mathematics book and learning resource focused on Core Mathematics. Best for teachers, students, and readers looking for stronger mathematical understanding.
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.
Materials + Care
We prioritize quality in selecting the materials for our items, choosing premium fabrics and finishings that ensure durability, comfort, and timeless appeal.
Shipping + Returns
We strive to process and ship all orders in a timely manner, working diligently to ensure that your items are on their way to you as soon as possible.
"Feasible Mathematics" by Samuel Buss, P.J. Scott is a mathematics book and learning resource focused on Core Mathematics. Best for teachers, students, and readers looking for stronger mathematical understanding.
Topic: Core Mathematics
Author: Samuel Buss, P.J. Scott
Who this is for:
- Teachers and classroom instructors
- Students building subject mastery
- Readers looking for practical learning support
Why this book matters: It stands out as a practical math resource that helps explain concepts, strengthen problem-solving, and support classroom or independent learning.
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.
| Author | Samuel Buss, P.J. Scott |
| Publisher | Springer Science & Business Media |
| Published | 1990-01-01 |
| ISBN-13 | 9780817634834 |
| Binding | Paperback |
| Pages | 368 |
| Language | English |
| Subjects | Computers |
| Topic | Core Mathematics |
| Series | Progress in Computer Science and Applied Logic |
Format: Paperback
Length: 368 pages
Language: English
Shop by collection
Books
