Hacker News new | ask | show | jobs
by zardo 3551 days ago
There's no way out. It's turtles all the way down.
1 comments

Impossible. That would cause a stack overflow.
Let t be a turtle. For each t there exists a turtle k such that t is standing on k.