Contatto
Come acquistare
Consegna
Guida all'acquisto
Bounded Queries in Recursion Theory
Inglese
263 b
Fino a 30 giorni per il reso
I clienti hanno acquistato anche
/
In brossura
52.69
€
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.
Informazioni sul libro
Inglese
Regala questo libro oggi stesso
È facile
1 Aggiungi il libro al carrello e scegli la consegna come regalo 2 Ti invieremo subito il buono 3 Il libro arriverà all'indirizzo del destinatarioPotrebbe interessarti anche
/
In brossura
45.79
€
/
In brossura
392.69
€
/
In brossura
8.89
€
Ciao! Sono Libroamiko, il tuo consulente di libri.
Come posso aiutarti?