00:13:51 -!- Noisytoot has quit (Ping timeout: 245 seconds). 00:18:11 -!- monoxane0 has joined. 00:19:42 [[User:PixelatedStarfish]] https://esolangs.org/w/index.php?diff=89368&oldid=89305 * PixelatedStarfish * (+92) /* Unimplemented Languages */ 00:20:05 [[User:PixelatedStarfish]] https://esolangs.org/w/index.php?diff=89369&oldid=89368 * PixelatedStarfish * (+0) /* Unimplemented Languages */ 00:20:10 -!- monoxane has quit (Ping timeout: 260 seconds). 00:20:10 -!- monoxane0 has changed nick to monoxane. 00:20:37 [[User:PixelatedStarfish]] https://esolangs.org/w/index.php?diff=89370&oldid=89369 * PixelatedStarfish * (+15) /* In Chronological Order */ 00:22:02 -!- Lord_of_Life has quit (Ping timeout: 260 seconds). 00:23:25 -!- Lord_of_Life has joined. 00:27:41 -!- Noisytoot has joined. 00:39:19 -!- oerjan has joined. 01:10:58 Or, for a more mathematical argument, consider Underload without the ! and S primitives, which can't delete anything, but is still Turing-complete. <-- iirc the first proof i made in that section is pretty much the same kind of junk-based thing int-e gave for BCW (which i hadn't heard about) 01:11:18 except the junk is put on the stack 01:12:13 now i somewhat wonder if you could also apply the later "two ways of running a term, one of which self-deletes" method to BCW 01:13:24 *first such proof 01:54:47 oerjan: Smullyan's bird book talks about BCW, but I don't think it gives a full proof 01:56:26 it also doesn't tell whether it's Turing-complete – it only says that from the BCW basis you can get any lambda term of a certain form, namely one with applications only on variables inside the lambdas, and with all bound variables used at least once 01:56:59 all of that IIRC, I haven't checked the book even though it's within arm's reach of me 02:15:20 -!- delta23 has quit (Quit: Leaving). 02:28:21 -!- dbohdan3 has joined. 02:29:54 -!- dbohdan has quit (Ping timeout: 260 seconds). 05:13:51 -!- orin has quit (Quit: leaving). 05:14:50 -!- oren has joined. 06:01:03 Corbin: Here's a tested translation to BCWI: https://paste.debian.net/1218287/ 06:02:52 what I did yesterday was flawed... it's not really possible to extract all the garbage to the top level (some subterms may not even participate in the evaluation to head normal form). 06:04:45 But it's also simpler than what I tried yesterday in that application is actually translated as application. 06:06:42 (This relies on the = F G Y X that I spelled out yesterday.) 06:11:18 Anyway, I would be surprised if this kind of direct simulation of combinatory logic works for S. But I can't rule it out; lack of erasure simply isn't enough. 06:24:52 int-e: Very cool. 06:25:13 I still like my argument from last time about implementing S with S, but I'm not any closer to making it rigorous. 06:29:08 Oh the x z I I (y z g h) from [S] can be demystified using that pair identiy: it's equal to ( ) 06:29:57 where I, g, and h are garbage we don't care about. 06:51:01 -!- oerjan has quit (Quit: Nite). 06:55:40 https://www.youtube.com/watch?v=wJi0xeNI6ho 07:04:55 * int-e eyes that links suspiciously 07:06:02 "436,906 Hz redstone clock" hmm might actually be amusing 07:07:44 GoL has a similar thing where people searched for the fastest possible glider gun 07:12:05 cf. https://www.conwaylife.com/wiki/Period-14_glider_gun 07:12:56 successive gliders cannot be closer than 14 generations 07:12:58 COol 07:13:36 funny that you can inject with spaceships somehow 07:13:42 that there's enough space for that 07:49:54 [[GPTLang]] N https://esolangs.org/w/index.php?oldid=89371 * Hakerh400 * (+5240) Created page with "GPTLang is an esoteric programming language invented by the GPT neural netwrok.