Simulating a Turing machine with addition and multiplication by encoding the tape as a number
jessi_cata · x · 2026-10-18
jessicata explains encoding a Turing machine tape as two natural numbers (left/right of the head in base-N), so reading symbols and sliding the tape reduce to mod, division, and multiplication — answering how if-then-else can be built from Peano arithmetic.
Related event: Addition and Multiplication Alone Suffice to Simulate Turing Machines(4 posts)→
More from Research
- TRACE Open-Sourced: Migrating G1 Controller to Full-Size Humanoid H2 in 8 Hours on One GPU — zhengyiluo · 2026-10-18
- Humanoid Robot Funding Tops $3B as Brian Potter Explains the VLA Models Driving Robots — scottleibrand · 2026-10-18
- Terence Tao on 'War Footing' as OpenAI Claims Navier-Stokes Solve Shakes Mathematics — AlexTensor · 2026-10-18
- Univ. of Tokyo paper: why your recorded voice feels eerie — a vocal uncanny valley — ssh4net · 2026-10-18
- MIT's SANDO Drone Planner Avoids Every Moving Obstacle Across 12 Real Flights — Olivier__OG · 2026-10-18
- No-backprop pretraining speedup of 2.3x claimed, inspired by mech interp essay — CatAstro_Piyush · 2026-10-18