But if you do, and take unreflectedly the results of computer science about computability for granted, you may get wrong conclusions.
I don't simply take results from CS without some reflections on how they work in a physically limited turing machine, that would be silly, so my conclusions are usually right.
Re:Linux on an 8-bit microcontroller
by smitherfield on Monday December 04, 2017 @12:25PM
(#15845566)
Computers are still universal Turing machines because an infinite-tape computation[1] can be subdivided into an infinite sequence of finite-tape computations.
[1] Meaning a computation using an arbitrarily-long tape, since by definition a computation is finite or its result is undefined.
Personally, I think that is sufficient to call something a Turing machine even if it has limited resources in reality. After all you can't have infinite tape.