-
Voting:
-
0
+
If you go to a Computer Science colloquium, say something about FORTRAN, IBM and everybody chuckles. That kind of arrogance always gets a good laugh.
— Juris Hartmanis
·
Oct. 8, 1982
·
Permalink
-
Voting:
-
0
+
Non-determinism is a very wasteful thing - it's sort of like evolution, trying everything.
— Juris Hartmanis
·
Oct. 8, 1982
·
Permalink
-
Voting:
-
0
+
Well what does a finite automaton do? An FA runs around until it hits an accepting state and then celebrates.
— Juris Hartmanis
·
Sept. 29, 1982
·
Permalink
-
Voting:
-
0
+
If I show you that from language theory you can get an engineering design, you should be impressed. So please prepare yourselves to be impressed.
— Juris Hartmanis
·
Sept. 22, 1982
·
Permalink
-
Voting:
-
0
+
I strongly suspect that this set is complete. I have not written yet a proof because non occurred to me. No, the correct statement is: "I have not written yet a proof because none occurred to my students."
— Juris Hartmanis
·
June 28, 1982
·
Permalink
-
Voting:
-
2
+
The books I should be writing are written by John Hopcroft.
— Juris Hartmanis
·
June 28, 1982
·
Permalink
-
Voting:
-
0
+
This 'A' is skinny, as you see, so it is a sparse set.
— Juris Hartmanis
·
June 28, 1982
·
Permalink
-
Voting:
-
0
+
If the polynomial hierarchy collapses, there'll be panic at some institutions in Washington.
— Juris Hartmanis
·
June 28, 1982
·
Permalink
-
Voting:
-
1
+
Somebody once asked John Hopcroft about the problem of P and NP. He answered: "On Tuesdays, I try to prove that they are equal, on the rest of the week - that they are different." I believe that he has reduced the time to try to show that they are equal to Sunday afternoons.
— Juris Hartmanis
·
June 28, 1982
·
Permalink
-
Voting:
-
2
+
The recursion theorem is just like tennis. Unless you're exposed to it at age five, you'll never become world class.
— Juris Hartmanis
·
May 1, 1982
·
Permalink