4 ms·
They need to know the input length too. With an infinite input it will never halt.
by IshKebab 5y ago
They need to know the input length too. With an infinite input it will never halt.
- mathematically 5y agoYes, that's the usual assumption when working with Turing machines and proofs. But I guess you could also allow infinite inputs and it wouldn't make that much difference, e.g. computing exp(x) for some real x as input.