Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with computability-theory
Search options not deleted
user 2039
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.
9
votes
Accepted
Homology is computable because it is stable under suspension
Stability alone surely does not give you much. It gives you just the values on the spheres if you have the value on $S^0$. But many interesting spaces (eg all smooth manifolds) are CW-complexes and ca …
- 12.1k
2
votes
Can you prove equivalence without being able to calculate it?
I think, Milnor's exotic spheres are an example (see his 1956 article). He uses Morse theory to deduce the homeomorphism between the exotic spheres. But the gradient flow used in Morse theory is not r …