3 ms·> proving that the bureaucratic processes... are Turing Complete It's called COBOLby Igelau 6y ago> proving that the bureaucratic processes... are Turing Complete It's called COBOL