Small universal register machines

Theoretical Computer Science

Volumn 168, Issue 2, 1996, Pages 267-301

  Korec, Ivan ^a  

^a INSTITUTE OF CHEMISTRY   (Slovakia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; SEQUENTIAL MACHINES; SHIFT REGISTERS; THEOREM PROVING;

NUMERICAL SEQUENCES; UNIVERSAL REGISTER MACHINES;

FINITE AUTOMATA;

EID: 0030283937     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00080-1     Document Type: Article

References (19)

1. J.G. Brookshear, Formal Languages, Automata, and Complexity (Benjamin/Cummings, Redwood City, 1989).
2. D.E. Cohen, Computability and Logic (Ellis Horwood, Chichester, 1987).
3. H. Davenport, Multiplicative Number Theory (Markham, Chicago, 1967) (Russian translation Moskva, Nauka, 1971).
4. Ľ. Gregušová and I. Korec, Small universal Minsky machines, in: J. Bečváfř ed., Mathematical Foundations of Computer Science, Proc 8th Symp., Olomouc, September 3-7, 1979, Springer Lecture Notes in Computer Science, Vol. 74 (Springer, Berlin, 1979) 308-316.
5. H. Iwaniec and M. Jutila, Primes in shorts interval, Ark. Mat. 17 (1979) 167-176.
6. F. Kaščák, Small universal one-state linear operator algorithm, in: I.M. Havel, V. Koubek, Eds., Mathematical Foundations of Computer Science. Proc 17th Symp., Prague, August 21-28, 1992, Springer Lecture Notes in Computer Science, Vol. 629 (Springer, Berlin, 1992) 327-335.
7. I. Korec, A complexity valuation of the partial recursive function following the expectation of the length of their computations on Minsky machines, Acta F. R. N. Univ. Comen.-Mathematica 23 (1969) 53-112.
8. I. Korec, Computational complexity based on expectation of the time of computation on Minsky Machines, in: I.M. Havel, ed., Mathematical Foundations of Computer Science, Proc. High Tatras, September 3-8, (1973), VVS OSN, Bratislava, 247-250.
9. I. Korec, Introduction to Theory of Algorithms (In Slovak), PF UK Bratislava, 1974.
10. I. Korec, Decidability (undecidability) of equivalence of Minsky machines with components consisting of at most seven (eight) elements, in: J. Gruska, ed., Mathematical Foundations of Computer Science, Proc. 6th Symp., Tatranská Lomnica, September 5-9, 1977, Springer Lecture Notes in Computer Science, Vol. 53 (Springer, Berlin, 1977) 324-332.
11. A.I. Malcev, Algorithms and Recursive Functions (in Russian) (Nauka, Moscow, 1965).
12. M. Margenstern, Nonerasing Turing machines: a frontier between a decidable halting problem and universality, Theoret. Comput. Sci. 129 (1994) 419-424.
13. M.L. Minsky, Computations: Finite and Infinite Machines (Prentice-Hall, Englewood Cliffs NJ).
14. C.J. Mozzochi, On the difference between consecutive primes, J. Number Theory 24 (1986) 181-187.
15. W. Narkiewicz, Number Theory (in Polish) (PWN, Warszawa, 1990).
16. H. Rogers, Theory of Recursive Functions and Effective Computability (McGraw-Hill, New York, 1967).
17. Yu. V. Rogozhin, Seven universal Turing machines (in Russian), Matematiceskije issledovanija 69 (1982) 76-90.
18. K. Weihrauch, Computability (Springer, Berlin, 1987).
19. N.J. Cutland, Computability (Cambridge University Press, 1980).