 |
|
|
Item Details
| Title:
|
FEASIBLE MATHEMATICS
|
| Volume: |
Volume II |
| By: |
Peter Clote (Editor), Jeffrey B. Remmel (Editor) |
| Format: |
Hardback |
| List price:
|
£72.00 |
|
We believe that this item is permanently unavailable, and so we cannot source
it.
|
|
|
|
|
|
| ISBN 10: |
0817636757 |
| ISBN 13: |
9780817636753 |
| Publisher: |
BIRKHAUSER BOSTON INC |
| Pub. date: |
15 December, 1994 |
| Series: |
Progress in Theoretical Computer Science 13 |
| Pages: |
447 |
| Description: |
The purpose of the workshop on which this volume is based was to carry on the work of the 1st Feasible Mathematics Workshop, held in 1989. This volume contains contributions to feasible mathematics in three areas: computational complexity theory, proof theory and algebra. |
| Synopsis: |
Perspicuity is part of proof. If the process by means of which I get a result were not surveyable, I might indeed make a note that this number is what comes out - but what fact is this supposed to confirm for me? I don't know 'what is supposed to come out' . . . . 1 -L. Wittgenstein A feasible computation uses small resources on an abstract computa- tion device, such as a 'lUring machine or boolean circuit. Feasible math- ematics concerns the study of feasible computations, using combinatorics and logic, as well as the study of feasibly presented mathematical structures such as groups, algebras, and so on. This volume contains contributions to feasible mathematics in three areas: computational complexity theory, proof theory and algebra, with substantial overlap between different fields. In computational complexity theory, the polynomial time hierarchy is characterized without the introduction of runtime bounds by the closure of certain initial functions under safe composition, predicative recursion on notation, and unbounded minimization (S. Bellantoni); an alternative way of looking at NP problems is introduced which focuses on which pa- rameters of the problem are the cause of its computational complexity and completeness, density and separation/collapse results are given for a struc- ture theory for parametrized problems (R. Downey and M. Fellows); new characterizations of PTIME and LINEAR SPACE are given using predicative recurrence over all finite tiers of certain stratified free algebras (D. |
| Illustrations: |
biography |
| Publication: |
US |
| Imprint: |
Birkhauser Boston Inc |
| Returns: |
Returnable |
|
|
|
 |
|
|
|
|
|
Little Worried Caterpillar (PB)
Little Green knows she''s about to make a big change - transformingfrom a caterpillar into a beautiful butterfly. Everyone is VERYexcited! But Little Green is VERY worried. What if being a butterflyisn''t as brilliant as everyone says?Join Little Green as she finds her own path ... with just a littlehelp from her friends.
|
|
All the Things We Carry PB
What can you carry?A pebble? A teddy? A bright red balloon? A painting you''ve made?A hope or a dream?This gorgeous, reassuring picture book celebrates all the preciousthings we can carry, from toys and treasures to love and hope. With comforting rhymes and fabulous illustrations, this is a warmhug of a picture book.
|
|
|
|