User idmean

15 votes

Why do we rely on computers in critical fields?

answered Jul 22, 2022 at 21:28

4 votes

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

answered Aug 1, 2021 at 6:02

4 votes

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

answered Jul 7, 2021 at 7:27

3 votes

Accepted

Is the following language a Deterministic Context-Free Language?

answered Jul 31, 2021 at 14:09

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

answered Jul 28, 2021 at 11:22

2 votes

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

answered Jul 27, 2021 at 14:37

2 votes

Accepted

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

answered Dec 7, 2021 at 16:37

2 votes

Accepted

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

answered Jul 26, 2021 at 10:11

2 votes

Accepted

Complexity of the language that enters an infinite loop

answered Jul 22, 2021 at 9:41

1 vote

Accepted

Reduction to a parameterized problem

answered Jul 22, 2021 at 15:33

1 vote

Accepted

Reduction between CLIQUE to SUBSET SUM

answered Jul 25, 2021 at 19:22

1 vote

Accepted

What makes a computer program modular?

answered Jul 26, 2021 at 5:55

1 vote

Accepted

Compact representation for quantified boolean formula

answered Jul 27, 2021 at 6:26

1 vote

Accepted

A so-called random variable not being well-defined

answered Jul 27, 2021 at 9:31

1 vote

Accepted

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

answered Jul 17, 2021 at 6:31

1 vote

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

answered Aug 3, 2021 at 10:11

1 vote

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

answered Jul 28, 2021 at 9:55

Stack Exchange Network

17 Answers

Why do we rely on computers in critical fields?

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

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

Is the following language a Deterministic Context-Free Language?

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

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

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

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

Complexity of the language that enters an infinite loop

Reduction to a parameterized problem

Reduction between CLIQUE to SUBSET SUM

What makes a computer program modular?

Compact representation for quantified boolean formula

A so-called random variable not being well-defined

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

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

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