List of redirects

Jump to navigation Jump to search

Showing below up to 50 results in range #151 to #200.

View ( | ) (20 | 50 | 100 | 250 | 500)

  1. Busy Beaver functions → Busy Beaver Functions
  2. CA → Cellular automaton
  3. CET → Catch-Em-Turing
  4. CPS → Closed Position Set
  5. CTL → Closed Tape Language
  6. Champion → Champions
  7. Closed Position Set (CPS) → Closed Position Set
  8. Closed Tape Language (CTL) → Closed Tape Language
  9. Cryptid → Cryptids
  10. Cyclic Tree Busy Beaver → Cyclic Tree Rewriting System
  11. Deciders → Decider
  12. Directed Head Notation → Directed head notation
  13. Enumerator → Enumeration
  14. FAR → Finite Automata Reduction
  15. FEBB → Forced Extensioned Busy Beaver
  16. FGH → Fast-Growing Hierarchy
  17. Fast-Growing Hierarchy Growth Bound Theorem → Fast-Growing Hierarchy#Growth Bound Theorem
  18. Fast-growing hierarchy → Fast-Growing Hierarchy
  19. Fenrir → Fractran#Size 22: Fenrir
  20. Finite Automata Reduction (FAR) → Finite Automata Reduction
  21. Frankenstein's Monster → Fractran#Frankenstein's Monster
  22. GRF → General Recursive Function
  23. Generalized Collatz Problem → Generalized Collatz Function
  24. Generalized Collatz Problems → Generalized Collatz Function
  25. Hashlife → Accelerated simulator#hashlife
  26. Holdout → Holdouts lists
  27. Holdout lists → Holdouts lists
  28. Holdouts → Holdouts lists
  29. Holdouts list → Holdouts lists
  30. Independence from ZFC → Logical independence
  31. Inductive Proof → Inductive Proof System
  32. Inductive rule → Inductive Proof System
  33. Initial Busy Beaver → Least Busy Beaver
  34. LIATA → Piecewise Affine Function
  35. Lambda calculus → Lambda Calculus
  36. Least busy beaver → Least Busy Beaver
  37. Limited Instruction Busy Beaver → Instruction-Limited Busy Beaver
  38. Linear-Inequality Affine Transformation Automata → Piecewise Affine Function
  39. MBB → Register machine
  40. MCET → Catch-Em-Turing#Extension
  41. MITMWFAR → Meet-in-the-Middle Weighted Finite Automata Reduction (MITMWFAR)
  42. Minsky machine → Register machine
  43. Multi-tape TMs → Multi-tape Turing Machines
  44. N-Gram CPS → NGram CPS
  45. NGramCPS → NGram CPS
  46. Non-halting Turing Machines → Non-halting Turing machine
  47. Num → Maximum Consecutive Ones Function
  48. Oriented state → Directed head notation
  49. PAF → Piecewise Affine Function
  50. Post Tag → Post Tag System

View ( | ) (20 | 50 | 100 | 250 | 500)