Bounded Queries in Recursion Theory
William Levine · Georgia Martin
Des 2012 · Progress in Computer Science and Applied Logic Buku 16 · Springer Science & Business Media
eBook
353
Halaman
reportRating dan ulasan tidak diverifikasi Pelajari Lebih Lanjut
Tentang eBook ini
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.
Beri rating eBook ini
Sampaikan pendapat Anda.
Informasi bacaan
Smartphone dan tablet
Instal aplikasi Google Play Buku untuk Android dan iPad/iPhone. Aplikasi akan disinkronkan secara otomatis dengan akun Anda dan dapat diakses secara online maupun offline di mana saja.
Laptop dan komputer
Anda dapat mendengarkan buku audio yang dibeli di Google Play menggunakan browser web komputer.
eReader dan perangkat lainnya
Untuk membaca di perangkat e-ink seperti Kobo eReaders, Anda perlu mendownload file dan mentransfernya ke perangkat Anda. Ikuti petunjuk Pusat bantuan yang mendetail untuk mentransfer file ke eReaders yang didukung.
