An Engineering Reading of the Bounded Halting Problem and Observable Properties of a Universal Machine
cs.CC, cs.AI, cs.FL, math.LO
Submitted: 2026-11-04
Updated: 2026-11-04
Project page: https://lucatrevisan.github.io/cs278-08/lecture01.pdf
Terminology
Sources
- The Expressive Power of Transformers with Chain of Thought
- Chain-of-Thought Prompting Elicits Reasoning in Large Language Models
- On the Practical Computational Power of Finite Precision RNNs for Language Recognition
Related papers
- The Proof Analysis Problem for Constant-Depth Frege
- Hardness of Counting Orderings: Taking Gadget Amplification to the Limit
- Rigorous Low-Degree Implications for Planted Subgraph Detection: Noise and Treewidth
- Parameterized Hardness of Zonotope Containment and Neural Network Verification
- From Block Orthogonality to Decidability in Complex-Weighted Counting CSP
- Random Clocks on Computation Paths: How Far Can They Reach, and When Does Stepping Back Help?