Carl Mummert's user avatar
Carl Mummert's user avatar
Carl Mummert's user avatar
Carl Mummert
  • Member for 11 years, 11 months
  • Last seen more than a month ago
25 votes
Accepted

Why are the total functions not enumerable?

19 votes
Accepted

Why is encrypting with the same one-time-pad not good?

19 votes

Are there minimum criteria for a programming language being Turing complete?

16 votes
Accepted

Generating Combinations from a set of pairs without repetition of elements

16 votes
Accepted

Rice's theorem for non-semantic properties

15 votes
Accepted

Does cooperative scheduling suspend processes when they perform an I/O operation?

14 votes
Accepted

Do non-computable functions grow asymptotically larger?

11 votes
Accepted

Is interaction more powerful than algorithms?

8 votes

What is the difference between "Decision" and "Verification" in complexity theory?

8 votes
Accepted

Proof that $\{⟨M⟩ ∣ L(M) \mbox{ is context-free} \}$ is not (co-)recursively enumerable

8 votes

Is this finite graph problem decidable? What factors make a problem decidable?

6 votes

Mapping Reductions to Complement of A$_{TM}$

6 votes

Are co-semidecidable languages separated by decidable ones?

5 votes
Accepted

Easy to state open problems in computability theory

4 votes

Can we show a language is not computably enumerable by showing there is no verifier for it?

3 votes

How to show a set is $\Pi_2$ complete

2 votes

Turing reducibility implies mapping reducibility

0 votes

Is the set of programs that compute some function other than $h$ recursively enumerable?