Self-describing Turing machines

Authors:
Maurice Margenstern;Yurii Rogozhin
Affiliations:
Université de Metz, I.U.T. de Metz, LITA, EA 3097, Ile du Saulcy, 57045 Metz Cedex, France;Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova,5 Academiei str., Kishinev MD-2028, Moldova
Venue:
Fundamenta Informaticae
Year:
2002

Citing 7
Cited 0

From universal Turing machines to self-reproduction

A half-century survey on The Universal Turing Machine
Self-reproduction in a reversible cellular space

Theoretical Computer Science - Special issue on universal machines and computations
A Variant to Turing's Theory of Computing Machines

Journal of the ACM (JACM)
A Note on Degrees of Self-Describing Turing Machines

Journal of the ACM (JACM)
Self-Inspection Based Reproduction in Cellular Automata

Proceedings of the Third European Conference on Advances in Artificial Life
Computation: finite and infinite machines

Computation: finite and infinite machines
Cellular Automata

Cellular Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

After a sketchy historical account on the question of self-describeness and self-reproduction, and after discussing the definition of suitable encodings for self-describeness, we give the construction of several self-describing Turing machines, namely self-describing machines with, respectively, 350, 267, 224 and 206 instructions.