Bounded Queries in Recursion Theory
William Levine · Georgia Martin
ທ.ວ. 2012 · Progress in Computer Science and Applied Logic ຫົວທີ 16 · Springer Science & Business Media
ປຶ້ມອີບຸກ
353
ໜ້າ
reportບໍ່ໄດ້ຢັ້ງຢືນການຈັດອັນດັບ ແລະ ຄຳຕິຊົມ ສຶກສາເພີ່ມເຕີມ
ກ່ຽວກັບປຶ້ມ e-book ນີ້
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.
ໃຫ້ຄະແນນ e-book ນີ້
ບອກພວກເຮົາວ່າທ່ານຄິດແນວໃດ.
ອ່ານຂໍ້ມູນຂ່າວສານ
ສະມາດໂຟນ ແລະ ແທັບເລັດ
ຕິດຕັ້ງ ແອັບ Google Play Books ສຳລັບ Android ແລະ iPad/iPhone. ມັນຊິ້ງຂໍ້ມູນໂດຍອັດຕະໂນມັດກັບບັນຊີຂອງທ່ານ ແລະ ອະນຸຍາດໃຫ້ທ່ານອ່ານທາງອອນລາຍ ຫຼື ແບບອອບລາຍໄດ້ ບໍ່ວ່າທ່ານຈະຢູ່ໃສ.
ແລັບທັອບ ແລະ ຄອມພິວເຕີ
ທ່ານສາມາດຟັງປຶ້ມສຽງທີ່ຊື້ໃນ Google Play ໂດຍໃຊ້ໂປຣແກຣມທ່ອງເວັບຂອງຄອມພິວເຕີຂອງທ່ານໄດ້.
eReaders ແລະອຸປະກອນອື່ນໆ
ເພື່ອອ່ານໃນອຸປະກອນ e-ink ເຊັ່ນ: Kobo eReader, ທ່ານຈຳເປັນຕ້ອງດາວໂຫຼດໄຟລ໌ ແລະ ໂອນຍ້າຍມັນໄປໃສ່ອຸປະກອນຂອງທ່ານກ່ອນ. ປະຕິບັດຕາມຄຳແນະນຳລະອຽດຂອງ ສູນຊ່ວຍເຫຼືອ ເພື່ອໂອນຍ້າຍໄຟລ໌ໄໃສ່ eReader ທີ່ຮອງຮັບ.
