User vzn

16 votes

Why, really, is the Halting Problem so important?

answered Nov 8, 2014 at 19:43

15 votes

If the speed of electrical charge hasn't changed, how have computers become faster?

answered Sep 10, 2015 at 15:58

13 votes

Accepted

Quantum computing roadmap

answered Jun 14, 2013 at 15:15

13 votes

Accepted

Which algorithms can not be parallelized?

answered Jan 12, 2014 at 18:17

13 votes

Accepted

Is the unsolvability of the N-Body Problem equivalent to the Halting Problem

answered Jun 3, 2015 at 15:14

11 votes

Computer Science Book for Young Adults

answered Mar 29, 2012 at 23:20

11 votes

Accepted

Reducing the integer factorization problem to an NP-Complete problem

answered Nov 10, 2012 at 17:21

11 votes

Why would you use a monitor instead of a semaphore?

answered Jun 18, 2015 at 21:13

11 votes

Evolving artificial neural networks for solving NP problems

answered Sep 23, 2015 at 23:25

10 votes

Are generational garbage collectors inherently cache-friendly?

answered Aug 7, 2012 at 16:03

10 votes

Accepted

What is the difference between a Neural Network, a Deep Learning System and a Deep Belief Network?

answered Oct 31, 2013 at 3:35

10 votes

What does the "Lambda" in "Lambda calculus" stand for?

answered May 14, 2016 at 22:39

8 votes

Why and how is a quantum computer faster than a regular computer?

answered Feb 18, 2014 at 17:43

8 votes

Goldbach Conjecture and Busy Beaver numbers?

answered Nov 30, 2016 at 18:34

8 votes

Traveling Salesman Problem with Neural Network

answered Mar 9, 2016 at 23:27

8 votes

Why is the Mersenne Twister regarded as good?

answered Nov 29, 2015 at 16:37

8 votes

What properties of a programming language make compilation impossible?

answered Sep 2, 2014 at 22:58

7 votes

How are programming languages and foundations of mathematics related?

answered Feb 15, 2013 at 0:20

7 votes

What can be learned from the weights in a neural network?

answered Mar 6, 2013 at 2:28

7 votes

What would be the real-world implications of a constructive $P=NP$ proof?

answered Dec 31, 2014 at 3:35

7 votes

Is a universal assembly language for all computers possible?

answered Sep 7, 2015 at 17:32

7 votes

When did polynomial-time algorithm become of interest?

answered Jun 23, 2015 at 17:49

6 votes

Doron ZEILBERGER's P = NP computer proof

answered Feb 20, 2013 at 18:43

6 votes

Microsoft Singularity : why closed

answered Nov 9, 2013 at 16:26

6 votes

Accepted

Lower bound on running time for solving 3-SAT if P = NP

answered Jan 15, 2014 at 23:41

6 votes

For how large graphs can we still check for isomorphism?

answered Nov 27, 2013 at 4:19

6 votes

Accepted

Why do all recent SAT solvers work on CNF instead of circuit SAT?

answered Mar 7, 2017 at 19:32

6 votes

Gödels (first) incompleteness Theorem and the Halting Problem - How limiting is it?

answered May 28, 2014 at 15:35

5 votes

Approximating the Kolmogorov complexity

answered Dec 10, 2013 at 21:19

5 votes

Accepted

Adapting neural network

answered Apr 3, 2013 at 4:56

Stack Exchange Network

359 Answers

Why, really, is the Halting Problem so important?

If the speed of electrical charge hasn't changed, how have computers become faster?

Quantum computing roadmap

Which algorithms can not be parallelized?

Is the unsolvability of the N-Body Problem equivalent to the Halting Problem

Computer Science Book for Young Adults

Reducing the integer factorization problem to an NP-Complete problem

Why would you use a monitor instead of a semaphore?

Evolving artificial neural networks for solving NP problems

Are generational garbage collectors inherently cache-friendly?

What is the difference between a Neural Network, a Deep Learning System and a Deep Belief Network?

What does the "Lambda" in "Lambda calculus" stand for?

Why and how is a quantum computer faster than a regular computer?

Goldbach Conjecture and Busy Beaver numbers?

Traveling Salesman Problem with Neural Network

Why is the Mersenne Twister regarded as good?

What properties of a programming language make compilation impossible?

How are programming languages and foundations of mathematics related?

What can be learned from the weights in a neural network?

What would be the real-world implications of a constructive $P=NP$ proof?

Is a universal assembly language for all computers possible?

When did polynomial-time algorithm become of interest?

Doron ZEILBERGER's P = NP computer proof

Microsoft Singularity : why closed

Lower bound on running time for solving 3-SAT if P = NP

For how large graphs can we still check for isomorphism?

Why do all recent SAT solvers work on CNF instead of circuit SAT?

Gödels (first) incompleteness Theorem and the Halting Problem - How limiting is it?

Approximating the Kolmogorov complexity

Adapting neural network