5 ms·
Really? I'd find it hard to believe that it isn't Turing complete. The only reason I can think of would be limits on nested functions or otherwise, but I dunno,
by nx 18y ago
Really? I'd find it hard to believe that it isn't Turing complete. The only reason I can think of would be limits on nested functions or otherwise, but I dunno, I've been googling around myself and some say it isn't.
Well, next thing to do: implement a Turing machine in Excel. Or Google Docs. I think I'm going for the latter.
Edit: Spreadsheets have no state. This is hard. If only I could delay evaluation :P
- gruseom 18y agoCan you email me about this? Address in profile.
- nx 18y agoOh, sure, I'll probably even start a blog out of this :P
- gruseom 18y agoWatch out, you're blowing your cover as lazy :)
- nx 18y agoWell this is just too interesting, and I should stop putting off this blog thing.
- gruseom 18y agoSo? What have you learned?
- nx 18y agoIt is possible, not specially hard, I implemented a Turing machine and a one-dimensional cellular automaton. You can program just about anything in a spreadsheet. I will later study the inner properties of the spreadsheet as a data structure and a programming paradigm.
- eru 18y agoAnother idea: Implement one-dimensional cellular automata in Excel. There are fairly simple Turing-complete ones.