00:12:03 [wiki] [[Enema]] M https://esolangs.org/w/index.php?diff=51720&oldid=34549 * Xav737 * (+17) 00:13:12 YAY~ 00:13:22 `? sphere 00:13:23 sphere? ¯\(°_o)/¯ 00:14:33 -!- yabi has joined. 00:24:11 -!- yabi has quit (Quit: Leaving). 00:30:08 -!- boily has quit (Quit: WATERFALL CHICKEN). 01:04:22 <\oren\> TIL the japanese counter 匹 can be used for cerberuses if they're cute enough 01:14:46 -!- augur has joined. 01:31:52 -!- oerjan has joined. 01:35:40 @messages-flow 01:35:40 Unknown command, try @list 01:35:49 darn 01:36:06 @messages-mould 01:36:06 boily said 7h 9m 4s ago: hellørjan. the youtubal “(11)” comes from the eleven video notifications I seem to have cumulated by not watching them. 01:37:05 -!- sleffy has quit (Ping timeout: 255 seconds). 01:44:01 -!- xkapastel has quit (Quit: Connection closed for inactivity). 01:58:54 Maybe it'd be better if I wasn't here. <-- you appear to be in an evil circle of posturing, complaining and self-deprecation, which paradoxically are the main annoyances from you on the channel. 02:05:50 otherwise, i've read that creativity only works properly when you're doing it for your own interest, and not to get confirmation from others. _most_ esolangs don't get much response here, anyway. 02:08:51 -!- sleffy has joined. 02:11:33 `? caine 02:11:34 Caine is a drug administered to the target to reverse the effects of other drugs. 02:12:31 *sigh* 02:13:52 `url 02:13:53 https://hackego.esolangs.org/fshg/ 02:14:08 `learn Caine is a target administered to the drug to reverse the effects of other drugs. 02:14:10 Relearned 'caine': Caine is a target administered to the drug to reverse the effects of other drugs. 02:14:28 still not good, but at least slightly less misrepresenting co- 02:14:52 Oh, I thought it was about iocaine powder. 02:15:06 Still not good. 02:15:30 Just look at those last few days of edits. 02:15:57 could do a b_jonas and insert a Vampire: The Masquerade reference instead. 02:16:08 shachaf: DON'T WANNA 02:16:26 except i've never actually played it. 02:17:13 could revert a few daysworth of edits in one command 02:18:00 seems a bit brutal. 02:18:10 especially after my tirade above. 02:18:40 maybe just `revert 1 02:18:45 `wisdom 02:18:46 natural transformation//A natural transformation is a transformation of something containing no chemicals. 02:18:51 `5 w 02:18:57 1/2:plan9//Plan9 is the precursor to Dante's Inferno, home of the Limbo programming language. \ poutine//Poutine was Pouti and boily's sister until the tragic cheese accident. \ war//A lot more young people have gone off to fight in this war than I would have, at that age. \ jwinslow23//JWinslow23 is not here. \ disflagrate//disflagrate v 02:19:06 `n 02:19:07 2/2:.t.perf.: a traditional technique from Poland (earliest attestation c. 1042) used to separate szoups. Nowadays, commercial production is entirely mechanized. 02:19:28 i,i what's quote 1042 doing in the wisdom database? 02:19:43 `# Indeed not//`forget jwinslow23 02:19:45 Forget what? 02:20:07 `quote 1042 02:20:09 1042) kmc: you gotta tell me if you're an op 02:20:29 i think kmc deopped himself. 02:21:11 `5 w 02:21:16 1/3:watch//Too late! \ clever//Being clever is different from being wise, but they are indistinguishable in sufficiently large quantities. \ works for me//Error: unable to read wisdom database. try again later. \ orodruin//The Orodruin is a mountain heated by earth spirits. Sauron moved to Mordor because boiling water for his morning tea 02:21:19 `n 02:21:20 2/3:with the fires of the Orodruin was so convenient. \ sock//Socks are alien larvas planning to take over Earth. They started to teleport into Earthly washing machines through miniature wormholes. The invasion is currently halted, because after 4 billion larvas, they ran out of address space. They are also a protocol for proxying TCP con 02:21:22 `n 02:21:23 3/3:nections. 02:21:53 *into* washing machines? 02:22:01 seems contrary to my experience hth 02:22:04 `cwlprits sock 02:22:13 b_jonäs 02:22:35 i recall a relevant short story. 02:23:36 shachaf: nah you just notice half of a pair is missing... but are you sure there _was_ a pair... 02:24:23 hm i think there was a youtube performance of it 02:24:27 oerjan: For a while I only had one kind of sock. 02:24:44 All my socks were of that type so I could pair any of them together. It was great. 02:24:49 Now I only have one sock of that type left. 02:24:51 I had dozens! 02:24:55 Where did they go? 02:25:20 Now I only wear my emergency socks, which I got from Google Summer of Code. 02:25:24 They're called GSoCs. 02:25:26 i have noticed that occasionally socks start getting swallowed by holes hth 02:25:46 * oerjan Gswats shachaf -----### 02:26:00 <\oren\> `widsom 02:26:13 oerjan: You should gswat the GSoC organizers instead. 02:26:15 They made the socks. 02:26:17 OKAY 02:26:34 ANY GSoC ORGANIZERS HERE? 02:26:41 nope 02:26:45 OKAY 02:26:51 <\oren\> `widsom 02:26:52 remava//His typing skills are so bad, some say he writes in a different orthography, not back-compatible with English. 02:26:56 unless fizzie secretly is 02:27:01 <\oren\> `widsom 02:27:02 ¯\_(ツ)_/¯//¯\_(ツ)_/¯ is the ¯\(°_o)/¯ of urbandictionary 02:27:07 `dowg remava 02:27:08 <\oren\> `widsom 02:27:09 tanstaaha//tanstaaha, so please stop using them. That would help. 02:27:15 10668:2017-04-15 learn_append remavas His typing skills are so bad, some say he writes in a different orthography, not back-compatible with English. 02:27:34 huh weird. oh. 02:27:44 <\oren\> `widsom 02:27:45 firefly//FireFly was a short-running but well-loved sci-fi TV series released in 2003, starring Nathan Fillion and directed and written by Joss Whedon. 02:27:46 `? remavas 02:27:47 Remavas is a revolution in human biology. He's cofriends with oerjan. He's apparently from Frankfurt, Germany, but he's actually from Mars. His typing skills are so incredibly bad, some say he writes in a different orthography designed for a different language. 02:28:02 `forget remava 02:28:04 Forget what? 02:28:23 (mistake) 02:28:37 <\oren\> `widsom 02:28:38 ehlist//ehlist is update notification for the Everyday Heroes webcomic. http://eheroes.smackjeeves.com/ 02:28:42 <\oren\> `widsom 02:28:44 ham//Ham is a kind of meat. It is popular in Hexham, among other places. 02:30:37 `cat bin/widsom 02:30:38 f=$(find wisdom -ipath "wisdom/*$1*" -type f -print0 | shuf --random-source=/dev/urandom -z -n1); if [ -n "$f" ]; then echo -n "${f#wisdom/}//"; cat "$f"; else echo "That's not wise."; fi | rnooodl 02:31:13 `` ls -l bin/widsom 02:31:14 lrwxrwxrwx 1 5000 0 6 Oct 28 18:37 bin/widsom -> wisdom 02:31:57 Am not. 02:32:23 Haven't even gotten any free socks. 02:33:27 `doag bin/widsom 02:33:42 8635:2016-06-28 ` ln -s wisdom bin/widsom 02:34:59 Hmm, is fizzie the only Google employee here? 02:35:02 There used to be lots. 02:36:03 `` rm bin/widsom;; mkx 'bin/widsom//wisdom "$@" | sed '"'"'s/\<$[^ ][^ ]$$[^ ]$$[^ ]$/\1\3\2/g'"'" 02:36:04 /hackenv/bin/`: eval: line 4: syntax error near unexpected token `;;' \ /hackenv/bin/`: eval: line 4: `rm bin/widsom;; mkx 'bin/widsom//wisdom "$@" | sed '"'"'s/\<$[^ ][^ ]$$[^ ]$$[^ ]$/\1\3\2/g'"'"' 02:36:10 argh 02:36:18 `ls bin/widsom 02:36:19 bin/widsom 02:36:24 `rm bin/widsom 02:36:26 No output. 02:36:54 `mkx bin/widsom//wisdom "$@" | sed 's/\<$[^ ][^ ]$$[^ ]$$[^ ]$/\1\3\2/g' 02:36:55 bin/widsom 02:36:59 `widsom 02:37:00 biycclic moonid//The biycclic moonid is the free moonid geenrated by two wheels of a biyccle, qutoiented by the retsriction thta the biyccle iteslf is eqaul to the idnetity. 02:38:59 oh it was just the ;; 02:39:03 (maybe) 02:40:07 <\oren\> `biycclic moonid 02:40:08 /home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: biycclic: not found 02:40:12 <\oren\> `? biycclic moonid 02:40:12 -!- augur has quit (Remote host closed the connection). 02:40:13 biycclic moonid? ¯\(°_o)/¯ 02:41:14 <\oren\> `? bicyclic monoid 02:41:15 The bicyclic monoid is the free monoid generated by two wheels of a bicycle, quotiented by the restriction that the bicycle itself is equal to the identity. 02:41:40 <\oren\> `widsom 02:41:41 \//\ was intiially pouplar as a relpacement for the soildus, but inveitably three was a bakcslash. 02:41:58 <\oren\> `widsom 02:42:00 dwof//DWOF is the Dotcor Who Fan Orhcestra, g. 02:42:14 <\oren\> `widsom 02:42:16 prceious//prceious? Thta dosen't rign a bell. ¯\(°_o/)¯ 02:52:25 -!- augur has joined. 02:57:02 -!- augur has quit (Ping timeout: 260 seconds). 03:03:57 `? cofriends 03:03:58 cofriends? ¯\(°_o)/¯ 03:04:26 `? cofree 03:04:27 cofree? ¯\(°_o)/¯ 03:04:54 `` ls wisdom/co* 03:04:55 wisdom/cocoa \ wisdom/cocoon \ wisdom/cocoonspirator \ wisdom/cod \ wisdom/code \ wisdom/codensity \ wisdom/codependency \ wisdom/codo \ wisdom/codoctor \ wisdom/coffee \ wisdom/cofridge \ wisdom/color \ wisdom/colour \ wisdom/comedogenic \ wisdom/comics \ wisdom/comonad \ wisdom/companion cube \ wisdom/compiler \ wisdom/complete heyting algebra \ 03:05:32 `? cofridge 03:05:34 Cofridges are ovens or stoves that are disrespectful towards entropy. They are useful for postparing ffee and oking cofood. 03:06:17 `le/rn cofridge logic//Cofridge logic is the new HoTT stuff. 03:06:19 Learned 'cofridge logic': Cofridge logic is the new HoTT stuff. 03:09:46 `? caloric 03:09:48 caloric? ¯\(°_o)/¯ 03:09:58 `? mpiler 03:09:59 mpiler? ¯\(°_o)/¯ 03:10:19 `le//rn mpiler//An mpiler takes an executable file and nverts it to readable form. 03:10:22 Learned 'mpiler': An mpiler takes an executable file and nverts it to readable form. 03:13:50 `le//rn nvert//To nvert something is to revert it back to its previous form, while recording the reversion as a conversion in itself. 03:13:52 Learned 'nvert': To nvert something is to revert it back to its previous form, while recording the reversion as a conversion in itself. 03:13:55 `? undo 03:13:56 undo? ¯\(°_o)/¯ 03:14:10 `? cododo 03:14:11 cododo? ¯\(°_o)/¯ 03:14:17 `? mpanion cube 03:14:18 mpanion cube? ¯\(°_o)/¯ 03:14:22 `? companion cube 03:14:23 There's cake inside it. Tear it apart, rip open your companion, and extract the delicious, delicious cake... 03:14:54 `le//rn mpanion cube//Aperture Science has created a talking cube - we call it the mpanion cube, because it's the opposite of the mute companion cube. 03:14:56 Learned 'mpanion cube': Aperture Science has created a talking cube - we call it the mpanion cube, because it's the opposite of the mute companion cube. 03:15:06 `? de 03:15:07 de? ¯\(°_o)/¯ 03:15:10 `? code 03:15:11 [11,11,11,15,15,23,12],[5,5,5,3,53,45,16,26,00,20,15,16,22,25,45,91,32,11,15,27,06,01,11,01,47,22,30,13,43,21,11,13,29,61,65,17,19,12,28,17,11,01,23,20,16,20,81,18,32,25,58,22.,1985,10.301350435,1555466973690094680980000956080767,13720946704494913791885940266665466978579582015128512190078... 03:15:32 `le//rn de//De is the counterpart to code, often called the header. 03:15:35 Learned 'de': De is the counterpart to code, often called the header. 03:18:46 -!- erkin has quit (Quit: Ouch! Got SIGABRT, dying...). 03:34:09 -!- augur has joined. 03:38:11 -!- Zarutian has quit (Quit: Zarutian). 03:38:43 -!- augur has quit (Ping timeout: 240 seconds). 04:11:43 ^ul (a)(!())(()~(:))~:(^!!())*~(*)~^** 04:11:49 ^ul (a)(!())(()~(:))~:(^!!())*~(*)~^**S 04:11:49 ()~(:)!()^!!() 04:12:10 hm something went wrong. 04:12:12 -!- augur has joined. 04:12:17 ^ul (a)()(()~(:))~:(^!!())*~(*)~^**S 04:12:17 ()~(:)^!!()* 04:13:07 oh right 04:13:20 ^ul (a)(!())(()~(:))~:(^!!())*~(*)~^**^S 04:13:26 ^ul (a)(!())(()~(:))~:(^!!())*~(*)~^**^aS 04:13:26 () 04:13:32 ^ul (a)()(()~(:))~:(^!!())*~(*)~^**^aS 04:13:32 () 04:13:36 ^ul (a)(:*)(()~(:))~:(^!!())*~(*)~^**^aS 04:13:37 (a) 04:13:43 ^ul (a)(::**)(()~(:))~:(^!!())*~(*)~^**^aS 04:13:43 (aa) 04:16:29 -!- augur has quit (Ping timeout: 252 seconds). 04:17:16 -!- furozo has joined. 04:19:03 -!- furozo has quit (Client Quit). 04:31:02 for learn_append you have to omit the // <-- there's `le/rn_append which works more like `le/rn. 04:32:23 oh you did use that later 04:32:31 argh food 04:33:23 `? whatever 04:33:24 42! 04:33:27 `? answer 04:33:28 42. 04:33:40 `` forget whatever; forget 42 04:33:43 Forget what? \ Forget what? 04:33:44 oops 04:33:48 `revert 04:33:49 Done. 04:33:55 `` forget whatever; forget answer 04:33:57 Forget what? \ Forget what? 04:34:00 `? 42 04:34:01 42 is The Answer. Heed it. 04:35:56 `? factorial 04:35:58 Factorials are factories that factor many integers together to rdocscover more long ints. The answer to life, the universe, and everything is frequently purported to be 42, but it is actually 42 factorial (42!). 04:36:32 * oerjan shouldn't do wisdom judgements when hungry 04:36:37 `forget factorial 04:36:39 Forget what? 04:36:57 so i'll leave that to my apprentice. 04:37:49 no, i'm retired hth 04:38:01 darth oerjan can find a new apprentice 04:39:07 <\oren\> `wisdom 04:39:09 gostak//The gostak distims the doshes. 04:42:11 `5 w 04:42:16 1/2:homophone//Homophones are pairs of words that sound totally gay together. \ pineapple//Pineapple is a hybrid species descended from a cultivar of spinach and wild ivy, making it a class 6 vegetable. \ c//C is the language of��V�>WIד�.��Segmentation fault \ skeleton//A skeleton is an unintelligent undead, similar to the zo 04:42:19 `n 04:42:20 2/2:mbie but harder to create, because it's lacking most of the body. The best skeletons are made by groups of people, so-called skeleton crews. \ chuchichäschtli//chuchichäschtli is spoken as [ˈχʊχːiˌχæʃːtli] 05:02:12 -!- Warrigal has joined. 05:02:30 -!- Warrigal has changed nick to tswet_t. 05:02:59 So here's the real question. 05:03:25 Consider the function f(n) = the nth positive integer which is not a counterexample to the Collatz conjecture. 05:03:47 Of course, the Collatz conjecture itself is equivalent to the statement that for all n, f(n) = n. 05:03:57 k 05:03:59 But... 05:04:18 Do we even know that f grows at most polynomially? 05:05:02 hm... 05:05:29 It definitely grows at most exponentially, because all powers of 2 are non-counterexamples. 05:05:44 twice a counterexample is a counterexample. 05:05:53 Right. 05:06:45 Maybe all non-counterexamples can be written in the form a*2^b, where a is one of some given set of constants. 05:06:52 nah 05:07:02 Nah, that doesn't sound very possible. 05:09:17 @bots 05:09:17 :) 05:09:45 > iterate (\x -> if x `mod` 6 == 4 then (x - 1) `div` 3 else 2 * x) 1 05:09:47 [1,2,4,1,2,4,1,2,4,1,2,4,1,2,4,1,2,4,1,2,4,1,2,4,1,2,4,1,2,4,1,2,4,1,2,4,1,2... 05:09:53 if x == 1 (mod 3), then (x-1)/3 is also a counterexample. 05:10:05 oh wait 05:10:10 > iterate (\x -> if x `mod` 6 == 4 then (x - 1) `div` 3 else 2 * x) 3 05:10:12 [3,6,12,24,48,96,192,384,768,1536,3072,6144,12288,24576,49152,98304,196608,3... 05:10:36 > iterate (\x -> if x `mod` 6 == 4 then (x - 1) `div` 3 else 2 * x) 5 05:10:37 x == 4 (mod 6), it should be. 05:10:38 [5,10,3,6,12,24,48,96,192,384,768,1536,3072,6144,12288,24576,49152,98304,196... 05:10:44 Hmmm. 05:11:06 Conjecture: this sequence always reaches a multiple of 3? 05:11:10 > iterate (\x -> if x `mod` 6 == 4 then (x - 1) `div` 3 else 2 * x) 7 05:11:12 [7,14,28,9,18,36,72,144,288,576,1152,2304,4608,9216,18432,36864,73728,147456... 05:11:24 *shrug* 05:11:33 i am thinking that the 3*x+1 paths in reverse should be enough to fill it out to polynomial. 05:11:52 but unlike the doubling, they have modulus requirements. 05:13:21 gah an annoying sound driving me crazy again 05:15:39 Aha... 05:15:43 https://en.wikipedia.org/wiki/Collatz_conjecture#Rigorous_bounds 05:15:57 "Although it is not known rigorously whether all positive numbers eventually reach one according to the Collatz iteration, it is known that many numbers do so. In particular, Krasikov and Lagarias showed that the number of integers in the interval [1,x] that eventually reach one is at least proportional to x^0.84." 05:16:34 I'm pretty sure that means that, say, n^2 is an upper bound on f(n). 05:17:39 But it apparently we don't actually know that fewer than 100% of all numbers are counterexamples. 05:19:48 hm ok so you need to avoid numbers divisible by 3, because they're inverses never branch out. 05:20:00 *their 05:22:44 6*x+4, 24*x+16 and 96*x+64 become 2*x+1, 8*x+5 and 32*x+21. 05:23:09 is one of those guaranteed to be not divisible by 3... 05:23:59 2*x+1 == 0 (mod 3) => 8*x == -4 (mod 3), so yeah. 05:24:32 so you can always branch out some, as long as you don't hit something divisible by 3. 05:27:00 => 32*x == -16 == -1. 05:27:16 I wonder if Krasikov and Lagarias just discovered an extension of what we're talking about now. 05:27:25 Or maybe they discovered *only* what we're talking about now. 05:27:45 heh 05:28:18 it seems like 2 out of 3 of them will go down to something not divisible by 3. 05:32:31 hmm 05:32:51 well they'd presumably try to improve the exponent. 05:33:16 but i think this is enough to ensure polynomiality. 05:35:54 you can divide up cases into (mod 18) classes, i think, and all that aren't divisible by 3 will branch out in bounded time. 05:37:24 18*x+1 -> 36*x+2 -> 72*x+4 -(1)> 24*x+1 -(2)> 144*x+8 05:38:49 with the last one branshing again after a step, i think 05:39:57 288*x+16 -(3)> 96*x+5 -(4)> 576*x+32 05:41:36 1->2->4->branch/8->16->branch/32==14 05:43:39 ->28==10 which is one of those that goes to divisible by 3 if you branch. 05:45:53 hm, in fact the only one. 05:46:16 because 4, 10 and 16 are the only branch points (mod 18) 05:49:53 ending up at 1, 3 and 5 (mod 6) 05:51:53 2->4->8->16->14->10->2 and 6->12->0 05:52:24 so 2 branches every 6 doublings 05:58:13 `? overflow 05:58:14 Overflow is a phenomenon that occurs when too much water pours into the inner mechanics of a hydrocomputer. 05:59:37 -!- tswet_t has quit (Ping timeout: 260 seconds). 06:01:25 `slwd overflow//s,mechanics,tanks,;s,ro,raulic, 06:01:27 overflow//Overflow is a phenomenon that occurs when too much water pours into the inner tanks of a hydrauliccomputer. 06:01:30 oops 06:01:45 `slwd overflow//s,lic,& , 06:01:46 overflow//Overflow is a phenomenon that occurs when too much water pours into the inner tanks of a hydraulic computer. 06:02:17 rdococ: that was a good one but it needs more authentic terminology. 06:05:43 -!- sleffy has quit (Ping timeout: 240 seconds). 06:06:14 also, https://en.wikipedia.org/wiki/MONIAC 06:08:29 -!- sleffy has joined. 06:14:07 `slwrjan sl[ick]navel\darthl 06:14:08 /home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: slwrjan: not found 06:14:24 `swrjan sl[ick]navel\darthl 06:14:26 oerjan//Your omnipheasant principal witty arrant darth oerjan the indecisive is a hazy expert in merry compaction. Also a Glaswede who disses Roald Dahl. He could never render the word "amortized" so he put it here for connivance. His arch-nemesis is Betty Crocker. He twice punned without noticing it. 06:14:48 ick? 06:15:37 that's not a good darth name, it means nothing when prepending in-! 06:17:01 oerjan the darth decisive 06:20:37 `swrjan s,swede,neep, 06:20:39 oerjan//Your omnipheasant principal witty arrant darth oerjan the indecisive is a hazy expert in merry compaction. Also a Glaneep who disses Roald Dahl. He could never render the word "amortized" so he put it here for connivance. His arch-nemesis is Betty Crocker. He twice punned without noticing it. 06:29:39 gcd minBound 0 06:29:45 > gcd minBound 0 06:29:47 error: 06:29:47 • Ambiguous type variable ‘a0’ arising from a use of ‘show_M101340286925... 06:29:47 prevents the constraint ‘(Show a0)’ from being solved. 06:29:55 wat 06:30:13 > gcd minBound 0 :: Integer 06:30:16 error: 06:30:16 • No instance for (Bounded Integer) 06:30:16 arising from a use of ‘minBound’ 06:30:18 > gcd minBound 0 :: Int 06:30:20 -9223372036854775808 06:30:31 :t gcd 06:30:33 Integral a => a -> a -> a 06:30:45 why in the world did that not default? 06:30:56 :t gcd minBound 0 06:30:57 (Bounded a, Integral a) => a 06:32:07 hm same in ghci 06:32:25 oh hm 06:32:48 it's because there's no actual _bounded_ numeric type to default to. 06:33:48 > abs minBound :: Int 06:33:50 -9223372036854775808 06:34:05 * oerjan did not know this. 06:35:18 > signum minBound :: Int 06:35:20 -1 06:35:33 AAAAAAAAAAA 06:36:04 > minBound`div`(-1) :: Int 06:36:07 *Exception: arithmetic overflow 06:37:37 [wiki] [[Special:Log/newusers]] create * Fractalwizz * New user account 06:47:11 `? hydrocomputer 06:47:12 Hydrocomputing is the field of computer programming which studies the computational power of water. 06:47:37 `grwp ydr 06:47:52 nu wat 06:47:59 alg. ii:Algae II, the successor class to Algae I. Discusses hydroponics and such. \ b_jonas can't spell:b_jonas can't spell these words: weird, hygiene, etymology, mysterious, Odyssey, myopia, carbohydrate, appearance, maintenance, existence, heard, appropriate; and confuses these sets of words: then, than; drought, draught/draft; couch, coach; dep 06:48:09 `2 grwp ydr 06:48:11 2/4:ch, coach; depreciate, deprecate; dilate, dilute, delate; contiguous, continuous. \ hydra:http://www.madore.org/~david/math/hydra0.xhtml , dire: http://www.madore.org/~david/math/hydra.xhtml , theory: http://www.madore.org/~david/weblog/d.2008-03-27.1537.html http://www.madore.org/~david/weblog/d.2008-03-16.1534.ordinaux-et-hydres.htm 06:48:33 `n 06:48:34 3/4:l http://math.andrej.com/2008/02/02/the-hydra-game/ https://en.wikipedia.org/wiki/Goodstein%27s_theorem \ hydrocomputer:Hydrocomputing is the field of computer programming which studies the computational power of water. \ hydrogen:Hydrogen is what stars are made of. There's a conjecture that at the immense pressures inside Jupiter or 06:48:42 `n 06:48:43 4/4:Saturn, hydrogen might form a superconducting liquid metal. \ overflow:Overflow is a phenomenon that occurs when too much water pours into the inner tanks of a hydraulic computer. 06:50:21 `` grwp -i -l turing 06:50:22 bitcoin \ bogosort \ church \ linker \ post-turing machine \ rice \ tg \ turing \ turing complete \ wealhtheow 06:50:53 `` cd wisdom; echo *uring* 06:50:54 metaturing post-turing machine turing turing complete 06:51:08 `? turing complete 06:51:10 You complete a Turing when you Tur by a specified amount. 06:51:16 acceptable. 06:51:47 is it really hth 06:51:56 `? turing 06:51:57 Turing is what you are doing when you Tur 06:52:13 it builds on previous work 06:52:28 `slwd turing//s,$,., 06:52:29 turing//Turing is what you are doing when you Tur. 06:53:17 ture eonugh 06:53:26 but it doesn't work 06:53:37 nor was the previous work especially wise 06:54:25 `? metaturing 06:54:26 This wisdom entry was crushed by a falling anvil. 06:58:55 `? binary tree 06:58:56 A binary tree is an economical design for a computer built into a tree. 06:59:07 `forget binary tree 06:59:08 Forget what? 06:59:12 THAT MAKES NO SENSE 06:59:44 nor does it contain a joke that i could discern. 07:00:09 gibberish pibberish 07:01:00 `? pointer 07:01:01 A pointer is someone who points, usually towards someone or something else. 07:01:29 `forget pointer 07:01:30 Forget what? 07:02:00 `? null pointer 07:02:01 A null pointer is a chronic disease which mostly plagues Java. 07:05:37 `learn A pointer is a dog bred to follow instructions. 07:05:39 Learned 'pointer': A pointer is a dog bred to follow instructions. 07:06:41 -!- erkin has joined. 07:13:43 `le/rn null pointer//Null pointers were invented despite having no reason to exist. 07:13:46 Relearned 'null pointer': Null pointers were invented despite having no reason to exist. 07:35:18 -!- sirnaysayer has quit (Ping timeout: 255 seconds). 07:38:33 -!- sleffy has quit (Ping timeout: 258 seconds). 07:38:53 -!- erkin has quit (Quit: Ouch! Got SIGABRT, dying...). 07:41:32 `le/rn null pointer//Null pointers were bred to be more exceptional than other pointers. However, the whole effort went nowhere. 07:41:34 Relearned 'null pointer': Null pointers were bred to be more exceptional than other pointers. However, the whole effort went nowhere. 07:44:55 -!- sirnaysayer has joined. 07:46:28 hmph my golf design seems thwarted by the fact >>= contains an = character 07:47:12 What golf design is that? 07:47:15 so it's in a bind 07:49:10 * oerjan feels secretive 07:49:40 -!- sirnaysayer has quit (Ping timeout: 258 seconds). 07:52:02 -!- sirnaysayer has joined. 07:55:27 > "this is a demonstration"<$id>>=flip id$words 07:55:30 ["this","is","a","demonstration"] 07:56:17 zzo38: for quining purposes, i need a way to use the contents of a string that is at the beginning of a standalone expression. 07:56:52 with no imports or other top level definitions. and the only ways i have found to that involve using the >>= operator. 07:56:56 *to do that 07:57:33 ok, there's also a very theoretical way of using `lookup`, if you don't mind waiting until the heat death of the universe. 07:57:57 this one goes to 11 07:58:00 @where pi_11 07:58:00 [show(foldr(\k a->20*100^n+a*k`div`(2*k+1))0[1..[4,8..]!!n])!!n|n<-[0..]] 07:58:13 @where pi_10 07:58:13 (!!3)<$>transpose[show$foldr(\k a->2*10^2^n+a*k`div`(2*k+1))0[1..2^n]|n<-[0..]] 07:59:23 however, there are also character restrictions and it would have been better if i could do this without using the = character. 07:59:38 of course my design is nowhere near fleshed out yet. 08:13:42 -!- AnotherTest has joined. 08:23:16 speaking of golf, I can't seem to find any chess player with readable source 08:24:38 debian's default is “fairymax”, which turns out to be a golfed C program 08:25:48 gnuchess 6 is actually the fruit engine with some extra code added to make it backwards compatible with gnuchess 5 08:27:26 The best chess AI seems to be Stockfish, although I have not seen the code so do not know how readable they are. I also do not know if it is what you are looking for, or if you need xboard protocol, or whatever 08:27:51 (Stockfish uses UCI protocol instead, I think?) 08:28:05 (except some of the old gnuchess 5 code remains, like vestigial wisdom teeth) 08:31:14 crafty's code is haughtily idiosyncratic, like the crafty.c which #includes all 40 thousand lines of the program into one unit 08:34:48 I also suspect that most engines handle 50-move somewhat incorrectly, which only manifests when the threshold is reduced to 1 08:36:43 for example, it looks like crafty knows how to claim the draw after its own move (by FIDE rules), but its search only checks the condition at the beginning of a move 08:45:25 zzo38: I'll look at it; however if the engine is too optimised, it will be harder to adapt to a chess variant 09:01:58 -!- oerjan has quit (Quit: Nite). 09:38:45 ^style irc 09:38:46 Selected style: irc (IRC logs of freenode/#esoteric, freenode/#scheme and ircnet/#douglasadams) 09:44:32 fungot: are you bored? 09:44:32 Jafet: a basic knowledge plus flood reading is better than 3 2 09:48:33 -!- Remavas__ has changed nick to Remavas-Hex. 09:51:36 -!- Remavas has joined. 09:53:11 -!- dingbat has quit (Quit: Connection closed for inactivity). 10:13:15 Wow, stockfish code is surprisingly readable. 10:17:42 (Though that's not saying much about the difficulty of actually changing it; the bitboard representation, for example, (and not surprisingly) is accessed all over the place in the evaluation function. (and I finally got why popcnt is so useful for chess engines... obvious in retrospect, hmm)) 10:57:12 on another golf topic, it seems that chess programmers are actively looking for magic hash functions http://chessprogramming.wikispaces.com/Magic+Bitboards 10:58:50 > "<$id>>=flip id$text.(>>=id)((++).show)"<$id>>=flip id$text.(>>=id)((++).show) 10:58:52 "<$id>>=flip id$text.(>>=id)((++).show)"<$id>>=flip id$text.(>>=id)((++).show) 10:59:27 * int-e wonders what other dirty trick oerjan has up his sleeves 11:01:11 but perhaps that's it, with s/text/putStr/ 11:01:17 err, .../g 11:03:47 > let putStr = text in "<$id>>=flip id$putStr.((++).show>>=id)"<$id>>=flip id$putStr.((++).show>>=id) 11:03:49 "<$id>>=flip id$putStr.((++).show>>=id)"<$id>>=flip id$putStr.((++).show>>=id) 11:05:55 -!- augur has joined. 11:06:14 -!- izabera has changed nick to izaonlyusesone. 11:07:10 -!- izaonlyusesone has changed nick to izabera. 11:21:14 -!- augur has quit (Quit: Leaving...). 11:49:22 -!- augur has joined. 12:40:48 -!- augur has quit (Remote host closed the connection). 13:22:33 @metar lowi 13:22:33 LOWI 161150Z 06013KT 9999 FEW015 SCT030 BKN045 08/05 Q1018 NOSIG 13:23:22 so cold 14:20:04 happeaster 14:22:19 happeaster 14:22:43 oh i was scrolled back exactly 24 hours 14:22:57 and thought my connection was lagging 14:34:03 lol 14:58:49 [wiki] [[Assignless]] N https://esolangs.org/w/index.php?oldid=51721 * Rdococ * (+883) Created page with ":''This language is still undergoing design. It may, and will, probably change in the future.'' '''Assignless''' is a work in progress esoteric programming language by User:..." 14:59:40