> Nand to Tetris courses are taught at 400+ universities, high schools, and bootcamps. The students who take them range from high schoolers to Ph.D. students to senior engineers. Here is an extended syllabus of a typical academic-version course.
> What is the computational complexity of Tetris with ARM instructions?
If it is Turing complete it is undecideable. If the user only builds programs that halt, is Teris with ARM instructions of the complexity class NEXPTIME-complete (which is harder than NP-Complete)?
> Nand to Tetris courses are taught at 400+ universities, high schools, and bootcamps. The students who take them range from high schoolers to Ph.D. students to senior engineers. Here is an extended syllabus of a typical academic-version course.
There's now a schema.org/Syllabus Class .
> Similar: "Show HN: Tetris, but the blocks are ARM instructions that execute in the browser" https://news.ycombinator.com/item?id=37086102
What is the computational complexity of Tetris with ARM instructions?
In ASM;
Rosetta Code > Tetris: https://rosettacode.org/wiki/Tetris :
> tetromino.py - Python implementation of Tetris included with Raspbian