An extension of this statement was refined by Wilfried Sieg to include only boundedness, locality, and determinancy, and Steven Wolfram expanded it to systems in the natural world. Tibor Rado introduced a function for which it doesn't apply known as the busy beaver, and it c
An extension of this statement was refined by Wilfried Sieg to include only boundedness, locality, and determinancy, and Steven Wolfram expanded it to systems in the natural world. Tibor Rado introduced a function for which it doesn't apply known as the busy beaver, and it could be challenged by the existence of an oracle. One version of it grew out of Hilbert's decision problem, while another formulation stated that real world numerical problems could be expressed using the lambda calculus. For 10 points, name this doubly eponymous principle that says every computable function can be computed with one of its namesake's machines.
An extension of this statement was refined by Wilfried Sieg to include only boundedness, locality, and determinancy, and Steven Wolfram expanded it to systems in the natural world.
Church-Turing thesis [accept in either order; prompt on a single name before "doubly"]