Feasible Mathematics II (Paperback, Softcover reprint of the original 1st ed. 1995)

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."

General

Imprint:	Springer-Verlag New York
Country of origin:	United States
Series:	Progress in Computer Science and Applied Logic, 13
Release date:	September 2011
First published:	1995
Editors:	Peter Clote • Jeffrey B. Remmel
Dimensions:	235 x 155 x 23mm (L x W x T)
Format:	Paperback
Pages:	447
Edition:	Softcover reprint of the original 1st ed. 1995
ISBN-13:	978-1-4612-7582-4
Categories:	Books > Reference & Interdisciplinary > Interdisciplinary studies > General Books > Computing & IT > General theory of computing > General Books > Computing & IT > Applications of computing > General
LSN:	1-4612-7582-2
Barcode:	9781461275824

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!