Remember today 2 – halting problem

In memoriam to Alan Turing (http://de.wikipedia.org/wiki/Alan_Turing)

„In computability theory, the halting problem can be stated as follows: Given a description of an arbitrary computer program, decide whether the program finishes running or continues to run forever. This is equivalent to the problem of deciding, given a program and an input, whether the program will eventually halt when run with that input, or will run forever.

Alan Turing proved in 1936 that a general algorithm to solve the halting problem for all possible program-input pairs cannot exist. A key part of the proof was a mathematical definition of a computer and program, what became known as a Turing machine; the halting problem is undecidable over Turing machines. It is one of the first examples of a decision problem.“

http://en.wikipedia.org/wiki/Halting_problem

 

What the hack is that – Sifteo interactive game cubes

Never seen the gadget before today, found it as a buyers recommendation when looking for Sphero found via http://www.heise.de/newsticker/meldung/Angerollt-Roboter-Kugel-Sphero-1542563.html.

„Each Sifteo cube packs a clickable, full color LCD display, a variety of motion sensors and a rechargeable battery into a sturdy 1.5 inch block – perfect for hands of all ages to grab and play with.

Sifteo cubes connect wirelessly to a nearby computer via a compact USB radio link, and can hold up to 4 hours of play on a single charge. Our SiftRunner desktop software is your command-center: browse and play your games, create your own with the Sifteo Creativity Kit™, and find more in the Sifteo store! The included Sifteo charging dock can recharge up to six cubes at once, and can house your cubes and USB link when not in use.“

https://www.sifteo.com/

Company blog site http://blog.sifteo.com/