-
Voting:
-
4
+
You've noticed in this class, we've used whatever notation is convenient.
— John Hopcroft,
explaining Turing Machines
·
Nov. 17, 2018
·
Permalink
-
Voting:
-
9
+
That’s just a polynomial time algorithm for 3-CNF
— John Hopcroft,
after being asked what was in the box he drew on the chalkboard
·
Nov. 16, 2018
·
Permalink
-
Voting:
-
5
+
Nobel prize in Economics is not a real Nobel Prize. They just named their prize Nobel Prize.
— John Hopcroft,
when talking about assigning global ranking and Arrow's theorem, who won a Nobel Prize in Economics.
·
April 20, 2018
·
Permalink
-
Voting:
-
32
+
It turns out Cook later won the Turing award for this proof. Goes to show that you don't really have to do anything deep to get recognized in computer science.
— John Hopcroft,
on the proof that SAT is NP-Complete
·
Nov. 6, 2017
·
Permalink
-
Voting:
-
16
+
Let me prove a lemma which isn't quite true.
— John Hopcroft,
CS 4850 lecture
·
March 8, 2017
·
Permalink
-
Voting:
-
7
+
I can't make sense of what's in the book.
— John Hopcroft,
On the Hopcroft & Ullman book
·
April 23, 1982
·
Permalink
-
Voting:
-
-1
+
We have to figure out hwo to let interesting things happen.
— John Hopcroft
·
Oct. 27, 1981
·
Permalink
-
Voting:
-
6
+
Do you mind if my prime is a power of two?
— John Hopcroft
·
Oct. 17, 1980
·
Permalink
-
Voting:
-
1
+
You can cube it if you don't like squaring it.
— John Hopcroft
·
Nov. 30, 1979
·
Permalink
-
Voting:
-
0
+
Let me show you how easy it is to show things P-space complete.
— John Hopcroft
·
Oct. 26, 1979
·
Permalink