Re: [Algorithms] Turing machine question

[Jon V. <ju...@gm...>]

This sounds pretty much like what you're talking about:
http://en.wikipedia.org/wiki/Linear_bounded_automaton

Good Luck!

Regards,
   Jon Valdés

On Thu, Jul 16, 2009 at 2:33 PM, Danny Kodicek<dr...@we...> wrote:
> I've been making a small game about Turing machines, which features a
> programmable robot that moves boxes around on a straight track, and I'm
> wondering if anyone knows the answer to this question:
>
> My robot works very similarly to a Turing machine, with one exception: it
> can pick up and move boxes, but it can't create or destroy them. So if there
> are 8 boxes on the track (equivalently, if there are 8 1's on the Turing
> Machine tape), there will always be 8 boxes (one of which may be being
> carried by the robot). Does anyone know if it's possible, given sufficient
> boxes to work with, to make a universal TM using this system? My instinct
> says no, but I'd be interested to know if the problem has been analysed or
> has a name.
>
> Thanks
> Danny
>
>
> ------------------------------------------------------------------------------
> Enter the BlackBerry Developer Challenge
> This is your chance to win up to $100,000 in prizes! For a limited time,
> vendors submitting new applications to BlackBerry App World(TM) will have
> the opportunity to enter the BlackBerry Developer Challenge. See full prize
> details at: http://p.sf.net/sfu/Challenge
> _______________________________________________
> GDAlgorithms-list mailing list
> GDA...@li...
> https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list
> Archives:
> http://sourceforge.net/mailarchive/forum.php?forum_name=gdalgorithms-list
>