Hewitt, Carl (2019) For Cybersecurity, Computer Science Must Rely on Strong Types. [Preprint]

Text
LICS110.pdf Download (1MB)  Preview 
Abstract
This article shows how fundamental higherorder theories of mathematical structures of computer science (e.g. natural numbers [Dedekind 1888] and Actors [Hewitt et. al. 1973]) are categorical 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 1storder theories of Gödel’s results necessarily leave the mathematical structures illdefined, 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. [Sobers 2019] 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.
Export/Citation:  EndNote  BibTeX  Dublin Core  ASCII/Text Citation (Chicago)  HTML Citation  OpenURL 
Social Networking: 
Item Type:  Preprint  

Creators: 


Keywords:  categorical theories, strong types, Scalable Intelligent Systems, Alonzo Church, Kurt Gödel, Richard Dedekind  
Subjects:  Specific Sciences > Mathematics > Foundations Specific Sciences > Mathematics > History Specific Sciences > Mathematics > Logic Specific Sciences > Mathematics > Proof Specific Sciences > Computer Science Specific Sciences > Mathematics 

Depositing User:  Prof. Carl Hewitt  
Date Deposited:  11 May 2019 17:01  
Last Modified:  11 May 2019 17:01  
Item ID:  16001  
Subjects:  Specific Sciences > Mathematics > Foundations Specific Sciences > Mathematics > History Specific Sciences > Mathematics > Logic Specific Sciences > Mathematics > Proof Specific Sciences > Computer Science Specific Sciences > Mathematics 

Date:  10 May 2019  
URI:  https://philsciarchive.pitt.edu/id/eprint/16001 
Monthly Views for the past 3 years
Monthly Downloads for the past 3 years
Plum Analytics
Actions (login required)
View Item 