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 3811
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.
1
vote
1
answer
343
views
Nontrivial, partially uncomputable function
is there any example of function which is computable on some set and uncomputable on other set? That is for example function f(n) which is computable on some (finite, or for example for even numbers) …
- 1,626
2
votes
1
answer
172
views
Internal operations on uncomputable functions
Is there know set of operations for which uncomputable functions are, let's name it down-unclosed? I mean a set of operations which takes two ( or more) uncomputable functions and return computable f …
- 1,626
1
vote
Alive dynamical system
To build UTM is equivalent to define inside recurrence functions space - which consists of certain relations inside or homomorphic to it (or to define typed lambda calculus). So it seems to be natura …
- 1,626
1
vote
Which graphs are Cayley graphs?
From wikipedia we have : "The Bethe lattice where each node is joined to 2n others is essentially the Cayley graph of a free group on n generators." So solution for Your question, at least for a group …
- 1,626
4
votes
6
answers
1k
views
Are there nonequivalent randomnesses?
There are nonequivalent geometries, nonequivalent groups finite and infinite, nonequivalent logics ( fregean and nofregean http://www.formalontology.it/suszkor.htm), even nonequivalent logicians;-)
A …
- 1,626