募捐 9月15日2024 – 10月1日2024 关于筹款

Computability, enumerability, unsolvability: Directions in...

Computability, enumerability, unsolvability: Directions in recursion theory

S. B. Cooper, T. A. Slaman, S. S. Wainer
0 / 0
0 comments
你有多喜欢这本书？
下载文件的质量如何？
下载该书，以评价其质量
下载文件的质量如何？
种类:
Mathematics
年:
1996
出版社:
CUP
语言:
english
页:
355
ISBN 10:
0521557364
ISBN 13:
9780521557368
系列:
London Mathematical Society Lecture Note Series 224
文件:
DJVU, 2.18 MB
IPFS:
CID , CID Blake2b
english, 1996
线上阅读
正在转换
转换为 失败

关键词

 
degrees
generic
recursive
sets
r.e
theorem
function
degree
functions
genericity
finite
lattice
total
partial
defined
define
category
dense
enumerable
recursively
lemma
bounded
requirement
exists
element
suppose
subset
otherwise
infinitely
step
recursion
infinite
proposition
corollary
complexity
spies
meager
enumeration
jockusch
dtime
computable
hierarchy
embedding
soare
satisfy
standard
meets
equal
slaman
initial
turing
strings
assume
nfc
embeddings
cooper
lattices
extended
consider
priority

关联书单