Content deleted Content added
m Explicitly cite Minsky's μ-recursion equivalence quote |
m Minsky (1972) should use existing ref anchor |
||
Line 49:
[[Marvin Minsky|Minsky]] observes the <math>U</math> defined above is in essence the μ-recursive equivalent of the [[universal Turing machine]]:
{{blockquote |text=To construct U is to write down the definition of a general-recursive function U(n, x) that correctly interprets the number n and computes the appropriate function of x. to construct U directly would involve essentially the same amount of effort, ''and essentially the same ideas'', as we have invested in constructing the universal Turing machine {{sfn|Minsky|
== Symbolism ==
| |||