Computation: finite and infinite machines [by] Marvin L. Minsky.

Englewood Cliffs, N.J., Prentice-Hall [1967] .

Location Call Number Status Consortium Loan
George Washington
Gelman stacks
QA 267 .M55 Available Request
WRLC Shared Collections Facility
QA 267 .M55 Off-site
LIB stacks
QA76.5 .P684 v.9 Available Request
WRLC Shared Collections Facility
QA267.M66 C7 Off-site
Van Ness stacks
QA 267 .M55 Available Request
Van Ness stacks
QA 267 .M55 Available Request
UNIV General stacks
621.3 M66c Available Request
George Mason
Fenwick stacks
QA267 .M55 Available Request
Off-Campus Shelving
QA267 .M55 Available Request
Subjects Automates mathématiques, Théorie des.
Automates mathématiques, théorie des.
Calcul automatique.
Machine theory.
Series Prentice-Hall series in automatic computation.
Description xvii, 317 pages illustrations 24 cm.
Copyright Date [1967]
Notes Includes bibliographical references (pages 301-308).
Also issued online.
Contents Physical machines and their abstract counterparts -- Part 1: Finite-state machines -- Neural networks. Automata made up of parts -- The memories of events in finite-state machines -- Part 2: Infinite machines -- Computability, effective procedures, and algorithms. Infinite machines -- Turing machines -- Universal turing machines -- Limitations of effective computability: some problems not solvable by instruction-obeying machines -- The computable real numbers -- The relations between turing machines and recursive functions -- Models similar to digital computers -- Part 3: Symbol-manipulation systems and computability -- The symbol-manipulation systems of post -- Post's normal-form theorem -- Very simple bases for computability -- Solutions to selected problems.
Network Numbers (OCoLC)523923
WorldCat Search OCLC WorldCat
WorldCat Identities Minsky, Marvin Lee, 1927-
Publication timeline, list of works, related names and subjects and other information


Export citation to: RefWorks