Difference between revisions of "Determinism"
(→Problem) |
|||
| Line 3: | Line 3: | ||
==Context== | ==Context== | ||
| − | In 1976 Niklaus Wirth<ref>Niklaus Wirth, Algorithms + Data Structures = Programs. (1976) Prentice Hall Preface ISBN 0-13-022418-9</ref> appears to make the statement that computer programs could be understood with the follow statement: <blockquote>In recent years the | + | In 1976 Niklaus Wirth<ref>Niklaus Wirth, Algorithms + Data Structures = Programs. (1976) Prentice Hall Preface ISBN 0-13-022418-9</ref> appears to make the statement that computer programs could be understood with the follow statement: <blockquote>In recent years the subject of Computer Programming has been recognized as a discipline whose mastery is critical to the success of many engineering projects and which is amenable to scientific treatment and presentation. It has advanced from a craft to an academic discipline. The initial outstanding contributions toward this development were made by W. E. Dijkstra and C. A. R. Hoare. K\Dijkstra's "notes on Structured Programming" open a new view of programming as a scientific subject and an intellectual challenge, and it coined the title for a "revolution" in programming. Hoares's "axiomatic Basis of Computer Programming" showed in a lucid manner that programs are amenable to an exacting analysis based on mathematical reasoning.</blockquote> |
| + | The follow on computer science programs focused on objection oriented computing and verification of correctness, which had some successes, but have not lived up to the hype that accompanied their introductions. | ||
==Problem== | ==Problem== | ||
| − | Alan Turing had proven that the full progress of a program cannot, in general, be known without actually running the program.<ref>Alan Turing, ''The Halting Problem.'' (1936) Wikipedia https://en.wikipedia.org/wiki/Halting_problem</ref> While all computer scientists have learned Turing's theorem, it does not appear that the understood how some its limitations would apply to the | + | Alan Turing had proven that the full progress of a program cannot, in general, be known without actually running the program.<ref>Alan Turing, ''The Halting Problem.'' (1936) Wikipedia https://en.wikipedia.org/wiki/Halting_problem</ref> While all computer scientists have learned Turing's theorem, it does not appear that the understood how some its limitations would apply to the everyday work of computer programmers. That day has certainly arrived. |
==Solution== | ==Solution== | ||
Revision as of 15:28, 19 December 2018
Full Title or Meme
The doctrine that all events, including human action, are ultimately determined by prior events and conditions together with the laws of nature,
Context
In 1976 Niklaus Wirth[1] appears to make the statement that computer programs could be understood with the follow statement:In recent years the subject of Computer Programming has been recognized as a discipline whose mastery is critical to the success of many engineering projects and which is amenable to scientific treatment and presentation. It has advanced from a craft to an academic discipline. The initial outstanding contributions toward this development were made by W. E. Dijkstra and C. A. R. Hoare. K\Dijkstra's "notes on Structured Programming" open a new view of programming as a scientific subject and an intellectual challenge, and it coined the title for a "revolution" in programming. Hoares's "axiomatic Basis of Computer Programming" showed in a lucid manner that programs are amenable to an exacting analysis based on mathematical reasoning.
The follow on computer science programs focused on objection oriented computing and verification of correctness, which had some successes, but have not lived up to the hype that accompanied their introductions.
Problem
Alan Turing had proven that the full progress of a program cannot, in general, be known without actually running the program.[2] While all computer scientists have learned Turing's theorem, it does not appear that the understood how some its limitations would apply to the everyday work of computer programmers. That day has certainly arrived.
Solution
If the course of a computer program cannot be known in advance, it is irrelevant to the way that humans lead their lives in the current world as we cannot, in theory, know the results of any complex device that we may build in the future. That is not a statement that in any way should limit the responsibility of the programmers from their responsibility to society, even though their own code of Ethics refuses to articulate that ultimate responsibility.
References
- ↑ Niklaus Wirth, Algorithms + Data Structures = Programs. (1976) Prentice Hall Preface ISBN 0-13-022418-9
- ↑ Alan Turing, The Halting Problem. (1936) Wikipedia https://en.wikipedia.org/wiki/Halting_problem
