Computational Phenomena Dual-Substrate Lab

"Wherever there are phenomena, there can be a science to explain them. There are computers. Ergo, computer science is the study of computers." — Newell, Perlis, & Simon (1967)

Substrate Execution Engine

State: A

Step through computational state transitions. In Physical mode, tape bit flips incur Landauer erasure entropy $E \ge k T \ln 2$.

IDEAL TURING TAPE (INFINITE MEMORY) HEAD AT CELL 4
PHYSICAL SILICON SUBSTRATE (THERMAL DISSIPATION LATTICE) T = 300 K | 3.5 GHz
Steps Executed
0
Tape Symbols (1s)
0
Landauer Dissipation
0.00 J
Complexity Class
P
Halting Status
Running...

Proved vs. Conjectured Matrix

Filter by Status

Does computer science study abstract formal proofs or physical engineering phenomena?

Milestone Detail: Turing Halting Decidability

Alan Turing (1936) proved that no general algorithm can determine whether an arbitrary program halts. For BB(3), finite states allow definitive decidability.

Status: Proven Theorem (1936) Complexity: Undecidable in general; BB(3) halts in exactly 14 steps.

The Foundational Question: Does Computer Science Need Computers?

"Computer science is the study of the phenomena surrounding computers... The computer is an artifact, a product of engineering, yet it gives rise to a world of empirical phenomena as rich as any natural science."

— Allen Newell, Alan Perlis, and Herbert Simon (Science, 1967)

The physicalist view: Software relies on thermal dissipative bits, signal travel at $c$, and empirical software system behavior under physical stress.

"Computer science is no more about computers than astronomy is about telescopes, biology is about microscopes or chemistry is about beakers and test tubes. Science is not about tools, it is about how we use them and what we find with them."

— Edsger W. Dijkstra / Hal Abelson (SICP, 1985)

The mathematical view: Turing completeness, P vs NP, and algorithm correctness exist eternally in mathematical space, independent of whether silicon exists in the universe.