A series of essays on computer science.
A single coherent language that encompasses the expression of computation from high level abstract design through automatic elaboration to the ultimate netlist of primitive behaviors that enlivens the design. A language that characterizes computation as association relations among differentnesses, as patterns of changing differentness relative to structures of persistent differentness as “all of” relations and “one of” relations forming spontaneously behaving, self regulating networks of interacting differentness. (more…)
A given computation can be expressed many ways across the spectrum. An example computation presented as a mapping in Table 1, is expressed at various places along the spectrum. (more…)
What is the most primitive provenance of computation and how does it extend to the complexities of life and mathematics? (more…)
Can there exist an approach to universal interpretability that relates directly to the dependency network and which preserves its distributed concurrency? (more…)
Part 3 presents the logical structures of a memory, a configurable oscillation and a sequential interpreter ring forming a traditional universal sequential processor. (more…)
Part 2 presents a logical foundation for computation that does not exhibit the difficulties discussed in part 1. (more…)
Computer science is formulated with concepts borrowed from mathematics. Even though mathematics defines mathematical computation and computer science is about computation, it is argued here that there are fundamental differences between the two, that computer science is not well served by the borrowed concepts and that there exists a conceptual grounding that more effectually addresses the goals and problems of computer science. (more…)