[wgetch]

There is, perhaps surprisingly (or not), already a relevant XKCD mentioning this feature while poking fun at the computational abominations that were already possible in Excel:

https://xkcd.com/2453/

On that note, TFA claims that the introduction of LAMBDA finally makes Excel Turing complete, unlike the kind of Turing machine simulators the stick figure is referring to in the XKCD comic...

> (In contrast, Felienne Hermans’s lovely blog post about writing a Turing machine in Excel doesn’t, strictly speaking, establish Turing completeness because it uses successive rows for successive states, so the number of steps is limited by the number of rows.)

[maest]

To be fair, no computer is an actual TM since memory is finite.

[quonn]

It can pause and ask you to temporarily attach another hard disk. Could be infinite as long as one can afford buying disks.

[aidenn0]

Right, all computers have a bounded amount of state, so they can only parse regular languages.