Recent Quotes
-
Voting:
-
1
+
You need a mathematical induction for small numbers that works for a little bit and then peters out.
— Juris Hartmanis
·
Nov. 12, 1984
·
Permalink
-
Voting:
-
1
+
The proof is going to be by induction because every proof's by induction.
— Jim Hook
·
Nov. 12, 1984
·
Permalink
-
Voting:
-
0
+
I'll prove on Friday that it's at least as interesting as checkers.
— John Gilbert
·
Nov. 11, 1984
·
Permalink
-
Voting:
-
0
+
Rice is one of our best customers for junior faculty.
— Fred Schneider
·
Nov. 11, 1984
·
Permalink
-
Voting:
-
0
+
You can solve NP-complete problems fast if only you had a slave who would be willing to do an infinite amount of work.
— John Gilbert
·
Nov. 9, 1984
·
Permalink
-
Voting:
-
0
+
All NP-completeness proofs are proof-by-example.
— Mark Krentel
·
Nov. 7, 1984
·
Permalink
-
Voting:
-
1
+
I'll leave it as an exercise. Or you can look in Knuth and find it as an exercise there.
— John Gilbert
·
Nov. 2, 1984
·
Permalink
-
Voting:
-
0
+
This is a graduate class; nothing is deterministic.
— John Gilbert
·
Nov. 2, 1984
·
Permalink
-
Voting:
-
0
+
We pause for a moment of shock.
— John Gilbert
·
Oct. 29, 1984
·
Permalink
-
Voting:
-
0
+
I do not know if this will give a faster algorithm, it's just that we can guarantee a faster algorithm.
— A. Schoenhage
·
Oct. 4, 1984
·
Permalink
-
Voting:
-
0
+
You reach the level of acceptable performance when no one complains at you any more.
— Jim Donahue
·
Sept. 27, 1984
·
Permalink
-
Voting:
-
0
+
I used to work in formal semantics. My friends ask me what I'm doing now, and I say, "I'm working on an electronic mail system," and they say, "Too bad."
— Jim Donahue
·
Sept. 27, 1984
·
Permalink