Skip to main content
hps13's user avatar
hps13's user avatar
hps13's user avatar
hps13
  • Member for 5 years, 2 months
  • Last seen more than 4 years ago
2 votes
1 answer
206 views

is it always true that the depth of BFS is $\leq$ DFS?

1 vote
1 answer
112 views

how can this function be computed in polynomial time in regards to its input?

0 votes
2 answers
2k views

The barbers paradox first order logic formalization

2 votes
1 answer
1k views

Do regular languages belong to Space(1)?

0 votes
0 answers
245 views

utilization of bitmap protocol

0 votes
0 answers
33 views

is this given language in class P? [duplicate]

0 votes
1 answer
290 views

Finding a mapping reduction from $A_{TM}$ to $\overline{CF_{TM}}$

1 vote
2 answers
611 views

Is the language {<p,n> | p and n are natural numbers and there's no prime number in [p,p+n]} belongs to NP class?

0 votes
0 answers
40 views

Is the proof for the undecidability of $A_{TM}$ still valid if we change certain parts?

1 vote
1 answer
3k views

Turing machine algorithms for $\{0^n1^n\}$ using one and two tapes

1 vote
1 answer
666 views

is it possible to reduce $HALT_{TM}$ to $E_{TM}$?

0 votes
0 answers
381 views

Proving language K is undecidable using the diagonalization method

0 votes
0 answers
58 views

finding the overhead and distance of an unknown code based on message making algorithm