1 problem

0 votes0 replies2 views
Decidability of the halting problem for periodic unary networks on the square lattice
Unary network decidability conjecture. The halting problem for a periodic unary network on $\mathbb Z^2$ with finitely many messages added is decidable.
Conjectureopencomputational-complexity message-passing-networks planar-graphsarXiv posted 2 days ago

Decidability of the halting problem for periodic unary networks on the square lattice