How Edward N. Zalta might approach Computer Science

Computer science, as a field of inquiry, presents a rich landscape for the application of formal ontology and computational metaphysics. At its core, computer science deals with the manipulation of information, the execution of algorithms, and the modeling of computational processes. These activities can be fruitfully understood through the lens of abstract objects and their properties.

Consider the notion of an algorithm itself. It is not a concrete physical process in the same way that a lever or a pulley is. Rather, an algorithm is an abstract object that *encodes* a particular computational procedure. It specifies a finite sequence of well-defined instructions that can be executed to perform a computation. We can formalize this within the axioms of Object Theory. An algorithm can be represented as an abstract object that encodes a set of properties, including its input specification, its output transformation rules, and its termination condition.

The distinction between encoding and exemplifying a property becomes crucial here. A specific instance of a program running on a particular machine *exemplifies* the abstract algorithm. The algorithm, however, *encodes* the structure and logic of that computation. This formal distinction allows us to rigorously distinguish between the abstract computational concept and its concrete realization.

Furthermore, the study of data structures, programming languages, and formal verification all benefit from precise ontological modeling. Type theory, for instance, which is fundamental to many modern programming languages, can be seen as a mechanism for imposing ontological constraints, preventing category errors and ensuring systematic coherence in the representation of information. The computational implementation of these…

Imagined perspective — an AI synthesis grounded in Edward N. Zalta’s recorded ideas and methods, not a quotation or a statement they actually made.