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

Maurice Margenstern. Non-Erasing Turing Machines: A New Frontier Between a Decidable Halting Problem and Universality. In Ricardo A. Baeza-Yates, Eric Goles Ch., Patricio V. Poblete, editors, LATIN 95: Theoretical Informatics, Second Latin American Symposium, Valparaíso, Chile, April 3-7, 1995, Proceedings. Volume 911 of Lecture Notes in Computer Science, pages 386-397, Springer, 1995.

Abstract

Abstract is missing.