an extensive overview of philosophical questions in computer science, particularly concerning ontology (what is a computer) and teleology (does a computer need a purpose), as well as syntax and semantics
note from semantics of programming languages: they say that the main thing helping in the semantics of programming languages is higher-order functions, which matches the indigenous semantics below.
CS is unique from maths as it deals with two things that are not (immediately?) related to math:
CS is the science of how machines can carry out intellectual processes (McCarthy, 1963)
CS is the science of process (programs are static texts which turn into processes, dynamic entities) and, even further, the science of procedural epistemology (Abelson, 1996)
CS is the engineering of abstract objects (following Brook’s Turing Lecture)
but CS cannot be one (science, conceptual, what) without the other (engineering, practical, how) (and this is where the art happens?) Because, as Knuth said “if we don’t fully understand something, it is an art to deal with it”.
Thoughts without content are empty, intuitions without concepts are blind… The understanding can intuit nothing, the senses can think nothing. Only through their union can knowledge arise (Kant, 1781, p.93)
see refs list in schedule
a program is a cognitive artefact, which can be understood on three different levels, according to Moor:
read 19.4.3 for Lakoff
software as a pattern of syntactical form (see Suber, 1988)
rapaport 1999, implementation is semantic interpretation
putnam, representation and reality, 1988 (pp.121-125)
-> these all relate to goodman
given two domains (SYN and SEM), there is a mapping between the two. semantic understanding is:
and, actually, the specificity of turing machines is that they can be understood entirely syntactically. there can be instances of indigenous semantics, which are essentially subroutines.
software is a model, a medium of thought, an environment (Mahoney, 2011)
Lamport, 2015, says that “abstraction is an art” -> to be developed
being computer-understandable means that it is computer-decodable
in order to understand a computer program, we need to give it meaning, that’s what always happens: “distinguishing from noise is something that literature does” (Suber, 1988, p.97)
the question “what does a Turing machine do?” has
n+1 answers. 1 syntactic, and n semantic (however many interpretations)