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 130978
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.
6
votes
1
answer
226
views
Is there an injective homomorphism on the Turing degrees?
I know that the existence of a non-trivial automorphism of the Turing degrees is a long-standing open problem. I am curious to know if something is known about (non-trivial) injective homomorphisms (o …
- 342
5
votes
0
answers
157
views
The set of homogeneous solutions of a clopen contains an hyperarithmetical set
In the context of Galvin-Prikry generalization of Ramsey's theorem, I read in a couple of papers ([1],[2]) that Solovay [3] proved that if $P$ is a clopen of $[\mathbb{N}]^{\mathbb{N}}$ then the set o …
- 342
4
votes
Understanding the definition of a (computably / continuously) “transparent” function
The intuition for transparency functions is the following (then all the other notions are slight variations): if you are trying to apply some $f$ after $U$, this is indeed the same as applying some ot …
- 342
3
votes
1
answer
170
views
Computing the halting problem with no computable bound on the use function
I would like to prove that there are two sets $A,B\subset \mathbb{N}$ such that
$A |_T B$
$\emptyset' \equiv_T A\oplus B$
for every $e$, if $\{e\}^{A\oplus B}=\emptyset'$ then the map sending $(B,n)$ …
- 342
1
vote
0
answers
97
views
Existence of limit computable map
Is there a limit computable function $\Phi$ with the following properties?
Let $T\subset \mathbb{N}^{<\mathbb{N}}$ be a tree (coded as its characteristic function) and $f\in\mathbb{N}^\mathbb{N}$ be …
- 342