Computability and unsolvability

Computability and unsolvability

Martin Davis
0 / 0
0 comments
Sukakah anda buku ini?
Bagaimana kualiti fail ini?
Muat turun buku untuk menilai kualitinya
Bagaimana kualiti fail yang dimuat turun?
Classic text considersgeneral theory of computability, computable functions, operations on computable functions, Turing machines self-applied, unsolvable decision problems, applications of general theory, mathematical logic, Kleene hierarchy, computable functionals, classification of unsolvable decision problems and more.
Kategori:
Computers - Computer Science
Tahun:
1985
Edisi:
New edition
Penerbit:
Dover Publications
Bahasa:
english
Halaman:
235
ISBN 10:
0486614719
ISBN 13:
9780486614717
Nama siri:
Mcgraw-Hill Series in Information Processing and Computers.
Fail:
DJVU, 1.73 MB
IPFS:
CID , CID Blake2b
english, 1985
Memuat turun (djvu, 1.73 MB)
  • Checking other formats...
Penukaran menjadi sedang dijalankan
Penukaran menjadi gagal

Istilah utama

 
theorem
recursive
function
computable
functions
turing
recursively
predicate
predicates
enumerable
chap
corollary
godel
decision
lemma
partial
primitive
exists
kleene
unsolvable
integers
suppose
partially
computability
semicomputable
sets
finite
diophantine
defined
machines
theorems
productions
mathematical
thue
arithmetical
axiom
systems
w.f.f
instantaneous
obtained
algorithm
total
quadruples
symbols
consequence
axioms
combinatorial
functionals
proved
immediate
computation
hierarchy
integer
αϊ
define
internal
logics
recursiveness
values
consider