Turing machines, tiles, and computability

Karl Peter Hadeler, Johannes Müller

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

Cellular automata can be seen as dynamical systems or as algebraic or combinatorial objects, but one can also take the word automaton literally and use methods from logic and languages.

Original languageEnglish
Title of host publicationSpringer Monographs in Mathematics
PublisherSpringer Verlag
Pages197-252
Number of pages56
Edition9783319530420
DOIs
StatePublished - 2017
Externally publishedYes

Publication series

NameSpringer Monographs in Mathematics
Number9783319530420
ISSN (Print)1439-7382

Fingerprint

Dive into the research topics of 'Turing machines, tiles, and computability'. Together they form a unique fingerprint.

Cite this