Quasi-periodic configurations and undecidable dynamics for tilings, infinite words and Turing machines
type: Item
instance of: scholarly article
title: Quasi-periodic configurations and undecidable dynamics for tilings, infinite words and Turing machines
zbMATH Open document ID: 1044.03024
author: Jean-Charles Delvenne
author: Vincent D. Blondel
published in: Theoretical Computer Science
publication date: 2004-08-10T00:00:00Z
Mathematics Subject Classification ID: 03D10
Mathematics Subject Classification ID: 03D35
Mathematics Subject Classification ID: 37B50
Mathematics Subject Classification ID: 05B45
Mathematics Subject Classification ID: 37B40
zbMATH DE Number: 2085486
zbMATH Keywords: Tiling
zbMATH Keywords: Turing machine
zbMATH Keywords: Dynamical systems
zbMATH Keywords: Undecidability
zbMATH Keywords: Quasi-periodicity
MaRDI profile type: Publication
full work available at URL: j.tcs.2004.02.018
OpenAlex ID: W2164846953
cites work: The undecidability of the domino problem
cites work: On the presence of periodic configurations in Turing machines and in counter machines.
cites work: Q4100724
cites work: An aperiodic set of 13 Wang tiles
cites work: Tilings and quasiperiodicity.
cites work: The undecidability of the Turing machine immortality problem
cites work: The topological entropy of cellular automata is uncomputable
cites work: Strong cocycle triviality for \(Z^{2}\) subshifts
cites work: Rice's theorem for the limit sets of cellular automata
cites work: Q5457206
cites work: The topological entropy of iterated piecewise affine maps is uncomputable
cites work: On topological dynamics of Turing machines
DOI: 10.1016/J.TCS.2004.02.018
description: scientific article; zbMATH DE number 2085486