-
1
Computability
Berlin ; New York : Springer-Verlag, 1987Format: Book
//IF NOT LOGGED IN - FORCE LOGIN ?>
//ELSE THEY ARE LOGGED IN PROCEED WITH THE OPEN URL CODE:?> -
2
A hierarchy of Turing degrees : a transfinite hierarchy of lowness notions in the computably enumerable degrees, unifying classes, and natural definability
Princeton, New Jersey : Princeton University Press, 2020Format: Book
//IF NOT LOGGED IN - FORCE LOGIN ?>
//ELSE THEY ARE LOGGED IN PROCEED WITH THE OPEN URL CODE:?> -
3
Computability and noncomputability in classical analysis
Format: Book
//IF NOT LOGGED IN - FORCE LOGIN ?>
//ELSE THEY ARE LOGGED IN PROCEED WITH THE OPEN URL CODE:?> -
4
Computation : computability, similarity, and duality
London : New York : Pitman ; J. Wiley, 1986Format: Book
//IF NOT LOGGED IN - FORCE LOGIN ?>
//ELSE THEY ARE LOGGED IN PROCEED WITH THE OPEN URL CODE:?> -
5
Concise guide to computation theory
London ; New York : Springer, 2011Format: Book
//IF NOT LOGGED IN - FORCE LOGIN ?>
//ELSE THEY ARE LOGGED IN PROCEED WITH THE OPEN URL CODE:?> -
6
Church's thesis after 70 years
Frankfurt : Ontos, 2006Format: Book
//IF NOT LOGGED IN - FORCE LOGIN ?>
//ELSE THEY ARE LOGGED IN PROCEED WITH THE OPEN URL CODE:?> -
7
Computability and logic
Chichester, West Sussex, England : New York : E. Horwood ; Halsted Press, 1987Format: Book
//IF NOT LOGGED IN - FORCE LOGIN ?>
//ELSE THEY ARE LOGGED IN PROCEED WITH THE OPEN URL CODE:?> -
8
Computability and logic
Cambridge [England] : University Press, 1974Format: Book
//IF NOT LOGGED IN - FORCE LOGIN ?>
//ELSE THEY ARE LOGGED IN PROCEED WITH THE OPEN URL CODE:?> -
9
Enumerability, decidability, computability; an introduction to the theory of recursive functions
Berlin, New York, Springer-Verlag, 1965Format: Book
//IF NOT LOGGED IN - FORCE LOGIN ?>
//ELSE THEY ARE LOGGED IN PROCEED WITH THE OPEN URL CODE:?> -
10
A programming approach to computability
New York, N.Y. : Springer-Verlag, 1982Format: Book
//IF NOT LOGGED IN - FORCE LOGIN ?>
//ELSE THEY ARE LOGGED IN PROCEED WITH THE OPEN URL CODE:?> -
11
Elementary computability, formal languages, and automata
Englewood Cliffs, N.J. : Prentice-Hall, 1982Format: Book
//IF NOT LOGGED IN - FORCE LOGIN ?>
//ELSE THEY ARE LOGGED IN PROCEED WITH THE OPEN URL CODE:?> -
12
Definability and computability
New York : Consultants Bureau, 1996Format: Book
//IF NOT LOGGED IN - FORCE LOGIN ?>
//ELSE THEY ARE LOGGED IN PROCEED WITH THE OPEN URL CODE:?> -
13
Computability theory: an introduction
New York, Academic Press, 1973Format: Book
//IF NOT LOGGED IN - FORCE LOGIN ?>
//ELSE THEY ARE LOGGED IN PROCEED WITH THE OPEN URL CODE:?> -
14
Recursion on the countable functionals
Berlin : New York. Springer-Verlag, 1980Format: Book
//IF NOT LOGGED IN - FORCE LOGIN ?>
//ELSE THEY ARE LOGGED IN PROCEED WITH THE OPEN URL CODE:?> -
15
Computability and complexity theory
New York : Springer, 2001Format: Book
//IF NOT LOGGED IN - FORCE LOGIN ?>
//ELSE THEY ARE LOGGED IN PROCEED WITH THE OPEN URL CODE:?> -
16
The theory of computer science : a programming approach
London : New York : Chapman and Hall ; Wiley : distributed in the U.S.A. by Halsted Press, 1977Format: Book
//IF NOT LOGGED IN - FORCE LOGIN ?>
//ELSE THEY ARE LOGGED IN PROCEED WITH THE OPEN URL CODE:?> -
17
Computability, complexity, logic
Amsterdam ; New York : New York, N.Y., U.S.A. North-Holland ; Distributors for the U.S.A. and Canada : Elsevier Science Pub. Co., 1989Format: Book
//IF NOT LOGGED IN - FORCE LOGIN ?>
//ELSE THEY ARE LOGGED IN PROCEED WITH THE OPEN URL CODE:?> -
18
Models of computation and formal languages
New York : Oxford University Press, 1998Format: Book
//IF NOT LOGGED IN - FORCE LOGIN ?>
//ELSE THEY ARE LOGGED IN PROCEED WITH THE OPEN URL CODE:?> -
19
Computability & unsolvability
New York : Dover, 1982
Dover ed.Format: Book
//IF NOT LOGGED IN - FORCE LOGIN ?>
//ELSE THEY ARE LOGGED IN PROCEED WITH THE OPEN URL CODE:?> -
20
The undecidable; basic papers on undecidable propositions, unsolvable problems and computable functions.
Hewlett, N.Y., Raven Press 1965Format: Book
//IF NOT LOGGED IN - FORCE LOGIN ?>
//ELSE THEY ARE LOGGED IN PROCEED WITH THE OPEN URL CODE:?>