Decider: Difference between revisions
Jump to navigation
Jump to search
| (One intermediate revision by the same user not shown) | |||
| Line 7: | Line 7: | ||
* [[Translated Cycler]] | * [[Translated Cycler]] | ||
* [[ | * [[Backward Reasoning]] | ||
* [[Closed Position Set (CPS)]] | * [[Closed Position Set (CPS)]] | ||
* [[Closed Tape Language (CTL)]] | * [[Closed Tape Language (CTL)]] | ||
Latest revision as of 20:24, 11 November 2024
A Decider (or a Filter) is a program which attempts to decide whether or not a given Turing machine (TM) will halt. Since the Halting Problem is uncomputable, no decider can decide all TMs, instead deciders categorize each TM into one of three categories: Halting, Proven Infinite, or Holdout.
There are a wide variety of methods used to construct deciders. Some broad categories are: Accelerated Simulators, Backwards Reasoning and Closed Set methods.
List of Deciders
- Translated Cycler
- Backward Reasoning
- Closed Position Set (CPS)
- Closed Tape Language (CTL)
- Finite Automata Reduction (FAR)
- Inductive Proof System
- Bouncer
- Halting Segment