Decider

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, Backward 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
• Cycler
• Repeated Word List (RepWL)
• n-Gram Closed Position Set (n-Gram CPS)

See also

https://bbchallenge.org/method#deciders