-
Voting:
-
1
+
If you have a cycle, you can spread truth anywhere.
— Daniel Leviant
·
May 26, 1980
·
Permalink
-
Voting:
-
1
+
People who generate self-modifying code are in a state of mortal sin.
— Alan Demers
·
April 16, 1980
·
Permalink
-
Voting:
-
1
+
Let's do a pictorial proof again.
— Bob Constable
·
April 16, 1980
·
Permalink
-
Voting:
-
1
+
"d"s are idempotent.
— Alan Demers,
After using both 'adr' and 'addr' to abbreviate 'address'
·
April 9, 1980
·
Permalink
-
Voting:
-
1
+
"To be or not to be" is not an algorithm.
— Bob Constable
·
Feb. 27, 1980
·
Permalink
-
Voting:
-
1
+
If none of the faculty show up, this talk is going to be about Stellar Conquest.
— Scott Johnson
·
Jan. 31, 1980
·
Permalink
-
Voting:
-
1
+
The major problem with many articles is not that they are wrong, but that they are ugly.
— Edsger W. Dijkstra
·
Jan. 15, 1980
·
Permalink
-
Voting:
-
1
+
You can cube it if you don't like squaring it.
— John Hopcroft
·
Nov. 30, 1979
·
Permalink
-
Voting:
-
1
+
COBOL and APL - one language I have never learned, the other which I refused to learn for the fifth time.
— Juris Hartmanis
·
Nov. 14, 1979
·
Permalink
-
Voting:
-
1
+
Watch a man squirm.
— Juris Hartmanis,
About himself, getting mixed up in a proof
·
Nov. 14, 1979
·
Permalink
-
Voting:
-
1
+
Now we can prove problems right and left to be NP-complete.
— John Hopcroft
·
Oct. 19, 1979
·
Permalink
-
Voting:
-
1
+
Does everyone see the intuitive idea before we get into the details? Does anyone want to see the details?
— John Hopcroft
·
Sept. 24, 1979
·
Permalink
-
Voting:
-
1
+
I'm going to call that a picture proof.
— John Hopcroft
·
May 28, 1979
·
Permalink
-
Voting:
-
1
+
I'd hate to leave you for a vacation without showing you how to prove that a problem is NP-complete.
— John Hopcroft
·
May 16, 1979
·
Permalink
-
Voting:
-
1
+
This report is about as impenetrable as its title.
— Jim Donahue,
On "Admissibility of Fixed Point Inductions in First Order Logic of Typed Theories," by S. Igarashi
·
May 6, 1979
·
Permalink