[jylam]

That's basically the concept of Turing Completeness. Any Turing complete system can run anything. It may be very slow, but it will run. ChatGPT could run on a 4004, all you need is time.

[pclmulqdq]

A computer is technically not a Turing machine due to the lack of infinite RAM. It is a finite state machine with an absurdly large state space.

[johnklos]

I've always interpreted the definition of storage as arbitrarily large, not specifically infinite. The universe, after all, is finite. The "well, acshually" arguments aren't interesting, because they're 100% abstract.

[brudgers]

Because it has infinite RAM, technically the Turing machine is not a machine.

[tcbawo]

Can’t any computer with external connectivity (ie serial or network connectivity) be considered to have infinite memory?

[brudgers]

That's basically the concept of Turing

Tarpit,

where everything is possible but nothing of interest is easy.

https://en.m.wikipedia.org/wiki/Turing_tarpit

[byteknight]

And a gargantuan amount of RAM.

[qwerty456127]

https://cs.stackexchange.com/a/60978

[jojobas]

>all you need it time

Like geological time.

[johnklos]

Dmitry talks about compiling the kernel in years. While I haven't done that, I have built NetBSD-vax and NetBSD-mac68k natively on a VAXstation 4000/60 and on a Mac Quadra 610. It's on the scale of multiple months instead of years, but it's enough to give me a feel for it.