skip to content
Computation: finite and infinite machines Preview this item
ClosePreview this item
Checking...

Computation: finite and infinite machines

Author: Marvin Lee Minsky
Publisher: Englewood Cliffs, N.J., Prentice-Hall [1967]
Series: Prentice-Hall series in automatic computation.
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Additional Physical Format: Online version:
Minsky, Marvin Lee, 1927-
Computation: finite and infinite machines.
Englewood Cliffs, N.J., Prentice-Hall [1967]
(OCoLC)558588187
Document Type: Book
All Authors / Contributors: Marvin Lee Minsky
OCLC Number: 523923
Description: xvii, 317 pages illustrations 24 cm.
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.
Series Title: Prentice-Hall series in automatic computation.
Responsibility: [by] Marvin L. Minsky.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/523923>
library:oclcnum"523923"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/523923>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:creator
schema:datePublished"1967"
schema:description"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."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/410502>
schema:inLanguage"en"
schema:name"Computation: finite and infinite machines"@en
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.