Confusion of memory

Information Processing Letters

Volumn 107, Issue 3-4, 2008, Pages 114-119

  Moss, Lawrence S ^a  

^a INDIANA UNIVERSITY   (United States)

Author keywords

Formal languages; Models of computation; Theory of computation

Indexed keywords

COMPUTATIONAL METHODS; FORMAL LANGUAGES; HIERARCHICAL SYSTEMS; MATHEMATICAL MODELS;

HALTING PROBLEM; SELF-REPLICATING MACHINES;

QUEUEING THEORY;

EID: 44649138568     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2008.02.002     Document Type: Article

References (7)

1. Enderton H.B. A Mathematical Introduction to Logic. second ed. (2001), Harcourt/Academic Press, Burlington, MA
2. Minsky M.L. Recursive unsolvability of Post's problem of "tag" and other topics in theory of Turing machines. Ann. of Math. (2) 74 (1961) 437-455
3. Minsky M.L. Computation: Finite and Infinite Machines. Prentice-Hall Series in Automatic Computation (1967), Prentice-Hall, Inc., Englewood Cliffs, NJ
4. Moss L.S. Recursion theorems and self-replication via text register machine programs. Bulletin of the European Association for Theoretical Computer Science 89 (2006) 171-182
5. Palis M.A., and Shende S.M. Pumping lemmas for the control language hierarchy. Math. Systems Theory 28 3 (1995) 199-213
6. Shepherdson J.C., and Sturgis H.E. Computability of recursive functions. J. ACM 10 (1963) 217-255
7. Weir D.J. A geometric hierarchy beyond context-free languages. Theoret. Comput. Sci. 104 2 (1992) 235-261