user avatar
user avatar
user avatar
vzn
  • Member for 10 years, 3 months
  • Last seen more than 1 year ago
15 votes

Why, really, is the Halting Problem so important?

15 votes

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

13 votes
Accepted

Which algorithms can not be parallelized?

12 votes
Accepted

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

12 votes
Accepted

Quantum computing roadmap

11 votes

Evolving artificial neural networks for solving NP problems

11 votes

Computer Science Book for Young Adults

11 votes
Accepted

Reducing the integer factorization problem to an NP-Complete problem

10 votes

Why would you use a monitor instead of a semaphore?

10 votes

Are generational garbage collectors inherently cache-friendly?

10 votes
Accepted

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

10 votes

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

8 votes

What properties of a programming language make compilation impossible?

8 votes

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

8 votes

Goldbach Conjecture and Busy Beaver numbers?

7 votes

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

7 votes

Is a universal assembly language for all computers possible?

7 votes

Why is the Mersenne Twister regarded as good?

7 votes

How are programming languages and foundations of mathematics related?

7 votes

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

7 votes

Traveling Salesman Problem with Neural Network

6 votes

When did polynomial-time algorithm become of interest?

6 votes

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

6 votes

Doron ZEILBERGER's P = NP computer proof

6 votes

Microsoft Singularity : why closed

6 votes
Accepted

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

6 votes

For how large graphs can we still check for isomorphism?

6 votes
Accepted

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

5 votes

Are Boolean functions Turing complete

5 votes

Analog computers and the Church-Turing thesis

1
2 3 4 5
12