Ran G.

top accounts reputation activity subscriptions

Why polynomial time is called "efficient"?

algorithms complexity-theory terminology efficiency asked Mar 10, 2012 at 20:49

cs.stackexchange.com

55 votes

How to define quantum Turing machines?

quantum-computing turing-machines computation-models asked Mar 8, 2012 at 4:51

cs.stackexchange.com

40 votes

Decision problems vs "real" problems that aren't yes-or-no

complexity-theory time-complexity np-hard approximation asked Mar 17, 2012 at 18:28

cs.stackexchange.com

39 votes

How did conferences "work" before the e-mail era?

conference email technology asked Apr 21, 2013 at 1:04

academia.stackexchange.com

34 votes

How to split bibliography for different sections?

bibliographies bibtex subdividing asked Feb 14, 2012 at 23:11

tex.stackexchange.com

33 votes

How to improve technical writing

writing asked Mar 15, 2012 at 4:04

academia.stackexchange.com

32 votes

When is it appropriate to decline a review request?

community peer-review etiquette asked Mar 9, 2012 at 3:43

academia.stackexchange.com

25 votes

Why is encrypting with the same one-time-pad not good?

cryptography information-theory encryption asked Mar 14, 2012 at 6:52

cs.stackexchange.com

23 votes

Is there a "natural" undecidable language?

formal-languages automata computability undecidability asked Mar 10, 2012 at 5:08

cs.stackexchange.com

21 votes

Universality of the Toffoli gate

quantum-computing circuits turing-completeness asked Mar 13, 2012 at 6:22

cs.stackexchange.com

Top Answers

What to do when your student is convinced that he will be the next Einstein?

academia.stackexchange.com

How to show that a function is not computable? How to show a language is not computably enumerable?

cs.stackexchange.com

How to prove a language is regular?

cs.stackexchange.com

Software to use for creating posters for academic conferences?

academia.stackexchange.com

Pumping lemma for simple finite regular languages

cs.stackexchange.com

How to prove that a language is not regular?

cs.stackexchange.com

Algorithmic intuition for logarithmic complexity

cs.stackexchange.com

How not to solve P=NP?

cs.stackexchange.com

Infinite Language vs. finite language

cs.stackexchange.com

How to write papers fast and efficiently?

academia.stackexchange.com

How to define quantum Turing machines?

cs.stackexchange.com

How to write a rebuttal for a conference

academia.stackexchange.com

Why are external PhDs considered to take "decades"?

academia.stackexchange.com

Is it normal for a professor to contact only one specific TA regarding the course?

academia.stackexchange.com

Can a regular expression be infinite?

cs.stackexchange.com

What's a good way out when research is stuck?

academia.stackexchange.com

What is the correct way to draw NFA of RE (a|b|c)?

cs.stackexchange.com

Tag, index and offset of associative cache

cs.stackexchange.com

Why won't a Turing machine halt?

cs.stackexchange.com

What is complement of Context-free languages?

cs.stackexchange.com

Pizza commercial claim of 34 million combinations

cs.stackexchange.com

Encouraging questions during lectures yet handling particular student asking too many questions

academia.stackexchange.com

Can I copy a Lemma one-to-one from another paper?

academia.stackexchange.com

Is there any proof that quantum computers are more efficient than classical computers?

cs.stackexchange.com

Does a Ph.D. dissertation usually have an ISBN?

academia.stackexchange.com

Is there an undecidable finite language of finite words?

cs.stackexchange.com

Falsely accused of cheating in college

academia.stackexchange.com

How to prevent plagiarism of my papers?

academia.stackexchange.com

Difference between article and letter in Nature

academia.stackexchange.com

A Question relating to a Turing Machine with a useless state

cs.stackexchange.com