2015/10/15 by Garry Pantelis, Pantelis, Garry
Computer Science · #00A71 #03B15 (Secondary) #03B35 (Primary) #Cellular Automata and Applications #Computability, Logic, AI Algorithms #D.2.4 #Distributed and Parallel Computing Systems #F.4.1 #FOS: Computer and information sciences #Logic in Computer Science (cs.LO)
paper · pdf · doi:10.48550/arxiv.1510.04469
openalex publication_date 2015/10/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This book explores an alternative to the current dominant paradigm where a discrete computer model is constructed as an attempt to approximate some continuum theory. We focus on a class of discrete computer models that are based on simple deterministic rules and finite state arithmetic. Such models are highly compatible with the operational parameters of the real world computer on which they are executed and hence their validation can be associated with the allowable computations on the machine. A simple formal system based on a language of functional programs is employed as a tool of analysis.