Backward Reasoning: Difference between revisions
Jump to navigation
Jump to search
(Added some information) |
m (See also format) |
||
| Line 3: | Line 3: | ||
==See also== | ==See also== | ||
* [https://github.com/bbchallenge/bbchallenge-proofs/blob/build-latex-pdf/deciders/correctness-deciders.pdf Section 4] of bbchallenge's deciders write-up. | |||
[[Category:Deciders]] | [[Category:Deciders]] | ||
Revision as of 22:35, 27 August 2025
Backward Reasoning is a decider which simulates Turing machines backwards from all possible halting configurations until a contradiction (or an impossible step) is reached. If a contradiction is reached from all possible halting configurations, the TM is shown to be non-halting. The amount of backward steps which are simulated can also be called the depth with which Backward Reasoning was applied.
See also
- Section 4 of bbchallenge's deciders write-up.