Re:Accidentally Turing-Complete
by Dylan16807 on Friday April 24, 2020 @05:39PM
(#22973200)
I wasn't talking about your argument that the calculation is finite. I was talking about how N is chosen in the first place.
This is backwards; I meant that if you have any time bound whatsoever, the number of inputs you can inspect is limited to (a architecture-specific finite multiple of) the number of operations you can execute (because inspecting a input is such a operation).