cover image

Computability theory : an introduction / Neil D. Jones.


New York : Academic Press, 1973.
ISBN 0123900506, 9780123900500

Location Call Number Status Consortium Loan
George Washington
Gelman stacks
QA 248.5 .J66 Available Request
American
LIB stacks
QA248.5 .J66 Available Request
Gallaudet
UNIV General stacks
621.3 J78c Available Request
Georgetown
Lauinger stacks
QA248.5 .J66 Available Request
Howard
Founders Library stacks
QA248.5 J66 Available Request
Subjects Berechenbarkeit.
Computable functions.
Computer.
Fonctions récursives.
Recursive functions.
Theorie.
Turing machines.
Turing, Machines de.
calculabilité
fonction récursive.
machine Turing.
Series ACM monograph series.
Description xiv, 154 pages ; 24 cm.
Copyright Date 1973.
Notes Includes bibliographical references (pages 149-150) and index.
Also issued online.
Contents Mathematical basis -- Introduction to computability -- Description of Turing machines by predicates -- Decision of predicates by Turing machines -- The normal form theorems and consequences -- Other formulations of computability.
Network Numbers (OCoLC)623268
(OCoLC)ocm00623268
WorldCat Search OCLC WorldCat
WorldCat Identities Jones, Neil D.
Publication timeline, list of works, related names and subjects and other information

Services

Export citation to: RefWorks