Comment by dane-pgp
5 years ago
That makes me wonder if someone has ever written a scientific paper proving that the bureaucratic processes in place at their company are Turing Complete. You can imagine some sort of Rule 110 cellular automaton being implemented in TPS reports.
A cellular automaton over office documents would be a nice thing to try! That said, a proof of turing-completeness of bureaucracy is relatively trivial:
With sections 1a/1b implementing conditional branching, and section 4 implementing storage.
> proving that the bureaucratic processes... are Turing Complete
It's called COBOL