Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
throwingduck001
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
4 ms
·
1.
▲
by
throwingduck001
6y ago
Determining 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-complet