Skip to main content

Explore our questions

1 vote
1 answer
186 views

How are enumerator programs formally defined?

0 votes
1 answer
71 views

How can we test for Turing Completeness given any formal semantic specification?

1 vote
1 answer
64 views

is every non-trivial language in RE reducible to every language not in (RE union co-RE)?

1 vote
1 answer
38 views

General-Purpose Electronic Analog Computer Example?

-2 votes
0 answers
111 views

Does this correctly define a Turing computable Function?

-1 votes
3 answers
90 views

Recursively enumerable notation $RE$ vs. $RE\setminus R$

4 votes
2 answers
2k views

recursive language and computable function

0 votes
1 answer
25 views

Question in proof of NOTALLNFA in NSPACE(n)

1 vote
2 answers
68 views

DSW, exercise 2.4.7. How to transform a forward-branching program into a straghtline one

0 votes
0 answers
25 views

Are there known formal systems where logic and operators emerge purely from recursive structure?

0 votes
2 answers
102 views

Is solving Binary String Matching equivalent to Solving All type of string matching?

1 vote
0 answers
31 views

Defining an algorithm via Gödel numbers

2 votes
1 answer
45 views

prove\disprove : $L_1 \cup L_2 \notin RE$ and $L_1 \cap L_2 \notin RE$ $\implies$ $L_1 \notin R$

22 votes
3 answers
636 views

Machines for context-free languages which gain no extra power from nondeterminism

Browse more Questions