Periodicity in generations of automata

@article{Case2005PeriodicityIG,
  title={Periodicity in generations of automata},
  author={J. Case},
  journal={Mathematical systems theory},
  year={2005},
  volume={8},
  pages={15-32}
}
  • J. Case
  • Published 2005
  • Mathematics, Computer Science
  • Mathematical systems theory
  • A class of automata which build other automata is defined. These automata are called Turing machine automata because each one contains a Turing machine which acts as its computer-brain and which completely determines what its offspring, if any, will be. We show that for the descendants of an arbitrary progenitor Turing machine automaton there are exactly three possibilities: (1) there is a sterile descendant after an arbitrary number of generations, (2) after a delay of an arbitrary number of… CONTINUE READING
    67 Citations

    Topics from this paper

    From Turing machines to computer viruses
    • J. Marion
    • Mathematics, Medicine
    • Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
    • 2012
    • 11
    • PDF
    Jumps of computably enumerable equivalence relations
    • 10
    • PDF
    Properties Complementary to Program Self-Reference
    • 1
    • PDF
    Properties Complementary to Program Self-reference
    • 4
    Theoretical computer science and the natural sciences
    • 14
    The universal numbers. From Biology to Physics.
    • B. Marchal
    • Computer Science, Medicine
    • Progress in biophysics and molecular biology
    • 2015
    • 5
    Effectivity questions for Kleene's recursion theorem
    • 2
    Computability-theoretic learning complexity
    • J. Case, Timo Kötzing
    • Mathematics, Medicine
    • Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
    • 2012
    • 5
    • PDF

    References

    SHOWING 1-10 OF 33 REFERENCES
    A Note on Degrees of Self-Describing Turing Machines
    • 17
    Universality in Cellular Automata
    • 69
    INFORMATION PROCESSING AND TRANSMISSION IN CELLULAR AUTOMATA
    • 94
    Sexually reproducing cellular automata
    • 34
    • PDF
    Computing ability of a developmental model for filamentous organisms.
    • G. Herman
    • Mathematics, Medicine
    • Journal of theoretical biology
    • 1969
    • 46
    The chemical basis of morphogenesis
    • A. Turing
    • Mathematics
    • Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences
    • 1952
    • 5,242
    A note on some systems of lindenmayer
    • D. Dalen
    • Computer Science
    • Mathematical systems theory
    • 2005
    • 12
    Developmental systems without cellular interactions, their languages and grammars.
    • 239
    What use is sex?
    • J. M. Smith
    • Biology, Medicine
    • Journal of theoretical biology
    • 1971
    • 390
    Automata theory and development: Part I
    • 27