On the Representability of Algorithmically Decidable Predicates by Rabin Machines

  • R. I. Friedzon
Part of the Seminars in Mathematics book series (SM, volume 4)


We shall call the multitape Turing machines with input described in [1], Rabin machines. ‡ It is proved herein that no matter what the retardation function, an algorithmically decidable predicate π can be constructed such that for any natural number k the predicate π is not representable by any k-tape Rabin machine with this retardation. Moreover, a certain class of predicates representable in real time by Rabin machines is described.


Natural Number Turing Machine Finite Automaton Constructive Mathematic Retardation Function 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature Cited

  1. 1.
    Rabin, M. O., “Real-time computation,” Israel J. Math. 1(4):203–211 (1963).Google Scholar
  2. 2.
    Maslov, S. Yu., “Some properties of the apparatus of the canonical calculi of E. L. Post,” Trudy Steklov Mat. Inst. Akad. Nauk SSSR, 72:5–68 (1964).Google Scholar
  3. 3.
    Lukasiewicz, J., “Sur la formalisation des théories mathëmatiques,” Colloques Internationaux du Centre National de La Récherche Scientifique, Paris, 26:11–19 (1950).Google Scholar
  4. 4.
    Büchi, R. J., “Regular canonical systems,” Arch. math. Logik und Grundlagenforsch. 6:3–4 (1964).Google Scholar

Copyright information

© Consultants Bureau 1969

Authors and Affiliations

  • R. I. Friedzon

There are no affiliations available

Personalised recommendations