Tag
encodings
- Jan 21, 2026 Encoding Turing Machines and the Undecidability of Acceptance How a machine becomes a finite string, what a configuration record contains, and why diagonalization over that encoding rules out any decider for acceptance. computation theory
- Nov 10, 2025 The Post Correspondence Problem as a Reduction Source How a set of domino pairs encodes a computation through matched strings, why no algorithm can decide whether a match exists, and why this formulation is the convenient origin for other undecidability proofs. computation theory