However, the reader needs to be cautioned that, even though the μ operator is easily created by the base instruction set doesn't mean that an arbitrary partial recursive function can be easily created with a base model -- Turing equivalence and partial recursive functions imply an unbounded μ operator, one that can scurry to the ends of the register chain ad infinitum searching for its goal.
•
Minsky shows that if two or more registers are available then the simpler INC, DEC etc. are adequate (but the Gödel number is still required to demonstrate Turing equivalence; also demonstrated in Elgot-Robinson 1964 ).
Enigma machine | Rage Against the Machine | Automated teller machine | Counter-Reformation | Victor Talking Machine Company | Soft Machine | The Time Machine | Linotype machine | Vickers machine gun | DeLorean time machine | Counter-Strike | Darne machine gun | Rube Goldberg machine | MG 17 machine gun | The Wolseley Sheep Shearing Machine Company | Machine Head (band) | Machine Head | KPV heavy machine gun | slot machine | machine | Geiger counter | ShKAS machine gun | PK machine gun | machine pistol | Love Removal Machine | counter-insurgency | Carter the Unstoppable Sex Machine | American Machine and Foundry | Zouk Machine | Wayback Machine |