Dated: 14 January 2026 Edgar G. Daylight, 2026. A Case Against Stephen Kleene s Incomputability. Philosophy and Realistic Reflection, 3(1): 103–125. Available here: #mce_temp_url# . Errata (if any) to appear here ... [last update: 2 February 2026]
Dated: 4 April 2025; last update: 16 May 2026 E.G. Daylight, Injecting Observers into Computational Complexity , Philosophies 2025 , 10 (4), 76; https://doi.org/10.3390/philosophies10040076 E.G. Daylight, Tableau with Holes: Clarifying NP-Completeness , Symmetry 2025 , 17 (5), 677; https://doi.org/10.3390/sym17050677 E.G. Daylight, Tossing Coins with an NP-machine, Symmetry 2025 , 17 (10), 1745;…
Dated: 31 May 2022 -- 17 October 2023 In the professional activities of tightly structured disciplines, conformity is more highly valued than originality; or, rather, originality is tolerated only for as long as it reinforces the core values of a department. (S. Toulmin) Repetition renders the ridiculous reasonable. (N. J. Wildberger) Do only what only you can do. (E. W. Dijkstra) Every smart…
Dated: 19 June 2023 New paper on Alan M. Turing and the history of computer science: Edgar Daylight. True Turing: A Bird’s-Eye View , Minds & Machines , published on 19 June 2023. Video lecture: forthcoming Errata : It turns out that I use the word "pace", as in "pace Hobson", in precisely the wrong way. I mean to say: "in adherence to Hobson s view" and not "despite Hobson s view." Shame on me…
Dated: 12 April 2023 Does Turing s 1936 article rely on actual infinity or potential infinity? Turing s 1936 article, "On Computable Numbers, with an Application to the Entscheidungsproblem," does not rely on the concept of actual infinity, but instead relies on the concept of potential infinity. Turing s main contribution in the article is the notion of a Turing machine, which is a theoretical…
Dated: 12 April 2023 Question: Does Cantor s famous diagonal argument rely on actual infinity or potential infinity? In case of the latter, is it possible to prove Cantor s result with potential infinity? Answer: Cantor s diagonal argument relies on the concept of actual infinity, specifically the notion that there is an infinite set of infinite sequences. Cantor s argument involves assuming that…
Dated: 12 April 2023 Question: Do people today actually understand the contents of Turing s seminal 1936 paper? Answer: Turing s seminal 1936 paper "On Computable Numbers, with an Application to the Entscheidungsproblem" is considered to be one of the foundational papers of computer science and has had a profound impact on the field. While the paper s concepts and arguments are challenging and…
Dated: 12 April 2023 Question: Was Turing an idealist? Answer: Based on Turing s work and writings, it seems that he was not an idealist in the philosophical sense, which holds that reality is ultimately mental or spiritual in nature. Instead, he was a materialist who believed that the mind and consciousness could be explained in terms of physical processes. In his 1950 paper "Computing Machinery…
The attached PDF file is written in Dutch; it addresses a case study from the Freudenthal Institute . The picture on page 17 ain t completely right. Courtesy of J.D. [Last update: 22 Feb. 2023] PDF: Karel_Van_Oudheusden_(7.4.A)_9_januari_2023.pdf Tags: Teaching Wittgenstein Category Mistakes paper
Dated: 16 September 2022 Scrutinizing the history of mathematics and computer science has led me to the following illustration & line of argumentation, followed by two typical responses and then a question which I pose to my readers . Perhaps the sequel contains a few insights for the reader too; alas, some sections are peppered with nonsense (most of which I have labelled accordingly). An…