Decider: Difference between revisions

From BusyBeaverWiki
Jump to navigation Jump to search
Polygon (talk | contribs)
→List of Deciders: added Repeated Word List
Azerty (talk | contribs)
other computational models
 
(2 intermediate revisions by one other user not shown)
Line 3: Line 3:


There are a wide variety of methods used to construct deciders. Some broad categories are: [[Accelerated Simulator]]s, [[Backward Reasoning]] and [[Closed Set]] methods.
There are a wide variety of methods used to construct deciders. Some broad categories are: [[Accelerated Simulator]]s, [[Backward Reasoning]] and [[Closed Set]] methods.
The definition may be extended to other Busy Beaver function with different computational models.


== List of Deciders ==
== List of Deciders ==
Line 15: Line 17:
* [[Halting Segment]]
* [[Halting Segment]]
* [[Cycler]]
* [[Cycler]]
* [[Repeated Word List]] (RepWL)
* [[Repeated Word List]] (RepWL or RepWL_ES)
* [[RWLAcc]], an accelerated simulator similar to Quick_Sim
* [[NGram CPS|n-Gram Closed Position Set]] (n-Gram CPS) with the possible augmentations of Fixed-length history and Least Recent Usage history (LRU)


== See also ==
== See also ==
https://bbchallenge.org/method#deciders
https://bbchallenge.org/method#deciders

Latest revision as of 21:31, 15 August 2026

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.

The definition may be extended to other Busy Beaver function with different computational models.

List of Deciders

See also

https://bbchallenge.org/method#deciders