Jos Baeten

Dated: 

June 2015

On June 3rd, 2015, Jos Baeten and Liesbeth De Mol each gave a lecture for my Master class "Logic and Computation." I requested my students to write a one-page summary on either Baeten's or De Mol's talk. Baeten talked about reactive Turing machines, De Mol gave a presentation on the history of the Church-Turing thesis.

My student Bobby Vos wrote the best summary, which was on Jos Baeten's talk. I am happy to reproduce it below with Bobby's permission. Enjoy!

Tags: 

Knuth and P = NP

Dated: 

December 2014

New book: Algorithmic Barriers Falling: P=NP?  Just appeared!

From the preface:

The official site of ACM Turing Award winners describes Donald E. Knuth as the rare theoretician who writes many lines of code every day. His main life goal from the 1960s onwards is, in a nutshell, to nail the costs of computation down to the last penny.

Tags: 

A Turing Tale

Dated: 

21 August 2014

This post contains extra information about my CACM article `A Turing Tale' (October issue, 2014), specifically regarding particular book chapters and page numbers for the source citations appearing in my article.

Below, I present fragments of my article along with precise source citations which were omitted due to editorial styling conventions.

In my section entitled "Hodges":

Tags: 

Towards The Origins of Computational Complexity

One of my students at Utrecht University reflected during the spring of 2014 on the origins of computational complexity. She has given me permission to publish her beautiful essay here (anonymously).

Her chosen research topic is a difficult one to address. But, by presenting a pluralistic account in which she lets her historical actors tell the story (Cobham, Hartmanis, Rabin, Blum), she has succeeded in conveying technical information to an audience that need not be versed in complexity theory per se.

Teaching History

Dated: 

January 2014

In January 2014 I taught a Master course on the history of computing at the University of Amsterdam together with my colleague Katrin Geske. Nine groups, consisting on average of five students, followed our course for a period of four weeks (from 6 January till 31 January). Most attendees were computer science students and did not have any other academic commitments in January, at least not officially. Our objective was to have each student think, read, and write like a historian of computing by the end of the month.

Tags: 

Machine Oriented Higher Level Languages

Dated: 

August 1973

Something significant happened during the 1950s in the history of science & technology. By 1950, logicians and linguists had been studying “artificial languages” and “natural languages” for centuries. But, the words “programming language” were not used at all. By 1959, however, those words had become common currency. And, in today's digital world, the absence of “programming languages” is totally unthinkable.

Tags: 

Pages

 
Subscribe to Dijkstra's Rallying Cry for Generalization RSS