Timeline for Why is writing down mathematical proofs more fault-proof than writing computer code?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 16, 2020 at 10:30 | history | edited | CommunityBot |
Commonmark migration
|
|
| Dec 18, 2017 at 17:45 | comment | added | JimLohse | @Ovi my guess on your question is that programming in Dijkstra's time more often meant writing assembly code vs. the modern era of high-level languages. Similarly, I am reading the 1974 edition of Mythical Man-Month, the concepts are still current but the technical references are systems-level assembler or PL/I, much different from what most people think of as programming today | |
| Dec 14, 2017 at 16:53 | history | edited | Discrete lizard♦ | CC BY-SA 3.0 |
add relevant quote
|
| Dec 14, 2017 at 15:55 | comment | added | wvxvw | Upvote for quoting Dijkstra, but you chose the wrong place! He has written a lot about this problem in the first paragraphs of Structured Programming. I wouldn't want to alter your answer by submitting a different quote, but I would hope you'd look into adding more from that paper to your answer! | |
| Dec 13, 2017 at 9:03 | comment | added | Discrete lizard♦ | @Ovi I'm not precisely sure, but the main difference is that he talks about (non-trivial) algorithmic problem solving more than 'general' programming tasks, i.e. he certainly isn't talking about some CRUD program that needs to connect some existing architectures or other components etc. More on Dijkstra's opinion of programming can be seen in this answer | |
| Dec 13, 2017 at 5:09 | comment | added | Ovi | I am just a layman; what did Dijkstra really refer to by "programming"? | |
| Dec 11, 2017 at 17:38 | history | answered | Discrete lizard♦ | CC BY-SA 3.0 |