computable sets and functions, Turing degrees, c.e. degrees, models of computability, primitive recursion, oracle computation, models of computability, decision problems, undecidability, Turing jump, halting problem, notions of computable randomness, computable model theory, computable equivalence relation theory, arithmetic and hyperarithmetic hierarchy, infinitary computability, $\alpha$-recursion, complexity theory.
Stats
created |
5 years ago by Andrew Critch |
viewed |
29 times |
editors |
1 |
Top Answerers
more »Recent Hot Answers
What are the most attractive Turing undecidable problems in mathematics?What are the most attractive Turing undecidable problems in mathematics?
What are the most attractive Turing undecidable problems in mathematics?
What's a magical theorem in logic?
What are the most attractive Turing undecidable problems in mathematics?
more »
Related Tags
lo.logic × 194
set-theory × 53
computer-science × 50
reference-request × 35
nt.number-theory × 19
gr.group-theory × 17
co.combinatorics × 16
reverse-math × 15
ct.category-theory × 11
peano-arithmetic × 11
proof-theory × 11
formal-languages × 10
model-theory × 9
algorithms × 9
soft-question × 7
np × 6
lambda-calculus × 6
pr.probability × 6
open-problem × 6
forcing × 5
ordinal-numbers × 5
more related tags