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
Search options not deleted
user 51753
Questions related to computability theory, a.k.a. recursion theory
5
votes
Accepted
Turing degree of some functions related to Rice's theorem
(See, e.g., Cooper, Computability Theory (2004), theorem 15.4.3, or Soare, Turing Computability and Applications (2016), theorem 3.7.2, for proof and further explanations.) … Note that in some generalizations of Turing degrees (I like to refer to Kihara's paper “Lawvere-Tierney topologies for computability theorists”, which I tried to give an account of on my blog (in French …
- 393