Undecidability Of Some Domino Connectability Problems

DOI10.1002/MALQ.19820282204MaRDI QIDQ3958446zbMATH OpenOpenAlexFDO

Authors Heinz-Dieter Ebbinghaus

Publication date 1982

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19820282204

zbMATH Keywords

domino gameshalting problem for register machines

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Word problems, etc. in computability and recursion theory (03D40) Combinatorial aspects of tessellation and tiling problems (05B45)

Cited in

(3)

• Path finding in the tile assembly model
• On the solvability of domino snake problems
• Undecidability principle and the uncertainty principle even for classical systems

This page was built for publication: Undecidability Of Some Domino Connectability Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3958446)