Small tile sets that compute while solving mazes

DOI10.4230/LIPICS.DNA.27.8arXiv2106.12341OpenAlexW3202402598MaRDI QIDQ6076675

Damien Woods, Tristan Stérin, Matthew Cook

Publication date: 21 September 2023

Full work available at URL: https://arxiv.org/abs/2106.12341

zbMATH Keywords

self-assemblyBoolean circuitsmodel of computationmaze-solvingsmall universal tile set

Mathematics Subject Classification ID

Switching theory, applications of Boolean algebras to circuits and networks (94C11) Other nonclassical models of computation (68Q09) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

This page was built for publication: Small tile sets that compute while solving mazes