Non Erasing Turing Machines: A Frontier Between a Decidable Halting Problem and Universality

Authors:
Maurice Margenstern
Affiliations:
-
Venue:
FCT '93 Proceedings of the 9th International Symposium on Fundamentals of Computation Theory
Year:
1993

Citing 0
Cited 3

The Complexity of Small Universal Turing Machines

CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
The complexity of small universal Turing machines: A survey

Theoretical Computer Science
The complexity of small universal turing machines: a survey

SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract