Slashdot Mirror


A Model Railroad That Computes

tri44id writes "Several blogs have noted an Austrian team that has built a model train set that is a primitive computer. I have to point out, though, that it's actually only a Finite State Machine, like a pocket calculator, not a general-purpose device. Their plan for a general purpose layout is for an infinite-state machine, not a FSM+tape that Turing envisioned in his original paper. Turing took the concept a further step, by presenting a Universal Turing Machine that embodies a special set of states and transitions that allows its tape to be programmable to emulate any other TM. Do Slashdot readers know of any mechanical implementations of a truly Universal Turing Machine? (Danny Hillis' famous tinkertoy tic-tac-toe machine has neither infinite tape nor programmability, and is thus yet another FSM. It shouldn't be hard to elaborate the Austrian model train FSM to use a series of cars carrying movable magnets to represent Turing's tape cells writable with different symbols, and thus become a true TM or even UTM."

24 of 198 comments (clear)

  1. Too much time by strider44 · · Score: 5, Funny

    I just wasted about half a day compiling and recompiling my linux kernel to get it "just right".

    But still, I feel even I have the authority to say that some people just have too much time.

  2. Re:Just state machine? by Welpa · · Score: 3, Funny

    Yep, this is a truly embarassing story. Just goes to show that if you use enough technical jargon, you can fool a Slashdot editor into accepting a troll.

  3. Re:Just state machine? by KontinMonet · · Score: 4, Funny

    Microsoft patented a process for a 'limited resource computing device'. Presumably because they are aware of an unlimited resource computing device somewhere. Why don't you contact them?

    --
    Did he inhale?
  4. Mine was derailed... by Eternal+Vigilance · · Score: 5, Funny

    Would a UTM Railroad be a train of thought?

  5. But can it beat a horse? by Eatmorecake · · Score: 1, Funny

    I saw a horse that could do math once... ask it to add, subtract, or multiply, and it was right 9 out of 10 times... No way yer newfangled iLocomotive can beat that sucker!

    --
    Don't you mean.. BIZZARO! ..Signature?
    1. Re:But can it beat a horse? by Kombat · · Score: 2, Funny

      At least it beats a lot of dead horse...

      Except in Soviet Russia, where the dead horse beats ... nevermind.

      --
      Like woodworking? Build your own picture frames.
  6. Re:Finite State Machines? Don't knock-em by DisprinDirect · · Score: 3, Funny

    Is this not a Choo-Chooring machine?

  7. True mechanical implementations? by kinnell · · Score: 4, Funny
    Do Slashdot readers know of any mechanical implementations of a truly Universal Turing Machine?

    Given the requirement for an infinitely long tape, I suspect the answer to this question might be no.

    --
    If I seem short sighted, it is because I stand on the shoulders of midgets
  8. Awake for 29 hours, what do I see..... by Eatmorecake · · Score: 3, Funny

    I'm currently at work, graveyard, and this thing just blew my mind. Someone said this thing is terribly slow, (I doubt they meant it as an insult) but if you wanted to solve that problem you could make a three dimentional roller coaster version. That would be MUCH faster.

    --
    Don't you mean.. BIZZARO! ..Signature?
  9. I'm English . . . . by Tetsugaku-San · · Score: 5, Funny

    I bet they still don't run on time.

  10. Old news by Timesprout · · Score: 3, Funny

    Thomas the tank engine has been solving problems for ages now, and in multi task more he keeps the kids amused while he does it.

    --
    Do not try to read the dupe, thats impossible. Instead, only try to realize the truth
    What truth?
    There is no dupe
  11. Re:Just state machine? by Anonymous Coward · · Score: 1, Funny

    When you realise, that computers are just finite state machines, you also realise that they must reach a point (state) where they have been before. Given the determinative nature of the computer the next state is given from the current. So it starts to repeat it self over, and over again. Isn't this the exact definition of a computer crash? So why does so many people bother switching on their computers when they know that it has entered an infinite loop, even before it has booted.

  12. Sure... by famebait · · Score: 3, Funny

    Do Slashdot readers know of any mechanical implementations of a truly Universal Turing Machine?

    No, but I have an infinite tape lying around in my shed, so if you know how to do the logic stuff, we can team up.

    --
    sudo ergo sum
  13. Surely they must exist by N+Monkey · · Score: 2, Funny
    Do Slashdot readers know of any mechanical implementations of a truly Universal Turing Machine?


    Of course not.

    I'm sure there must be some... they'll be in a backroom somewhere, stacked next to the perpetual motion machines and the random noise compression algorithms. :-)
  14. Thank God for model trains by Inkieminstrel · · Score: 4, Funny

    If they didn't have the model train, they wouldn't have gotten the idea for the big trains

  15. MS Windows On Board . . . by Dausha · · Score: 2, Funny

    "I have to point out, though, that it's actually only a Finite State Machine, like a pocket calculator, not a general-purpose device."

    So, does that means it runs Windows? Perhaps it is a special version Windows: Windows RR (as opposed to Windows 958MeNTXP2000CE). Of course, unlike other versions of Windows, it does not crash--it derails.

    Thank you. I'll be here all weekend. Please tip your kelnerino.

    --
    What those who want activist courts fear is rule by the people.
  16. Re:Or maybe you're just slow by qray · · Score: 2, Funny

    He was probably using a steam locomotive model train. You were probably using one of the bullet train model railways.

    The bullet trains are much better at hard tasks like compiling kernels, but watch out if they derail. Gives new meaning to the term "system crash".

    --
    oxray mortum docrutia foodrum

  17. Happy Valentine's Day! by mog · · Score: 1, Funny

    I choo-choo choose you!

  18. Re:Finite State Machines? Don't knock-em by Pig+Hogger · · Score: 1, Funny
    Now you go to someone else's computer with a little bit less RAM. You cannot repesent as many states now so you must decide which of your named states are least important: like dropping functionality from a program by throwing away functions.
    Say, like, er, Clippy???
  19. Forget the computer thingy... by Reignking · · Score: 4, Funny

    This layout is horrible! Get some trees in there! Some buildings? This guy made up the computer idea to hide the fact that he couldn't use plaster-of-Paris.

    --
    One man's Funny is another man's Offtopic.
  20. Halting by Redwing · · Score: 2, Funny

    Turing showed that such a train can never compute whether it will stop at a given station.

    --
    Raisinettes are my raison d'etre
  21. Re:ObComment by caveat · · Score: 2, Funny

    Amtrak?

    --

    Facts do not cease to exist because they are ignored. - Aldous Huxley
  22. Search engines take on a whole new meaning by Frateroe418 · · Score: 2, Funny

    Imagine, a search engine (perhaps a small diesel) looking for those missing op codes. I suppose that there would be more likelihood of crashes too, especially if there are too many wet leaves on the tracks.

  23. Re:Sorry... by SwimsWithTheFishes · · Score: 2, Funny

    Not TURING machine, TOURING machince.

    Just another dog-gone Slashdot typo.

    --
    *click**beep**beep* Scotty, One to Mod up!