rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Computation
    sub title: finite and infinite machines
  name:
    name part: Minsky, Marvin Lee
    name part: 1927-
    role:
      role term: creator
  type of resource: text
  genre: bibliography
  origin info:
    place:
      place term: nju
    place:
      place term: Englewood Cliffs, N.J
    publisher: Prentice-Hall
    date issued: c1967
    date issued: 1967
    issuance: monographic
  language:
    language term: eng
  physical description:
    extent: xvii, 317 p. : il. ; 24 cm.
  table of contents: Lista de secciones: 1. Physical machines and their abstract counterparts -- 2. Finite-state machines -- 3. Neural networks. Automata made up of parts -- 4. The memories of events in finite-state machines -- 5. Computability, effective procedures, and algorithms. Infinite machines -- 6. Turing machines -- 7. Universal Turing machines -- 8. Limitations of effective computability: some problems not solvable by instruction-obeying machines -- 9. The computable real numbers -- 10. The relations between Turing machines and recursive functions -- 11. Models similar to digital computers -- 12. The symbol-manipulation systems of Post -- 13. Post's normal-form theorem -- 14. Very simple bases for computability -- 15. Solutions to selected problems -- 16. Suggestions for further reading and descriptor-indexed bibliography.
  note: Marvin L. Minsky.
  note: MR, 50 #9050
  note: Bibliografía: p. 301-308.
  classification: 68Qxx
  related item:
    title info:
      title: Prentice-Hall series in automatic computation
  related item:
    note: MR, 50 #9050
  identifier: 67012342
  record info:
    record creation date: 740410
    record change date: 20130406185019.0
    record identifier: MAT.inmabb001811