3 ms·
3 is not necessary. OSes and linkers are not necessary. We did without for many years. The program should be in some kind of more-or-less addressable memory, t
by ncmncm 6y ago
3 is not necessary. OSes and linkers are not necessary. We did without for many years.
The program should be in some kind of more-or-less addressable memory, to support conditional branching. That's all.
- retrac 6y agoIt's not necessary in a strict theoretical sense to be Turing complete, yes. But in practice? Most of the magic of modern computing is in programs which can themselves manipulate, translate, and even write new programs. Nearly all we've built up depends on that. You can only get so far in practice by flipping switches to encode binary numbers.
- twic 6y agoNo you didn't. You can't even write a bootloader without 3. All practical computers have always had 3.
- ncmncm 6y agoYou reveal that you have never programmed a microcontroller. Most do not have an OS, and cannot run the compiler used to program them. Yet, they are practical: the world would grind to a stop if they vanished. Most today are far more powerful than any among the whole first decade of practical computers. Those ran compilers in as little as 4k words of memory. The output of the compiler was not written to memory; it was punched directly to tape or cards. (On some, it physically could not be written to program memory, even if there were room: no bus connected to there.) The tape was later read into program memory--often onto a spinning magnetic drum--and executed directly, no OS in sight. If you imagine these were not practical computers, consider that people paid $millions for them; they earned their keep. Have you ever operated a computer doing work worth that much?