Download the fantastic book titled Bounded Queries in Recursion Theory written by William S. Levine, available in its entirety in both PDF and EPUB formats for online reading. This page includes a concise summary, a preview of the book cover, and detailed information about "Bounded Queries in Recursion Theory", which was released on 23 December 1998. We suggest perusing the summary before initiating your download. This book is a top selection for enthusiasts of the Computers genre.
Summary of Bounded Queries in Recursion Theory by William S. Levine PDF
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.
Detail About Bounded Queries in Recursion Theory PDF
- Author : William S. Levine
- Publisher : Springer Science & Business Media
- Genre : Computers
- Total Pages : 372 pages
- ISBN : 9780817639662
- Release Date : 23 December 1998
- PDF File Size : 8,9 Mb
- Language : English
- Rating : 4/5 from 21 reviews
Clicking on the GET BOOK button will initiate the downloading process of Bounded Queries in Recursion Theory by William S. Levine. This book is available in ePub and PDF format with a single click unlimited downloads.