Question

Recursively enumerable languages are closed under the min(L) operation?

score 780 · Answer 1 · 2012-06-26 23:27:50

780

Views

Recursively enumerable languages are closed under the min(L) operation?

Published on 26 Jun 2012 - 23:27

score 721 · Answer 2 · 2012-06-27 13:09:17

721

Views

algorithm for solving diagonal quadratic equations over real or complex numbers

Published on 27 Jun 2012 - 13:09

score 124 · Answer 3 · 2026-03-26 09:44:55

124

Views

Satisfiability problem for FOL[<,R]

Published on 26 Mar 2026 - 9:44

score 285 · Answer 4 · 2026-03-25 17:24:55

285

Views

Complexity of the computable entailment relation

Published on 25 Mar 2026 - 17:24

score 252 · Answer 5 · 2012-07-04 17:47:50

252

Views

Were PR functions considered to be the class of total recursive functions?

Published on 04 Jul 2012 - 17:47

score 171 · Answer 6 · 2026-03-29 10:07:41

171

Views

Complexity of subset relation on Borel Sets

Published on 29 Mar 2026 - 10:07

score 265 · Answer 7 · 2026-04-02 01:25:03

265

Views

Is the set of codes of Deterministic Finite-State Automata a regular language?

Published on 02 Apr 2026 - 1:25

score 1.3k · Answer 8 · 2026-04-03 20:28:06

1.3k

Views

Does there exist a universal pushdown automaton?

Published on 03 Apr 2026 - 20:28

score 301 · Answer 9 · 2026-04-02 11:16:47

301

Views

Are there larger than countable chains in the join-semilattice of Turing degrees?

Published on 02 Apr 2026 - 11:16

score 191 · Answer 10 · 2012-08-05 18:21:02

191

Views

An Obsessive Turing machine problem

Published on 05 Aug 2012 - 18:21

score 221 · Answer 11 · 2012-08-05 20:43:43

221

Views

For regular expression $E$ and a context free grammar $G$- why deciding if $L(G)\subseteq L(E)?$ is a recursive problem?

Published on 05 Aug 2012 - 20:43

score 175 · Answer 12 · 2012-08-06 09:38:21

175

Views

Showing that $\{0w:w \in A\} \cup \{1w: w \notin A \}$ computes $A$

Published on 06 Aug 2012 - 9:38

score 796 · Answer 13 · 2012-08-06 17:35:51

796

Views

The print problem: How to show it is not decidable?

Published on 06 Aug 2012 - 17:35

score 614 · Answer 14 · 2012-08-07 10:17:13

614

Views

Why is the following language decidable? $L_{one\ right\ and\ never\ stops}$

Published on 07 Aug 2012 - 10:17

score 944 · Answer 15 · 2026-02-23 10:14:10

944

Views

Proving Turing Completeness by Simulating Rule 110

Published on 23 Feb 2026 - 10:14

List Question

Recursively enumerable languages are closed under the min(L) operation?

algorithm for solving diagonal quadratic equations over real or complex numbers

Satisfiability problem for FOL[<,R]

Complexity of the computable entailment relation

Were PR functions considered to be the class of total recursive functions?

Complexity of subset relation on Borel Sets

Is the set of codes of Deterministic Finite-State Automata a regular language?

Does there exist a universal pushdown automaton?

Are there larger than countable chains in the join-semilattice of Turing degrees?

An Obsessive Turing machine problem

For regular expression $E$ and a context free grammar $G$- why deciding if $L(G)\subseteq L(E)?$ is a recursive problem?

Showing that $\{0w:w \in A\} \cup \{1w: w \notin A \}$ computes $A$

The print problem: How to show it is not decidable?

Why is the following language decidable? $L_{one\ right\ and\ never\ stops}$

Proving Turing Completeness by Simulating Rule 110

Trending Questions

Popular # Hahtags

Popular Questions