[FOM] universal machine as a primitive instruction

[David Leduc]

On Fri, Apr 12, 2013 at 10:51 AM, <T.Forster at dpmms.cam.ac.uk> wrote:

> Have i missed answers to this?


No, unfortunately you have not.


> Is Turing-computable the only notion of computability that supports a
> universal machine?
>

At least in my textbooks and on Wikipedia, there is no weaker notion of
computability that is shown supporting a universal machine. But can it be
proven?


On Sat, Apr 13, 2013 at 11:40 AM, Steve Stevenson <steve at clemson.edu> wrote:

> I have my undergrad computability students, all computer science/math
> majors, implement emulators (universal machines) for FSA, PDA, and Tm
> (both deterministic and non-deterministic) in their favorite programming
> language.
>

The way I understand "universal machine", it cannot be implemented in your
favorite language but has to be implemented in the language of the machine
it emulates.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: </pipermail/fom/attachments/20130415/5d39a2cd/attachment.html>