"A computation is a process that obeys finitely describable rules"
About this Quote
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 |
|---|---|
| Source | Help us find the source |
| Cite |
Citation Formats
APA Style (7th ed.)
Rucker, Rudy. (2026, January 15). A computation is a process that obeys finitely describable rules. FixQuotes. https://fixquotes.com/quotes/a-computation-is-a-process-that-obeys-finitely-95008/
Chicago Style
Rucker, Rudy. "A computation is a process that obeys finitely describable rules." FixQuotes. January 15, 2026. https://fixquotes.com/quotes/a-computation-is-a-process-that-obeys-finitely-95008/.
MLA Style (9th ed.)
"A computation is a process that obeys finitely describable rules." FixQuotes, 15 Jan. 2026, https://fixquotes.com/quotes/a-computation-is-a-process-that-obeys-finitely-95008/. Accessed 8 Feb. 2026.


