We’re rewarding the question askers & reputations are being recalculated! Read more.
Computer Science
Carl Mummert
Meta user
Network profile
Summary Answers Questions Tags Badges Favorites Bounties Reputation All actions

18 Answers

Newest Activity Votes
24
Why are the total functions not enumerable?
Mar 13 '12 at 1:26
15
Does cooperative scheduling suspend processes when they perform an I/O operation?
Mar 6 '12 at 19:54
14
Do non-computable functions grow asymptotically larger?
Jul 28 '12 at 14:44
14
Are there minimum criteria for a programming language being Turing complete?
Apr 19 '12 at 18:59
14
Why is encrypting with the same one-time-pad not good?
Mar 14 '12 at 10:43
14
Generating Combinations from a set of pairs without repetition of elements
Mar 6 '12 at 20:33
14
Rice's theorem for non-semantic properties
Mar 6 '12 at 23:33
11
Is interaction more powerful than algorithms?
Mar 18 '12 at 10:52
8
Proof that $\{⟨M⟩ ∣ L(M) \mbox{ is context-free} \}$ is not (co-)recursively enumerable
May 22 '12 at 1:10
8
What is the difference between “Decision” and “Verification” in complexity theory?
Apr 8 '12 at 21:12
8
Is this finite graph problem decidable? What factors make a problem decidable?
Mar 9 '12 at 1:03
6
Are co-semidecidable languages separated by decidable ones?
Feb 17 '13 at 20:44
5
Mapping Reductions to Complement of A$_{TM}$
May 3 '12 at 11:38
4
Can we show a language is not computably enumerable by showing there is no verifier for it?
May 3 '12 at 11:46
4
Easy to state open problems in computability theory
Mar 16 '12 at 2:35
3
How to show a set is $\Pi_2$ complete
Aug 9 '12 at 18:25
2
Turing reducibility implies mapping reducibility
May 3 '12 at 11:58
0
Is the set of programs that compute some function other than $h$ recursively enumerable?
Feb 12 '14 at 20:54