Last call to make your voice heard! Our 2022 Developer Survey closes in less than a week. Take survey.
user avatar
user avatar
user avatar
gardenhead
  • Member for 7 years, 11 months
  • Last seen more than a month ago
  • New York, NY, United States
11 votes
Accepted

Theory of computation introductory curriculum

8 votes

Finding a 4-clique among $k$ node groups

7 votes
Accepted

Finding number not in list with wildcards

7 votes

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

6 votes

generate possible inputs valid for automata

6 votes

Why multiple return values is not a common thing?

4 votes
Accepted

Does CPU without register exist?

4 votes

A question about type rule

4 votes

Language Features Not Translatable into Lambda Calculus

4 votes

Uncomputability of Busy Beaver Function

4 votes

How does an automaton model a computer or something else?

4 votes
Accepted

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

4 votes

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

3 votes

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

3 votes

What exactly is computer science?

2 votes

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

2 votes
Accepted

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

2 votes
Accepted

How is a Transition System in Operational Semantics defined?

2 votes
Accepted

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

2 votes

Big O notation question for set insertion with sequential scan?

2 votes

Linked list implementation problem

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?

1 vote

Finding hit ratio of a cache

1 vote

Can a Boolean circuit be considered an algorithm?

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))

1 vote

Can someone give me an explanation of how dcaches works?

1 vote

The difference between dense graph and sparse one

1 vote
Accepted

how can a program be OS-dependent?

1 vote

How is algorithm complexity modeled for functional languages?

1 vote

functional programming in terms of Set