Skip to main content
idmean's user avatar
idmean's user avatar
idmean's user avatar
idmean
  • Member for 8 years, 9 months
  • Last seen more than a month ago
15 votes

Why do we rely on computers in critical fields?

4 votes

What does it mean for a computer to be general-purpose?

4 votes

Issues in the proof of $E_{TM}$ is Turing reducible to $A_{TM}$

3 votes
Accepted

Is the following language a Deterministic Context-Free Language?

2 votes

Determine if for given some $L$, $S_L={L(M) : <M>\in L}$ then for any $L$, if $S_L=RE$ then $L\in R$ is True or False and explain

2 votes

Which overhead is smaller - function call or passing variables between processes?

2 votes
Accepted

3SAT: Get smallest number of algorithm invocations to get a satisfiable assignment? How should it be done?

2 votes
Accepted

Can't understand the $O$ notation for runtime of algorithms

2 votes
Accepted

Complexity of the language that enters an infinite loop

1 vote
Accepted

Reduction to a parameterized problem

1 vote
Accepted

Reduction between CLIQUE to SUBSET SUM

1 vote
Accepted

What makes a computer program modular?

1 vote
Accepted

Compact representation for quantified boolean formula

1 vote
Accepted

A so-called random variable not being well-defined

1 vote
Accepted

M does not accept [M] | 'Correction' of proof possible?

1 vote

is Turing machine the blue print for program (software) or computer (hardware)?

1 vote

Counting substrings of a string that do not contain a given string