Hypercomputation: computing more than the Turing machine by Toby Ord Models of computation that compute more than the Turing machine are conceptually unproblematic and may even be buildable. This has many important implications. The most direct of these is that mathematical proofs that certain functions are ‘uncomputable’ must be more clearly understood as shorthand for ‘uncomputable by a Turing machine’ and not as a limitation on mathematics. Hypercomputation clearly has considerable implications... read more
