The Infallible Automation of Computer Science

A General-Purpose Computer is like Napiers Bones while a Church-Turing Machine is like a slide rule. A machine has a cyclic framework for computation instead of a set of loose parts. One is just a pile of stones used for counting while the other is a fail-safe machine for mathematical functions. Read Civilizing Cyberspace to understand more how the laws of the Lambda Calculus define the machinery of computer science, and why the Church-Turing Thesis holds the keys, both figuratively and literally to the future of cyber democracy.

Comments