User Aaron Rotenberg

60 votes

Why do we need full-fledged workstations running massive OSes with massive software?

answered Dec 14, 2019 at 7:24

17 votes

Is Group Theory useful in Computer Science in areas other than cryptography?

answered Jul 4, 2020 at 13:26

6 votes

Accepted

How to pronounce "P/poly"?

answered Jun 11, 2020 at 17:37

6 votes

Length of strings accepted by DFA

answered Dec 23, 2019 at 15:33

6 votes

Accepted

How hard is finding the shortest path in a graph matching a given regular language?

answered Dec 28, 2019 at 16:39

5 votes

Are Turing unrecognizable and undecidable languages, recognized and decided by hyper computation?

answered Jan 7, 2020 at 23:01

5 votes

Accepted

How was the σ function chosen to extend the perceptron?

answered Aug 19, 2020 at 7:12

4 votes

Accepted

Repeating functions in functional programming?

answered Aug 22, 2020 at 16:37

4 votes

Is there a query language variant of Turing Completeness?

answered Jul 30, 2020 at 15:55

4 votes

Accepted

PSPACE-completeness of DFA intersection problem

answered Jan 8, 2020 at 3:16

4 votes

Relation Between Priority Queue, Heap, Tree

answered Jan 28, 2020 at 13:52

4 votes

Accepted

Is there a name for a graph whose vertices consist of edges of an existing graph connected by an edge if they shared a common vertex?

answered Jan 31, 2020 at 14:39

4 votes

What are the modern alternatives to Backus–Naur form and what are their advantages?

answered Jun 21, 2020 at 12:21

4 votes

Accepted

Why this greedy algorithm fails in rod cutting problem?

answered Dec 13, 2019 at 18:47

3 votes

Accepted

Find the minimal subset of rows of some matrix such that the sum of each column over this rows exceeds some threshold

answered Dec 22, 2019 at 6:10

3 votes

Accepted

A microkernel fully hardcoded in hardware?

answered Dec 29, 2019 at 1:30

3 votes

Accepted

Is a^mb^n where m=n^2 a CFL?

answered Dec 27, 2019 at 14:14

3 votes

Accepted

Why do we need/use operator precedence for Arithmetic operators?

answered Jan 6, 2020 at 18:47

3 votes

Halting problem vs. automated theorem proving?

answered Jun 13, 2020 at 17:48

3 votes

Accepted

Possible error in Computer Networks, V Edition by Tanenbaum & Wetherall

answered Jun 18, 2020 at 5:56

3 votes

Accepted

Euclidean geometry theorem proving complexity

answered Jun 21, 2020 at 3:20

3 votes

Intuition for Church-Turing thesis for Turing machines

answered Jul 22, 2020 at 19:10

3 votes

Accepted

Time complexity of $O(n)$ loop which has a multiplication ($O(n^2)$) in it

answered Feb 5, 2020 at 18:16

3 votes

Accepted

Why is $O(|V| + |E|)$ the bound on DFS and BFS instead of just $O(|E|)$?

answered Jan 29, 2020 at 5:56

3 votes

Which combinatorial problem is similar to this problem?

answered Aug 24, 2020 at 4:19

2 votes

Computational power of a Turing Machine with infinite states

answered Aug 24, 2020 at 6:52

2 votes

How to find the square with the highest total sum

answered Jun 11, 2020 at 7:16

2 votes

Are objects appropriate for modeling the real world?

answered Sep 8, 2020 at 7:56

2 votes

How to properly name the two types of RAM in a Paper?

answered Sep 8, 2020 at 9:09

2 votes

Efficient calculation or estimation of “minimized combined Manhattan distance” between two sets of points

answered Sep 14, 2020 at 2:30

Stack Exchange Network

83 Answers

Why do we need full-fledged workstations running massive OSes with massive software?

Is Group Theory useful in Computer Science in areas other than cryptography?

How to pronounce "P/poly"?

Length of strings accepted by DFA

How hard is finding the shortest path in a graph matching a given regular language?

Are Turing unrecognizable and undecidable languages, recognized and decided by hyper computation?

How was the σ function chosen to extend the perceptron?

Repeating functions in functional programming?

Is there a query language variant of Turing Completeness?

PSPACE-completeness of DFA intersection problem

Relation Between Priority Queue, Heap, Tree

Is there a name for a graph whose vertices consist of edges of an existing graph connected by an edge if they shared a common vertex?

What are the modern alternatives to Backus–Naur form and what are their advantages?

Why this greedy algorithm fails in rod cutting problem?

Find the minimal subset of rows of some matrix such that the sum of each column over this rows exceeds some threshold

A microkernel fully hardcoded in hardware?

Is a^mb^n where m=n^2 a CFL?

Why do we need/use operator precedence for Arithmetic operators?

Halting problem vs. automated theorem proving?

Possible error in Computer Networks, V Edition by Tanenbaum & Wetherall

Euclidean geometry theorem proving complexity

Intuition for Church-Turing thesis for Turing machines

Time complexity of $O(n)$ loop which has a multiplication ($O(n^2)$) in it

Why is $O(|V| + |E|)$ the bound on DFS and BFS instead of just $O(|E|)$?

Which combinatorial problem is similar to this problem?

Computational power of a Turing Machine with infinite states

How to find the square with the highest total sum

Are objects appropriate for modeling the real world?

How to properly name the two types of RAM in a Paper?

Efficient calculation or estimation of “minimized combined Manhattan distance” between two sets of points