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 2757
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.
23
votes
Is the theory of categories decidable?
This answer builds on those of F. G. Dorais and Joel David Hamkins to answer your "specific question", the question left open by them, namely whether the theory of abelian categories is decidable.
Th …
- 23.8k
13
votes
Which finitely presented groups can be distinguished by decidable properties?
The isomorphism relation for finitely presented groups is c.e., and in fact is Turing equivalent to the halting problem.
Proof:
To check whether two finitely presented groups $G$ and $H$ are i …
- 23.8k