Turing's Parsing and Brute Force Are Incorrect
Abstract
The critique raised about brute force and parsing (encoding) in the context of the Turing Machine (TM) touches the foundations of computability theory. The argument focuses on the fact that any representation system (parsing) of a machine within another generates an intrinsic limitation revealed by diagonalization.
Fields of Study & Subjects
Computability
Logic
AI Algorithms
semigroups and automata theory
programming
and type systems
Publication details
- Journal / source
- Zenodo (CERN European Organization for Nuclear Research)
- Publication date
- 7 February 2026
- Language
- EN
- Document type
- Preprint