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 43366
Questions related to computability theory, a.k.a. recursion theory
2
votes
1
answer
333
views
Prove that the Kolmogorov complexity function cannot be approached from below
How would one go about proving that Kolmogorov function $K(x)$ cannot be approached from below by any computable function?
After some research it seems I must show the function $K(x)$ is not lower se …
- 317
5
votes
0
answers
55
views
The evolution of the term "recursive" from Goedel to Church to present day
I'm currently studying some of the history of computation / computability, in the early days known as recursion theory. …
- 317