"A computation is a process that obeys finitely describable rules"
About this Quote
Rucker’s line is doing a quiet but pointed piece of boundary-drawing: it shrinks the sprawling mystique of “computation” down to its defining constraint. Not speed, not silicon, not even numbers, but rule-following that can be captured in a finite description. That’s a scientist’s move, and it lands like a cultural corrective in an era that treats computation as either magic (“the algorithm knows”) or mere machinery (“just crunching data”).
The intent is clarifying, but the subtext is argumentative. If a process can’t be specified by finitely describable rules, it doesn’t count as computation in the strict sense; it becomes something else - intuition, randomness, chaos, or whatever you want to call the parts of reality that refuse to be boxed into a program. That “finitely describable” clause is the whole knife edge. It quietly invokes the legacy of Turing and Church: the idea that what can be effectively calculated is what can be expressed as a finite procedure. It also smuggles in a limit: some truths may be well-defined yet not derivable by any finite rule system (a Gödel-shaped shadow).
Context matters because Rucker sits at the crossover of math, computer science, and speculative imagination. He’s not romanticizing computers; he’s insisting on the philosophical price of calling something “computational.” In today’s AI moment, the line reads as both grounding and provocative: these systems look uncanny, but they remain, at bottom, finitely specified rule-bound processes - and that fact is either reassuring or deeply unsettling, depending on what you think a mind is.
The intent is clarifying, but the subtext is argumentative. If a process can’t be specified by finitely describable rules, it doesn’t count as computation in the strict sense; it becomes something else - intuition, randomness, chaos, or whatever you want to call the parts of reality that refuse to be boxed into a program. That “finitely describable” clause is the whole knife edge. It quietly invokes the legacy of Turing and Church: the idea that what can be effectively calculated is what can be expressed as a finite procedure. It also smuggles in a limit: some truths may be well-defined yet not derivable by any finite rule system (a Gödel-shaped shadow).
Context matters because Rucker sits at the crossover of math, computer science, and speculative imagination. He’s not romanticizing computers; he’s insisting on the philosophical price of calling something “computational.” In today’s AI moment, the line reads as both grounding and provocative: these systems look uncanny, but they remain, at bottom, finitely specified rule-bound processes - and that fact is either reassuring or deeply unsettling, depending on what you think a mind is.
Quote Details
| Topic | Coding & Programming |
|---|
More Quotes by Rudy
Add to List

