User:Autumn-Pan/Head-Position-Reachability: Difference between revisions
Jump to navigation
Jump to search
Autumn-Pan (talk | contribs) Created page with "Head-Position Reachability is a variant of backwards reasoning that seeks to decide nonhalting Turing machines." |
Autumn-Pan (talk | contribs) add history |
||
| Line 1: | Line 1: | ||
Head- | Head-position reachability is a proposed framework based on [[Backward Reasoning]] that aims to decide non-halting Turing machines. | ||
== History == | |||
* In January 2026, a [[BB(6)]] holdout was informally solved with concepts based on Backward Reasoning | |||
* By March 2026, the ideas explored in January were formalized by Autumn Pan and RobinCodes | |||
Revision as of 15:53, 23 February 2026
Head-position reachability is a proposed framework based on Backward Reasoning that aims to decide non-halting Turing machines.
History
- In January 2026, a BB(6) holdout was informally solved with concepts based on Backward Reasoning
- By March 2026, the ideas explored in January were formalized by Autumn Pan and RobinCodes