Text Register Machine Programs
Issues
More Programs
Universal Programs
The Enumeration Theorem
Undecidability
Self-Writing Programs and the Recursion Theorem
We use \(\one\hash\) to prove the undecidability of Post’s Correspondence Problem.
previous
Tiling
next
Logic
