Research Catalog

The undecidability of the domino problem, by Robert Berger.

Title
The undecidability of the domino problem, by Robert Berger.
Author
Berger, R. (Robert)
Publication
Providence, American Mathematical Society, 1966.

Items in the Library & Off-site

Filter by

1 Item

StatusFormatAccessCall NumberItem Location
Request for On-site UseRequest Scan
How do I pick up this item and when will it be ready?
TextRequest in advance ThesisOff-site

Holdings

Details

Description
72 p. illus.; 26 cm.
Summary
The Domino Problem deals with the class of all domino sets. It consists of deciding, for each domino set, whether or not it is solvable. We say that the Domino Problem is decidable or undecidable according to whether there exists or does not exist an algorithm which, given the specifications of an arbitrary domino set, will decide whether or not the set is solvable.
Series Statement
Memoirs of the American Mathematical Society ; no. 66
Uniform Title
Memoirs of the American Mathematical Society no. 66.
Subject
  • Numerical calculations
  • Decidability (Mathematical logic)
  • Solvable groups
  • Turing machines
Note
  • Cover title.
Bibliography (note)
  • Bibliography: p. 38.
Processing Action (note)
  • committed to retain
Contents
Introduction and outline -- Channels and signals -- The skeleton set, [italic capital]K -- The domino set [italic capital]D[italic capital subscript]Z.
OCLC
1353967
Owning Institutions
Harvard Library