problem solved ;)

[thedeemon]

"a Zeno Machine: a machine similar to a Turing machine except that the first instruction takes one second to compete, and each following instruction takes half of what the previous instruction took.
We could know whether a program halts or not in at most two seconds!"
(src)

Comments

[dmytrish.livejournal.com]

It's a pretty nice example of http://en.wikipedia.org/wiki/Hypercomputation