释义 |
Universal Turing MachineA Turing Machine which, by appropriate programming using a finite length of input tape, can act as anyTuring Machine whatsoever. See Chaitin's Constant, Halting Problem, Turing Machine References
Penrose, R. The Emperor's New Mind: Concerning Computers, Minds, and the Laws of Physics. Oxford: Oxford University Press, pp. 51-57, 1989.
|