Prime Numbers and Turing

Dated: 

October 2012

In his beautifully written book The Music of the Primes [1], Marcus du Sautoy presented a history of mathematical investigations into the behavior of the prime numbers. Can one predict when the next prime number will occur? Is there a formula that could generate prime numbers? Du Sautoy entertained such questions by discussing the work of several great mathematicians of the past, including Gauss, Riemann, and Turing.

Tags: 

Difficulties of Writing About Turing's Legacy

Dated: 

3 September 2013

My mentor, the historian Gerard Alberts, has advised me repeatedly during the past four years not to use technological concepts, like `program', `compiler', and `universal Turing machine', as subjects of my sentences. Instead, I should use historical actors. For example, I should not write

During the 1950s, a universal Turing machine became widely accepted as a conceptual abstraction of a computer.

Instead, I should write

By 1955, Saul Gorn viewed a universal Turing machine as a conceptual abstraction of his computer.

Tags: 

The Essential Knuth

Dated: 

August 2013

New book: The Essential Knuth.  Just appeared!

From the Preface:

Approaching him seemed impossible. I had to wait my turn. Swarmed by admirers, Donald E. Knuth was struggling not to spill his drink at a reception in honor of Alan M. Turing. The rain outside and the fact that it was a summer day (June 22, 2012) meant that we were somewhere in England.

Tags: 

Multiprogramming: from Symmetries to Cases

Dated: 

early 1963

Dijkstra tackled the problem of allowing multiple users share the university's X8 computer and its peripheral hardware devices (EWD 51). To solve this problem, Dijkstra first reformulated it in terms of as many symmetries as he could find, thereby obtaining a more general problem description.

Tags: 

Geneva Talk

Dated: 

1973

[Here are the contents of some visuals from Dijkstra's presentation in Geneva, 1973. Source: my archives, Box 11]

(1A)
Our programs serve to instruct our machines.
-->   A “mismatch” is blamed on the program.

(1B)
Our machines serve to execute our programs.
-->   A “mismatch” is blamed on the machine.

Tags: 

Pages

 
Subscribe to Dijkstra's Rallying Cry for Generalization RSS