Bounded Queries in Recursion Theory (eBook)

William Levine, Georgia Martin (Autoren)

eBook Download: PDF

2012
Birkhauser Boston (Verlag)
978-1-4612-0635-4 (ISBN)

Infos

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.

Produkt-Details

• Erscheint lt. Verlag: 6.12.2012
• Sprache: englisch
• Themenwelt: Mathematik / Informatik ► Informatik ► Theorie / Studium
• Themenwelt: Mathematik / Informatik ► Mathematik ► Analysis
• Themenwelt: Mathematik / Informatik ► Mathematik ► Angewandte Mathematik
• Themenwelt: Mathematik / Informatik ► Mathematik ► Graphentheorie
• ISBN-10: 1-4612-0635-9 / 1461206359
• ISBN-13: 978-1-4612-0635-4 / 9781461206354