throwingduck001·vor 5 Jahren·discussDetermining whether a Turing machine halts within k steps is computable: https://math.stackexchange.com/questions/3370296/halting-pro...If the number of steps is specified in unary, then the problem is NP-complete: https://www.ics.uci.edu/~eppstein/161/960312.html
If the number of steps is specified in unary, then the problem is NP-complete: https://www.ics.uci.edu/~eppstein/161/960312.html