Visit our Christmas Gift Finder
Feasible Mathematics II - Progress in Computer Science and Applied Logic 13 (Paperback)
  • Feasible Mathematics II - Progress in Computer Science and Applied Logic 13 (Paperback)
zoom

Feasible Mathematics II - Progress in Computer Science and Applied Logic 13 (Paperback)

(editor), (editor)
£54.99
Paperback 447 Pages / Published: 16/09/2011
  • We can order this

Usually dispatched within 3 weeks

  • This item has been added to your basket
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.

Publisher: Springer-Verlag New York Inc.
ISBN: 9781461275824
Number of pages: 447
Weight: 691 g
Dimensions: 235 x 155 x 23 mm
Edition: Softcover reprint of the original 1st ed. 199

You may also be interested in...

The Singularity Is Near
Added to basket
Computing with Quantum Cats
Added to basket
Emotion: A Very Short Introduction
Added to basket
Business Analysis Techniques
Added to basket
The Elements of Statistical Learning
Added to basket
Modelling Computing Systems
Added to basket
Git for Teams
Added to basket
£39.99
Paperback
Introducing Artificial Intelligence
Added to basket
How to Pass Higher Computing Science
Added to basket
Computer Systems Architecture
Added to basket
The Lego Architect
Added to basket
£20.99
Hardback
Sound and Recording
Added to basket

Please sign in to write a review

Your review has been submitted successfully.