-
Voting:
-
2
+
Demers: Here is the promised Fast Fourier Transform example. It worked for the two examples I tried, so I'm fairly sure it's correct.
Student: Proof by exhaustive testing?
Demers: Well, it sure exhausted me.
— Alan Demers
·
Nov. 17, 1978
·
Permalink
-
Voting:
-
0
+
A k-tape non-deterministic Turing machine is this umpteen-tuple.
— Alan Demers
·
Nov. 17, 1978
·
Permalink
-
Voting:
-
0
+
When I divide b by n what do I get? Well, I get b over n, obviously.
— Alan Demers
·
Nov. 15, 1978
·
Permalink
-
Voting:
-
0
+
This may be impossible. At least it's hard. I don't know how to do it.
— Alan Demers
·
Nov. 13, 1978
·
Permalink
-
Voting:
-
0
+
It's not in general obvious how to do it, but I was hoping that would slip by.
— Alan Demers
·
Nov. 8, 1978
·
Permalink
-
Voting:
-
-1
+
It's a commutative rung, so I can do a whole lot of cavalier things.
— Alan Demers
·
Nov. 6, 1978
·
Permalink
-
Voting:
-
0
+
I sure wish I had a snappy comeback.
— Alan Demers
·
Nov. 6, 1978
·
Permalink
-
Voting:
-
0
+
The reason I can't say that is because it's not true.
— Alan Demers
·
Oct. 16, 1978
·
Permalink
-
Voting:
-
0
+
The precise definition is motivated by that bow tie.
— Alan Demers
·
Oct. 16, 1978
·
Permalink
-
Voting:
-
0
+
let's take this whole section of the board and write a big "dubito" over it.
— Alan Demers
·
Oct. 16, 1978
·
Permalink