3 ms·
Back in the 1980s I was taking a foundational computer science course in which we derived Goedel's result using Cantor diagonalization. Excellent course. We wer
by bregma 1y ago
Back in the 1980s I was taking a foundational computer science course in which we derived Goedel's result using Cantor diagonalization. Excellent course. We were watching the TV version of Hitchhiker's Guide to the Galaxy at the time, too. One day I had the realization that since any recursively enumerable function could be interpreted as a computer program (given the right interpreter), that the sweater I was wearing was in fact possibly a computer program, and that all knitting (and some crocheting) was in fact just a manifestation of code in another language.
I then went on to realize any enumerable set could be similarly interpreted, including the entire countable population of Earth. And we already had the answer (42), but what was the question?
- gwern 1y agoI suppose if nothing else, you could encode Wang tiles (https://en.wikipedia.org/wiki/Wang_tile https://en.wikipedia.org/wiki/Wang_tile) into knitting and then that's Turing-complete? Or would there be some better CA to encode?
- internet_rand0 1y agosorry, 42 is not gonna take us much farther 42 is a stand in for 41 and 43 which are some twin prime for me to further elaborate on this crazy idea that haunts me (I must admit I also haunt these ideas) requires a twin prime theorem which we are still waiting for in 2025....