FTP, name this theoretical model of computer proposed to model all possible computations.
The Chaitin constant omega is the probability that a randomly chosen one of these halts, while the busy beaver function is defined as the maximum number of 1's that one of these can print. Equivalent to a push-down automata with two stacks, the thesis of Church and its namesake states that any possible computation can be performed with this device. It consists of an initially empty tape, list of possible states, and finite set of instructions corresponding to different internal states. FTP, name this theoretical model of computer proposed to model all possible computations.
The Chaitin constant omega is the probability that a randomly chosen one of these halts, while the busy beaver function is defined as the maximum number of 1's that one of these can print.
{Turing} machine