The limit of "Must run infinitely" will basically wreck any computer that will fit in this universe, won't it?
EDIT: Thanks for correction to rule 110
https://ogiekako.vercel.app/blog/find_mkdir_tc
https://news.ycombinator.com/item?id=41115941
They also updated their proof (not saying whether it's valid or not, just updated):
On a given implementation of C, a pointer has some specific size (let's call it S). This means that we can address 2^S bytes of memory. Each byte has CHAR_BIT bits, so can be in 2^CHAR_BIT states, meaning we have 2^(S + CHAR_BIT) possible states memory can be in. Since there's a finite number of states, it's not a Turing machine.
> fpos_t is a complete object type other than an array type capable of recording all the information needed to specify uniquely every position within a file.
[7.23.1p3 of N3054 working draft of C2x, as that's what I have open right now.]
`socket()` has entered the conversation.