For Cybersecurity, Computer Science Must Rely on the Opposite of Gödel’s Results - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

For Cybersecurity, Computer Science Must Rely on the Opposite of Gödel’s Results

Carl Hewitt
  • Function : Author
  • PersonId : 1011894


This article shows how fundamental higher-order theories of mathematical structures of computer science (e.g. natural numbers [Dedekind 1888] and Actors [Hewitt et. al. 1973]) are cetegorical meaning that they can be axiomatized up to a unique isomorphism thereby removing any ambiguity in the mathematical structures being axiomatized. Having these mathematical structures precisely defined can make systems more secure because there are fewer ambiguities and holes for cyberattackers to exploit. For example, there are no infinite elements in models for natural numbers to be exploited. On the other hand, the 1st-order theories of Gödel’s results necessarily leave the mathematical structures ill-defined, e.g., there are necessarily models with infinite integers. Cyberattackers have severely damaged national, corporate, and individual security as well causing hundreds of billions of dollars of economic damage. A significant cause of the damage is that current engineering practices are not sufficiently grounded in theoretical principles. In the last two decades, little new theoretical work has been done that practically impacts large engineering projects with the result that computer systems engineering education is insufficient in providing theoretical grounding. If the current cybersecurity situation is not quickly remedied, it will soon become much worse because of the projected development of Scalable Intelligent Systems by 2025 [Hewitt 2019]. Gödel strongly advocated that the Turing Machine is the preeminent universal model of computation. A Turing machine formalizes an algorithm in which computation proceeds without external interaction. However, computing is now highly interactive, which this article proves is beyond the capability of a Turing Machine. Instead of the Turing Machine model, this article presents an axiomatization of a universal model of digital computation (including implementation of Scalable Intelligent Systems) up to a unique isomorphism.
Fichier principal
Vignette du fichier
strong types--394.pdf (2.51 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01566393 , version 1 (21-07-2017)
hal-01566393 , version 2 (03-08-2017)
hal-01566393 , version 3 (21-08-2017)
hal-01566393 , version 4 (25-08-2017)
hal-01566393 , version 5 (08-09-2017)
hal-01566393 , version 6 (10-09-2017)
hal-01566393 , version 7 (26-09-2017)
hal-01566393 , version 8 (23-10-2017)
hal-01566393 , version 9 (25-02-2018)
hal-01566393 , version 10 (12-03-2018)
hal-01566393 , version 11 (04-06-2018)
hal-01566393 , version 12 (17-06-2018)
hal-01566393 , version 13 (20-09-2018)
hal-01566393 , version 14 (17-10-2018)




  • HAL Id : hal-01566393 , version 14


Carl Hewitt. For Cybersecurity, Computer Science Must Rely on the Opposite of Gödel’s Results. Symposium on Logic and Collaboration for Intelligent Applications, Mar 2017, Stanford, United States. ⟨hal-01566393v14⟩
892 View
490 Download


Gmail Facebook X LinkedIn More