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"
Bookmarks inbookmarks:mine
inbookmarks:1234
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
Search options questions only user 62509

Questions related to computability theory, a.k.a. recursion theory

2
votes
1answer
Not sure if this question should be here, or on math.se. That said, let me proceed: On the Wikipedia page for the Ackermann function, it is mentioned that by passing the inputs of 0, 1 and 2 to the …
asked Dec 16 '16 by Tobi Alafin
46
votes
5answers
I've been seeing all over stack Overflow, e.g here, here, here, here, here and some others I don't care to mention, that "any program that uses recursion can be converted to a program using only itera …
asked Dec 26 '16 by Tobi Alafin
0
votes
4answers
I am aware of Turing's proof of the undecidability of the halting problem (and I think I understand it). What I'm asking is quite different. I shall define what I mean by "effectively solvable": …
asked Sep 25 '17 by Tobi Alafin
0
votes
0answers
It is possible to prove the correctness of algorithms, and two algorithms can be compared to see which has better performance using $O$ and $o$ notation. Is it possible to prove the efficiency of an …
asked Dec 7 '16 by Tobi Alafin
28
votes
6answers
Are there programs that can 'translate' source code between any two languages (assuming the translator has access to the requisite libraries)? If there are, how do they work (techniques used, knowled …
asked Dec 12 '16 by Tobi Alafin