User gardenhead

11 votes

Accepted

Theory of computation introductory curriculum

answered Jun 8, 2014 at 22:19

8 votes

Finding a 4-clique among $k$ node groups

answered Jun 9, 2014 at 21:46

7 votes

Accepted

Finding number not in list with wildcards

answered Jun 19, 2014 at 2:20

7 votes

Is 2**x faster to compute than exp(x)?

answered Jun 19, 2014 at 6:53

6 votes

generate possible inputs valid for automata

answered Jun 20, 2014 at 4:22

6 votes

Why multiple return values is not a common thing?

answered Oct 14, 2016 at 15:51

5 votes

Accepted

Does CPU without register exist?

answered Oct 17, 2016 at 18:43

4 votes

A question about type rule

answered Oct 1, 2016 at 18:50

4 votes

Language Features Not Translatable into Lambda Calculus

answered Oct 25, 2016 at 0:10

4 votes

Uncomputability of Busy Beaver Function

answered May 18, 2017 at 16:25

4 votes

How does an automaton model a computer or something else?

answered Jun 12, 2014 at 23:10

4 votes

Accepted

Calculating miss rates of word-addressable and direct-mapped cache

answered Jul 6, 2014 at 22:03

4 votes

Why do we assume that a nondeterministic Turing machine decides a language in NP in $n^k-3$ in Sipser's proof

answered Jun 8, 2014 at 22:10

3 votes

Example for an unsatisfiable formula that can be made satisfiable by reordering quantifiers

answered Jul 7, 2014 at 3:39

3 votes

What exactly is computer science?

answered Jul 2, 2014 at 4:55

2 votes

Do the time and space complexities of a language depend on the Turing machine which is its recognizer?

answered Oct 2, 2016 at 4:59

2 votes

Accepted

Which of these simple data structures is most efficient when implementing a Dequeue?

answered Oct 18, 2016 at 1:54

2 votes

Accepted

How is a Transition System in Operational Semantics defined?

answered Nov 13, 2016 at 3:11

2 votes

Accepted

How can another process call $signal()$ when one process is executing $wait()$ in its busy waiting loop?

answered Feb 1, 2016 at 21:21

2 votes

Big O notation question for set insertion with sequential scan?

answered Sep 27, 2016 at 16:56

2 votes

Linked list implementation problem

answered Jun 9, 2014 at 3:31

2 votes

if (dis)proving a conjecture on graph theory can be done just by a counter example then can every (dis)proof be mapped actually to a counter-example?

answered Jun 9, 2014 at 17:53

1 vote

Finding hit ratio of a cache

answered Jun 28, 2014 at 22:15

1 vote

Can a Boolean circuit be considered an algorithm?

answered Jun 15, 2014 at 0:43

1 vote

Accepted

Show that if d(n) is O( f (n)) and e(n) is O(g(n)), then d(n)−e(n) is not necessarily O( f (n)−g(n))

answered Feb 1, 2016 at 22:53

1 vote

Can someone give me an explanation of how dcaches works?

answered Sep 26, 2016 at 2:00

1 vote

The difference between dense graph and sparse one

answered Sep 27, 2016 at 16:40

1 vote

Accepted

how can a program be OS-dependent?

answered Nov 17, 2016 at 21:32

1 vote

How is algorithm complexity modeled for functional languages?

answered Apr 25, 2017 at 23:03

1 vote

functional programming in terms of Set

answered May 16, 2017 at 19:45

Stack Exchange Network

34 Answers

Theory of computation introductory curriculum

Finding a 4-clique among $k$ node groups

Finding number not in list with wildcards

Is 2**x faster to compute than exp(x)?

generate possible inputs valid for automata

Why multiple return values is not a common thing?

Does CPU without register exist?

A question about type rule

Language Features Not Translatable into Lambda Calculus

Uncomputability of Busy Beaver Function

How does an automaton model a computer or something else?

Calculating miss rates of word-addressable and direct-mapped cache

Why do we assume that a nondeterministic Turing machine decides a language in NP in $n^k-3$ in Sipser's proof

Example for an unsatisfiable formula that can be made satisfiable by reordering quantifiers

What exactly is computer science?

Do the time and space complexities of a language depend on the Turing machine which is its recognizer?

Which of these simple data structures is most efficient when implementing a Dequeue?

How is a Transition System in Operational Semantics defined?

How can another process call $signal()$ when one process is executing $wait()$ in its busy waiting loop?

Big O notation question for set insertion with sequential scan?

Linked list implementation problem

if (dis)proving a conjecture on graph theory can be done just by a counter example then can every (dis)proof be mapped actually to a counter-example?

Finding hit ratio of a cache

Can a Boolean circuit be considered an algorithm?

Show that if d(n) is O( f (n)) and e(n) is O(g(n)), then d(n)−e(n) is not necessarily O( f (n)−g(n))

Can someone give me an explanation of how dcaches works?

The difference between dense graph and sparse one

how can a program be OS-dependent?

How is algorithm complexity modeled for functional languages?

functional programming in terms of Set