Pages that link to "Turing reduction"
Showing 50 items.
- Alan Turing (links | edit)
- Oracle machine (links | edit)
- Preorder (links | edit)
- ♯P-complete (links | edit)
- Turing completeness (links | edit)
- Reductionism (links | edit)
- PSPACE-complete (links | edit)
- NP-easy (links | edit)
- Computability theory (links | edit)
- Polynomial-time reduction (links | edit)
- Many-one reduction (links | edit)
- Combinatorial optimization (links | edit)
- Computability logic (links | edit)
- List of terms relating to algorithms and data structures (links | edit)
- Turing degree (links | edit)
- Post's theorem (links | edit)
- Reduction (complexity) (links | edit)
- Log-space reduction (links | edit)
- SL (complexity) (links | edit)
- Turing reduction (transclusion) (links | edit)
- Cook reduction (redirect page) (links | edit)
- Stephen Cook (links | edit)
- Complexity class (links | edit)
- List of terms relating to algorithms and data structures (links | edit)
- Counting problem (complexity) (links | edit)
- User:Jaydavidmartin/Complexity class (links | edit)
- Wikipedia:WikiProject Mathematics/PlanetMath Exchange/68-XX Computer science (links | edit)
- Wikipedia:Missing science topics/ExistingMathC (links | edit)
- Complement (complexity) (links | edit)
- Simple set (links | edit)
- Relative computability (redirect page) (links | edit)
- Computable function (links | edit)
- Turing jump (links | edit)
- Albert Muchnik (links | edit)
- Talk:Arithmetical hierarchy (links | edit)
- Talk:Turing reduction (links | edit)
- Talk:Recursion theory (links | edit)
- User:Ruud Koot/Recursion theory (links | edit)
- User:Jochen Burghardt/sandbox8 (links | edit)
- A-computable (redirect page) (links | edit)
- Turing reducible (redirect page) (links | edit)
- Computability theory (links | edit)
- Turing degree (links | edit)
- Algorithmically random sequence (links | edit)
- Truth-table reduction (links | edit)
- A-recursive set (redirect page) (links | edit)
- Co-A-recursive set (redirect page) (links | edit)
- Turing completeness (reduction) (redirect page) (links | edit)
- Turing complete (reduction) (redirect page) (links | edit)
- Turing complete set (redirect page) (links | edit)
- Arithmetical hierarchy (links | edit)
- Kleene's T predicate (links | edit)
- Completeness (links | edit)
- Turing reducibility (redirect page) (links | edit)
- Arithmetical hierarchy (links | edit)
- Index of philosophy articles (R–Z) (links | edit)
- Second-order arithmetic (links | edit)
- Reduction (computability theory) (links | edit)
- Low (computability) (links | edit)
- High (computability) (links | edit)
- PA degree (links | edit)
- Computation in the limit (links | edit)
- Algorithmically random sequence (links | edit)
- Reduction (computability theory) (links | edit)
- Martin measure (links | edit)
- Hyperarithmetical theory (links | edit)
- Sparse language (links | edit)
- ♯P-completeness of 01-permanent (links | edit)
- Halting problem (links | edit)
- NP-completeness (links | edit)
- Metric k-center (links | edit)
- Berman–Hartmanis conjecture (links | edit)
- Matroid oracle (links | edit)
- K-trivial set (links | edit)
- Mahaney's theorem (links | edit)
- Constant-recursive sequence (links | edit)
- List of things named after Alan Turing (links | edit)
- Polynomial-time counting reduction (links | edit)