Last call to make your voice heard! Our 2022 Developer Survey closes in less than a week. Take survey.

Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It only takes a minute to sign up.

Sign up to join this community
Anybody can ask a question
Anybody can answer
The best answers are voted up and rise to the top

Explore our Questions

0 votes
1 answer
46 views

Computation branches on NTM

1 vote
1 answer
48 views

Enumerating through Turing Machines That Solve Same Problem

11 votes
1 answer
2k views

Why are computable functions continuous?

0 votes
1 answer
274 views

Sets of problems in different models of computation and cardinality

0 votes
1 answer
167 views

IS SUBSET-SUM in P if b(the sum) is given in unary and a1,...,an is in binary?

1 vote
1 answer
26 views

Are all Scott-continuous functions computable?

1 vote
0 answers
18 views

RP with very small error = P

2 votes
2 answers
58 views

Is the problem of "DFA-TM-INCLUSION" recursively enumerable?

2 votes
0 answers
27 views

Universal register machine that recognizes the image of a partial function

1 vote
1 answer
52 views

A decidable language that can't be decided by a circuit ensemble of linear size

0 votes
2 answers
178 views

How do we check $x ≠ y$ in $PDA$ for $L = \{xy | x, y \in (0 + 1)^*, |x| = |y|, x ≠ y\}?$

0 votes
1 answer
86 views

How would I show function $f(x)=4x$ is Turing computable?

1 vote
1 answer
43 views

What are some examples of non-enumerable languages whose complement isn't either?

1 vote
1 answer
56 views

Whose fault is that $\mathsf{\text{NOT-HALT}}$ is not in $\mathsf{RE}$?

Browse more Questions