Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Right, my comment was the other way around; I don't know whether infinite Tetris is Turing complete.


Running a Turing machine reduces to Post's correspondence problem (which the paper shows reduces to answering some peculiar questions about Tetris).




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: