Bounded Queries in Recursion Theory
William Levine · Georgia Martin
dec 2012. · Progress in Computer Science and Applied Logic 16. knjiga · Springer Science & Business Media
E-knjiga
353
Broj stranica
reportOcjene i recenzije nisu potvrđene Saznajte više
O ovoj e-knjizi
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.
Ocijenite ovu e-knjigu
Recite nam šta mislite.
Informacije o čitanju
Pametni telefoni i tableti
Instalirajte aplikaciju Google Play Knjige za Android i iPad/iPhone uređaje. Aplikacija se automatski sinhronizira s vašim računom i omogućava vam čitanje na mreži ili van nje gdje god da se nalazite.
Laptopi i računari
Audio knjige koje su kupljene na Google Playu možete slušati pomoću web preglednika na vašem računaru.
Elektronički čitači i ostali uređaji
Da čitate na e-ink uređajima kao što su Kobo e-čitači, morat ćete preuzeti fajl i prenijeti ga na uređaj. Pratite detaljne upute Centra za pomoć da prenesete fajlove na podržane e-čitače.
