Advertisement

To the functional equivalence of Turing machines

  • V. A. Zakharov
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 278)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature

  1. 1.
    Rice M.G. Classes of recursively enumerables sets and their decesion problems. Trans.Amer.Math.Soc. 74(1953), 358–366.Google Scholar
  2. 2.
    Янов Ю.И. О логических схемах алгоритмов. Проблемы кибернетики 1 (1958), 79–127.Google Scholar
  3. 3.
    Ерщов А.П. Современное состояние теории схем программ. Проблемы кибернетики 27 (1973), 87–110.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • V. A. Zakharov
    • 1
  1. 1.Moscow State UniversityUSSR

Personalised recommendations