TSM-7: From Aristotle to Newton — Towards a Scientific Theory of Computation

Since the dawn of computer science, our understanding of computation has been shaped by mathematical theories, from Aristotle's logic to Turing's formalization of algorithms. Turing Machines, with their elegant abstraction of computation into discrete steps on an infinite tape, have become a cornerstone of computational theory. However, this mathematical approach, while powerful, lacks a crucial element: empirical testability.

TSM-1: The Shannon Machine — Better Than Turing Complete?

The Shannon Machine is a decider computational system which uses bit-level word operations (rather than high-level computation) to perform arithmetric. The goal is model practical computation in a way that is more realistic -- but still as formal -- as the Linear Bounded Automoton, which has a similar level of computational power.

Blog at WordPress.com.

Up ↑