Church-Turing Machines

A Church-Turing Machine obeys the laws of the Lambda-Calculus as a fail-safe process of computation based on the Church-Turing Thesis. A Church-Turing Machine is a future-safe, fail-safe computer that operates using encapsulated mathematical symbols. The same mathematical process of expressions taught at school. Implementing the laws of the Lambda-Calculus leads to infallible automation first proven by Charles Babbage, and previously demonstrated by the Abacus and the Slide Rule.
Ken is an Independent Consultant in South Florida for secure cloud-based software and mobile access software. Graduated in the UK, developed the first Capability-Based Computers (PP-250), became a Charted Engineer, and awarded a Fellowship of the IEE (London). Partnered on a dozen patents developing Object Engineering fundamentals while working in UK, USA, Germany, and Belgium. Invitation speaker at conferences on Operating Systems and Communications.

Comments

Post a Comment