Bounded Queries in Recursion Theory

von

Martin, GeorgiaLevine, William

BuchGebunden

Verkaufsrang13312inMathematik

EUR115,00

Beschreibung

One of the major concerns of theoretical computer science is the classifi cation of problems in terms of how hard they are. The natural measure of difficulty of a function is the amount of time needed to compute it (as a function of the length of the input). Other resources, such as space, have also been considered. In recursion theory, by contrast, a function is considered to be easy to compute if there exists some algorithm that computes it. We wish to classify functions that are hard, i.e., not computable, in a quantitative way. We cannot use time or space, since the functions are not even computable. We cannot use Turing degree, since this notion is not quantitative. Hence we need a new notion of complexity-much like time or spac~that is quantitative and yet in some way captures the level of difficulty (such as the Turing degree) of a function.

Weitere Beschreibungen

Details

ISBN/EAN978-0-8176-3966-2

ProduktartBuch

EinbandGebunden

Verlag

Birkhäuser Boston

Erscheinungsdatum23.12.1998

Auflage1999

ReiheProgress in Computer Science and Applied Logic

Reihen-Nr.16

Seiten353 Seiten

SpracheEnglisch

Artikel-Nr.1816909

WarengruppeMathematik

Weitere Details

Reihe

Applied Probability-Computer Science: The Interface Volume 1

Graph-Based Proof Procedures for Horn Clauses

A Proof Theory for General Unification

Logical Methods

Feasible Mathematics II

Learning and Geometry: Computational Approaches

Symbolic Rewriting Techniques