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 120914
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.
4
votes
Accepted
Examples of "natural" finitely generated groups with an undecidable conjugacy problem
Chuck Miller in [Miller, Charles F., III On group-theoretic decision problems and their classification. Annals of Mathematics Studies, No. 68. Princeton University Press, Princeton, N.J.; University o …
9
votes
Accepted
Is the isomorphism problem solvable for torsion-free groups?
Novikov's centrally-symmetric group $\mathfrak{A}_P$ is a torsion-free group with undecidable word problem, constructed in [1]. Novikov did not prove it is torsion-free but, as Adian points out in [Ad …
17
votes
Decision problems for which it is unknown whether they are decidable
The word problem for a finitely presented group $G = \langle A \mid R \rangle $ and the associated canonical homomorphism $\pi : F_A \to G$, asks: given an element $w \in F_A$, do we have $\pi(w) = 1$ …