Stack Exchange

vzn

U.S.

http://vzn1.wordpress.com/

The algorithm designer who does not run experiments risks becoming lost in abstraction. —Sedgewick

  • cstheory salon & cs chat / highlights
  • outline for a NP vs P/poly proof based on monotone circuits, hypergraphs, factoring, and slice functions
  • Collatz conjecture experiments
  • Turing machine compiler in ruby
  • volunteer/collaborate in open science
top accounts reputation activity favorites subscriptions
Top Questions
27 votes

Impact of Grothendieck's program on TCS

big-picture ct.category-theory ho.history-overview ag.algebraic-geometry asked Nov 14 '14 at 18:58
cstheory.stackexchange.com

23 votes

Are machine learning techniques “approximation algorithms”?

machine-learning optimization approximation asked Feb 10 '12 at 19:03
stats.stackexchange.com

17 votes

computing the minimal NFA for a DFA

ds.algorithms reference-request fl.formal-languages automata-theory optimization asked Mar 23 '12 at 17:44
cstheory.stackexchange.com

16 votes

Is there a TM that halts on all inputs but that property is not provable?

computability reference-request turing-machines halting-problem asked Nov 27 '13 at 21:44
cs.stackexchange.com

15 votes

What is the “nearest” problem to the Collatz conjecture that has been successfully resolved?

reference-request open-problem nt.number-theory halting-problem computability asked Jun 2 '12 at 4:44
cstheory.stackexchange.com

13 votes

Bridge theorems for group theory and formal languages

formal-languages reference-request automata discrete-mathematics group-theory asked Sep 18 '13 at 3:16
cs.stackexchange.com

13 votes

Amazon oneboxing broken in chat

bug chat onebox amazon asked Mar 20 '18 at 1:36
meta.stackexchange.com

12 votes

First use of a Quantum Computer in Science Fiction

technology history-of origins computers quantum-physics asked Mar 13 '14 at 21:51
scifi.stackexchange.com

12 votes

building circuit for divisibility by 3

popularity-contest graphical-output combinatorics logic-gates asked Mar 25 '14 at 0:02
codegolf.stackexchange.com

12 votes

L/P/PSpace vs P/NP

cc.complexity-theory reference-request lower-bounds p-vs-np conditional-results asked Aug 7 '15 at 22:11
cstheory.stackexchange.com

1 2 3 4 5

Top Answers
27
Probabilistic (randomized) algorithms before “modern” computer science appeared
cstheory.stackexchange.com

22
Implications of proof of abc conjecture for cs theory
cstheory.stackexchange.com

19
Examples of unexpected mathematical images
mathoverflow.net

16
Why are perfect graphs called perfect?
cstheory.stackexchange.com

15
If the speed of electrical charge hasn't changed, how have computers become faster?
cs.stackexchange.com

14
Why, really, is the Halting Problem so important?
cs.stackexchange.com

14
Beautiful results in TCS
cstheory.stackexchange.com

13
Is Facebook coming to an end?
stats.stackexchange.com

12
How are physics and computer science getting united?
physics.stackexchange.com

12
What CS blogs should everyone read?
cstheory.stackexchange.com

12
Statements that imply $\mathbf{P}\neq \mathbf{NP}$
cstheory.stackexchange.com

12
Better lower bounds than 3n for non-boolean functions?
cstheory.stackexchange.com

12
Quantum computing roadmap
cs.stackexchange.com

11
Reducing the integer factorization problem to an NP-Complete problem
cs.stackexchange.com

11
Computer Science Book for Young Adults
cs.stackexchange.com

11
Which algorithms can not be parallelized?
cs.stackexchange.com

11
Probabilistic (randomized) algorithms before “modern” computer science appeared
cstheory.stackexchange.com

11
What makes people easily subscribe to pseudoscientific theories?
psychology.stackexchange.com

11
On “familiarity” (or How to avoid “going down the Math Rabbit Hole”?)
math.stackexchange.com

10
Analogues of P vs. NP in the history of mathematics
mathoverflow.net

10
NTIME(n^k) ≠ DTIME(n^k) ?
cstheory.stackexchange.com

10
Beautiful results in TCS
cstheory.stackexchange.com

10
Beautiful results in TCS
cstheory.stackexchange.com

10
Core algorithms deployed
cstheory.stackexchange.com

10
Hardest known natural problem in P?
cstheory.stackexchange.com

10
Are generational garbage collectors inherently cache-friendly?
cs.stackexchange.com

10
What is the difference between a Neural Network, a Deep Learning System and a Deep Belief Network?
cs.stackexchange.com

9
What properties of a programming language make compilation impossible?
cs.stackexchange.com

9
Statements that imply $\mathbf{P}\neq \mathbf{NP}$
cstheory.stackexchange.com

9
Is the unsolvability of the N-Body Problem equivalent to the Halting Problem
cs.stackexchange.com

1 2 3 4