Bounded Queries in Recursion Theory

Georgia Martin

ISBN 10: 0817639667 / ISBN 13: 9780817639662

Editore: Birkhäuser Boston, Birkhäuser Boston Dez 1998, 1998

Riguardo questo articolo

This item is printed on demand - Print on Demand Titel. Neuware -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.Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin 372 pp. Englisch.

Codice articolo 9780817639662

Dati bibliografici

• Titolo: Bounded Queries in Recursion Theory
• Editore: Birkhäuser Boston, Birkhäuser Boston Dez 1998
• Data di pubblicazione: 1998
• Lingua: Inglese
• ISBN 10: 0817639667
• ISBN 13: 9780817639662
• Rilegatura: Buch
• Condizione: Neu
• Dimensioni: 241 L x 160 A x 25 P (millimetri) 241 millimetri di larghezza per 160 millimetri di altezza per 25 millimetri di profondità
• Peso: 723 grammi

Descrizione articolo

Riassunto

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.

Recensione

"Ideal for an advanced undergraduate or beginning graduate student who has some exposure to basic computability theory and wants to see what one can do with it. The questions asked are interesting and can be easily understood and the proofs can be followed without a large amount of training in computability theory."

--Sigact News