|
|
|
|
|
|
by danielheath
1544 days ago
|
|
|
Taking infinite time to determine whether it halts is not considered a valid answer. When do you give up and decide it’s not going to terminate? Your answer will be wrong for any program which simply waits one second longer. |
|
|
a dripping faucet, for example - is it dripping at 10 drips per hour? or 5 drips per hour? did it stop dripping? no way to tell - the period between drops could be one moment longer than you observed - it could had dripped right after you stopped observing it.
this upper limit is called the busy beaver function. but it is only applicable to turing machines, which we don't build, because we don't have an infinite tape.