Advertisement

On the early history of register machines

  • G. Hasenjaeger
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 270)

Keywords

Register Machine Left Neighbour Universal Machine Program Tape Pushdown Store 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. AJDUKIEWICZ, K. [1935]: Die syntaktische Konnexität. Studia Philosophica, 1, 1–27. Lemberg 1935.Google Scholar
  2. BAUER, F. L. [1960]: The formula-controlled logical computer "Stanislaus", in Mathematical Tables and Other Aids to Computation, 64–67 (1960Google Scholar
  3. COHORS-FRESENBORG [1977]: Mathematik mit Kalkülen und Maschinen. Logik und Grundlagen der Mathematik Vol. 20. Braunschweig 1977.Google Scholar
  4. —, GRIEP, SCHWANK [1982]: Registermachines and Functions. Series U: Material for the teaching of Mathematics. Book 22 E. U of Osnabrück.Google Scholar
  5. DAVIS, M. [1985]: Turing's work on computability and the history of computers. AMS Abstracts March 1985, 133.Google Scholar
  6. HODGES, A. [1983]: ALAN TURING: The Enigma, New York 1983.Google Scholar
  7. MINSKY, M. L. [1961]: Recursive unsolvability of Post's problem of "TAG" and other topics in theory of Turing machines. Annals of Math. 74, 437–454.Google Scholar
  8. MOORE, E. F. [1953]: A simplified universal Turing machine, Proc. ACM, Sept. 8 1952, (1953).Google Scholar
  9. OTTMANN, TH. [1973]: Über Möglichkeiten zur Simulation endlicher Automaten durch eine Art sequentieller Netzwerke aus einfachen Bausteinen, ZMLG vol. 19, 223–238.Google Scholar
  10. RÖDDING, D. [1982]: Networks of Finite Automata I, Report on the 1st GTI-Workshop Paderborn, 184–197 (Ed. L. Priese 1983).Google Scholar
  11. — [1983]: Some Logical Problems Connected with a Modular Decomposition Theory of Automata, Computing and Proof Theory II, 365–388 (LNM 1104, Ed. M.M. Richter, E. Börger, W. Oberschelp, B. Schinzel, W. Thomas 1984)Google Scholar
  12. SHANNON, C. E. [1956]: A universal Turing machine with two internal states. Automata Studies, Princeton, 1956.Google Scholar
  13. WANG, H. [1957]: A variant of Turing's theory of computing machines. J. Assoc. Computing Machinery, Jan. 1957.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • G. Hasenjaeger
    • 1
  1. 1.University of BonnGermany

Personalised recommendations