|
|
|
|
|
|
by Ar-Curunir
1738 days ago
|
|
|
Mechanical computers approximate Turing Machines, just like NP approximates RE: instead of asking “does this program halt?”, we ask “does this program halt in N steps?”. If N is sufficiently (polynomially) large, the two are approximately equal. |
|
|
Yup, so do humans with paper and pencil.