Strachey and ApSimon, 1965

Dated: 

1 November 2017

In 1965 Christopher Strachey introduced his termination problem, which I also call Strachey's Halting Problem in my writings, to the readership of The Computer Journal. Specifically, Strachey provided a “proof” that it is

impossible to write a program which can examine any other program and tell, in every case, if it will terminate or get into a closed loop when it is run. [5]

Tags: 

Hopcroft and Ullman

Dated: 

24 October 2017

Is the history of computer science solely a history of progress? I don't think so. Judge for yourself by reading the present post in which I scrutinize the famous textbooks of John E. Hopcroft and Jeffrey D. Ullman.

Quotes from 1969 and 2007

I start by comparing the following two quotes. The first quote comes from Hopcroft & Ullman, 1969:

Tags: 

`Plato and the Nerd,' Part 2b: Computer Science & Descriptions vs. Software Engineering & Prescriptions

Dated: 

23 September 2017

 

One of Edward A. Lee's main topics in his book, Plato and the Nerd: The Creative Partnership of Humans and Technology (MIT Press, 2017), is the contradistinction between science and descriptions on the one hand and engineering and prescriptions on the other hand. Reading between the lines, Lee is addressing the big question: Is computer science really a science?

Tags: 

`Plato and the Nerd,' Part 1

Dated: 

3 September 2017

Some computer scientists and software engineers write about the history of their fields. Others analyze and document the philosophy of their own discipline. In this latter regard, I am happy to announce the publication of Edward A. Lee's book on the philosophy of engineering:

Plato and the Nerd: The Creative Partnership of Humans and Technology (MIT Press, 2017)

Tags: 

Ensmenger & Flowcharts

Dated: 

8 July 2017

One of the questions that keeps me awake (during the day) is the following one:

What did a “computer program” mean to Actor X in 1973?

For example, both Christopher Strachey and Edsger Dijkstra viewed a “computer program” as a mathematical object, albeit of a very different kind [1]. (A decade or more earlier, both men did not associate computer programs with mathematical objects pur sang). But what about large parts of the North American computer industry in 1973? How did actors in this field view a “computer program” in 1973?

Tags: 

Is your drone Turing complete?

Dated: 

28 June 2017

What if this ransomware business, which is going on again on a global scale today, is used in connection with moving things, as opposed to "merely" stationary computers?

Don't know about you but I'm thinking about drones, self-driving cars, and smart phones that blow up (e.g. due to ill-designed batteries).

Tags: 

Michelle Obama vs. the Gatekeeper

Dated: 

15 October 2016

Category mistakes and incomputability claims seem to go hand in hand. I have given one modern example in connection with programming languages and Michael Hicks and another one directly concerning the diagonal argument. In the present blog post I shall give one more example, based on an excerpt from my rejected POPL paper entitled: `Category Mistakes in Computer Science at Large.' Specifically, I shall zoom in on the “code improvement problem,” as discussed by Albert R. Meyer and Dennis M.

Tags: 

Pages

 
Subscribe to Dijkstra's Rallying Cry for Generalization RSS