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 947

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

12
votes
2answers
It is said that computability theory is also called recursion theory. Why is it called like that? Why recursion has this much importance? …
asked Jan 4 '13 by user5507
3
votes
3answers
A TM for a recursive language corresponds to our informal notion of an algorithm. as per Automata Theory, Languages and Computation by Ullman et al. Then there are languages called RE and $L_d$, …
asked Apr 13 '13 by user5507
5
votes
1answer
So in computability theory, the problem should be encoded to some form? Is this same thing as the input tape and configuration of a Turing machine (set of 0's and 1's )? …
asked Jan 5 '13 by user5507
5
votes
1answer
Why did the sets of languages accepted/decided by a TM get the name Recursively Enumerable and Recursive, respectively?
asked Apr 10 '13 by user5507
-2
votes
3answers
I was reading about counting principle related to TOC. I understand that the set of TMs are countable infinity. I couldn't understand the significance of it. What is its not countable?
asked Jan 13 '13 by user5507
45
votes
2answers
I know that there exist a Turing Machine, if a function is computable. Then how to show that the function is not computable or there aren't any Turing Machine for that. Is there anything like a Pumpin …
asked Apr 10 '13 by user5507