00:10:00 [wiki] [[BrainCursion]] http://esolangs.org/w/index.php?diff=40296&oldid=40290 * 212.95.7.162 * (+740) provide sufficient evidence for Turing completeness 00:29:08 -!- LatinLover has joined. 00:31:53 -!- LatinLover has quit (Quit: Saliendo). 00:56:32 -!- nooodl has quit (Read error: Connection reset by peer). 00:57:02 -!- nooodl has joined. 01:18:28 -!- bb010g has joined. 01:21:31 -!- Phantom__Hoover has quit (Read error: Connection reset by peer). 01:22:22 -!- Tritonio has quit (Ping timeout: 240 seconds). 01:29:03 -!- zzo38 has quit (Ping timeout: 240 seconds). 01:42:25 -!- MoALTz_ has joined. 01:45:03 -!- MoALTz__ has quit (Ping timeout: 240 seconds). 01:47:34 -!- zzo38 has joined. 01:57:33 -!- nooodl has quit (Ping timeout: 240 seconds). 02:09:34 -!- Sprocklem has quit (Ping timeout: 272 seconds). 03:03:44 -!- Sprocklem has joined. 03:46:33 -!- lambdabot has quit (Remote host closed the connection). 03:50:48 -!- lambdabot has joined. 03:56:20 -!- Sprocklem has quit (Quit: brb). 04:04:17 -!- Sprocklem has joined. 04:16:40 -!- variable has changed nick to constant. 04:19:54 -!- newsham_ has changed nick to newsham. 04:32:37 -!- lambdabot has quit (Remote host closed the connection). 04:39:01 -!- lambdabot has joined. 04:45:20 -!- MoALTz_ has quit (Quit: Leaving). 04:54:47 -!- nooodl has joined. 04:59:33 -!- nooodl has quit (Ping timeout: 240 seconds). 05:52:20 -!- clog has quit (Ping timeout: 250 seconds). 06:09:47 -!- shikhin has joined. 06:11:13 -!- J_Arcane has quit (Quit: Konversation terminated!). 06:22:08 -!- J_Arcane has joined. 07:30:32 [wiki] [[Brainfuck implementations]] http://esolangs.org/w/index.php?diff=40297&oldid=40284 * Rdebath * (+209) Scanned for deadlinks, not yet for resurrections. 07:45:49 Phew, 85 hours of testing later it turns out that CCBI is dieharder-clean 07:59:24 -!- MindlessDrone has joined. 08:03:51 -!- clog has joined. 08:10:04 -!- oerjan has joined. 08:13:48 Deewiant: so ccbi is your recommended interpreter for hard crypto? 08:15:37 I don't think diehard/er have anything to do with CSPRNGs 08:16:32 Certainly a CSPRNG should pass but passing doesn't mean it's any good for crypto 08:16:56 So no, not recommended for crypto, just recommended for randomness-heavy apps in general 08:17:10 DISAPPOINTING 08:18:42 It's not like Befunge by itself is good for crypto anyway, you should define a crypto fingerprint 08:23:00 -!- Patashu has joined. 08:24:16 -!- AnotherTest has joined. 08:26:50 -!- Patashu has quit (Remote host closed the connection). 08:27:23 -!- Patashu has joined. 08:40:15 NTH_ -- nothing to hide, with a rot13 primitive. 08:41:06 -!- AnotherTest has quit (Ping timeout: 246 seconds). 08:43:10 int-e: There's no rule saying they have to be 4 characters 08:46:51 hmm. according the the ISP there has been a ddos attack against the lambdabot host, that's a first. Not targeted though, I guess. "The rolling DDoS attack continues to impact several IP blocks in our NL location." 08:47:39 Deewiant: nevertheless that seems to be the convention 08:47:54 int-e: I wouldn't add a _ just for that 08:48:17 NTSH hth 08:48:33 NOWT 08:49:15 CIAAC 08:49:43 Needs > 32-bit interpreter, not that that prevents making it 08:50:12 Or you map it to the modulo 2^32 value, I guess 08:50:48 isn't that just dropping a letter 08:51:34 It is isn't it 08:51:43 So it's IAAC 08:52:29 's ok the C was sort of unnecessary 09:26:40 -!- J_Arcane has quit (Ping timeout: 255 seconds). 09:26:46 -!- J_Arcane has joined. 09:59:42 -!- boily has joined. 10:50:01 -!- TieSoul_ has quit (Remote host closed the connection). 11:09:59 -!- boily has quit (Quit: Poulet!). 11:19:57 -!- oerjan has quit (Quit: leaving). 11:30:50 -!- nooodl has joined. 11:38:13 -!- yorick has joined. 11:41:42 -!- MoALTz has joined. 11:57:05 -!- shikhout has joined. 11:59:52 -!- shikhin has quit (Ping timeout: 245 seconds). 12:02:46 -!- Sgeo has quit (Read error: Connection reset by peer). 12:15:12 \o/ 12:15:12 | 12:15:12 /| 12:19:46 @metar lowi 12:19:48 LOWI 151150Z VRB02KT 9999 -SHRA FEW015 SCT050 BKN060 16/11 Q1015 NOSIG 12:25:52 -!- Patashu_ has joined. 12:25:52 -!- Patashu has quit (Disconnected by services). 12:29:08 -!- Patashu has joined. 12:31:57 -!- Patashu_ has quit (Ping timeout: 245 seconds). 12:35:18 -!- Patashu_ has joined. 12:35:19 -!- Patashu has quit (Disconnected by services). 12:48:39 -!- Patashu_ has quit (Ping timeout: 244 seconds). 12:58:33 -!- Phantom_Hoover has joined. 13:00:34 [wiki] [[AAAAAAAAAAAAAA!!!!]] http://esolangs.org/w/index.php?diff=40298&oldid=39091 * 184.7.83.126 * (+40) 13:03:05 [wiki] [[AAAAAAAAAAAAAA!!!!]] http://esolangs.org/w/index.php?diff=40299&oldid=40298 * 184.7.83.126 * (+2) 13:09:57 -!- bb010g has quit (Ping timeout: 260 seconds). 13:10:37 -!- bb010g has joined. 13:14:07 -!- shikhout has changed nick to shikhin. 13:15:38 -!- atehwa has joined. 13:17:48 -!- jj2baile_ has joined. 13:20:42 -!- atehwa_ has quit (*.net *.split). 13:20:42 -!- jj2baile has quit (*.net *.split). 14:28:42 -!- conehead has joined. 14:41:39 -!- mihow has joined. 14:49:32 -!- J_Arcane has quit (Quit: Konversation terminated!). 14:54:09 -!- J_Arcane has joined. 14:56:22 -!- conehead has quit (Read error: Connection reset by peer). 15:28:41 -!- J_Arcane has quit (Quit: (set-jarcane-connect! J_Arcane #f)). 15:32:08 -!- J_Arcane has joined. 15:44:07 @metar KATL 15:44:08 KATL 151452Z 31003KT 10SM FEW045 SCT250 27/16 A3007 RMK AO2 SLP170 T02720161 51007 16:00:02 -!- conehead has joined. 16:09:13 -!- edwardk has quit (Quit: Computer has gone to sleep.). 16:19:58 [wiki] [[SYCPOL]] http://esolangs.org/w/index.php?diff=40300&oldid=40225 * 109.240.133.80 * (+30) 16:47:15 -!- d45611 has joined. 16:48:52 -!- d45611 has quit (Client Quit). 17:37:46 -!- edwardk has joined. 17:56:53 -!- shikhout has joined. 18:00:00 -!- shikhin has quit (Ping timeout: 255 seconds). 18:09:40 -!- tswett has joined. 18:10:12 So today I thought I'd come up with a way to calculate busy beaver numbers using programs shorter than the corresponding busy beaver programs. 18:10:24 And I thought, "I've probably made a mistake somewhere." 18:10:43 Of course, what I really should have been thinking was one letter different. "I've provably made a mistake somewhere." 18:11:00 Anyway, the program would have been the following. 18:11:52 1. Generate all programs of length 1,000. 2. Run all of them simultaneously until N of them halt (where N, hard-coded into the program, is the number of programs of length 1,000 that halt). 3. Output the running time of the longest-running program. 18:12:40 Of course, there's a problem with this program. And it's not that N is uncomputable. 18:13:13 having to compute N beforehand seems like kind of a bummer 18:13:27 Oracle machines are expensive 18:14:17 -!- MoALTz has quit (Quit: Leaving). 18:15:39 A bummer, yeah, but the problem here is that N can't be written concisely enough to make the program shorter than the busy beaver. 18:16:07 (N is perfectly computable. We just don't know which program to use to compute it.) 18:25:37 tswett: this is like the proof that the halting proability is incompressible 18:26:05 Yeah, that pretty much is this proof. 18:26:36 Suppose that the halting probability is compressible. Then you can use this construction to write a program busier than any busy beaver. Contradiction. 18:32:52 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds). 18:36:17 > map toLower "TΤТ" 18:36:18 "t\964\1090" 18:37:12 Is there a way to get lambdabot to output the actual string? 18:38:00 Yes. 18:38:17 I don't know how to do it. But it's really easy. 18:38:52 You just say '> [some function] (map toLower "TΤТ")'. 18:39:13 -!- AnotherTest has joined. 18:39:27 > var (map toLower "TΤТ") -- Melvar 18:39:29 tτт 18:39:42 Ah. 18:39:57 :t var 18:39:58 String -> Expr 18:49:29 -!- MindlessDrone has quit (Quit: MindlessDrone). 18:55:42 > text (map toLower "TΤТ") -- alternatively 18:55:44 tτт 18:56:11 :t text 18:56:13 String -> Doc 18:56:32 Different routes, same destination. 18:56:39 > text "What's up, Doc?" 18:56:41 What's up, Doc? 18:59:27 -!- shikhout has changed nick to shikhin. 19:03:51 > text "blah\nblah" 19:03:53 blah 19:03:53 blah 19:04:13 > text "blah\0blah" 19:04:14 blahblah 19:06:48 > let s = " in text $ \"> let s = \" ++ show s ++ s" in text $ "> let s = " ++ show s ++ s 19:06:50 > let s = " in text $ \"> let s = \" ++ show s ++ s" in text $ "> let s = " ... 19:07:02 Boo. 19:08:11 > let s="in text$\">let s=\" ++show s++s"in text$"> let s="++show s++s 19:08:12 > let s="in text$\">let s=\" ++show s++s"in text$">let s=" ++show s++s 19:08:19 Uh oh. 19:08:27 > let s="in text$\">let s=\"++show s++s"in text$"> let s="++show s++s 19:08:29 > let s="in text$\">let s=\"++show s++s"in text$">let s="++show s++s 19:08:51 > let s="in text$\"> let s=\"++show s++s"in text$"> let s="++show s++s 19:08:53 > let s="in text$\"> let s=\"++show s++s"in text$"> let s="++show s++s 19:10:48 How to do in MediaWiki to tell to start a numbered list at something other than number 1, and/or to use other formats for list numbering? 19:11:35 zzo38: try html tags like
  1. . mediawiki allows most of those. 19:12:10 Can it not be done using the # syntax? 19:12:14 alternately make an indented list (preface lines with colon) and just write the numbers by hand 19:12:24 I don't think it can be, but I'm not sure 19:17:41 zzo38: see https://en.wikipedia.org/wiki/Help:List 19:19:53 zzo38: in particular, see https://en.wikipedia.org/wiki/Help:List#Specifying_a_starting_value 19:28:31 O, so that's how you do it. 19:28:54 Well, I have already fixed a list on another wiki by using
      already though 19:40:00 -!- AnotherTest has quit (Ping timeout: 260 seconds). 20:11:23 tswett: What are you trying to do? Quine? 20:14:24 I don't think the last one was "trying" any more. Modulo the unavoidable space. 20:16:16 > (Devour, "foo") 20:16:18 ( 20:17:50 > [Devour, Devour] 20:17:52 [ 20:17:53 :t Devour 20:17:54 Devour 20:18:16 > show Devour 20:18:18 "" 20:18:32 > show Devour ++ show 42 20:18:33 Hah, i like Devour. 20:18:34 "42" 20:18:41 > putStrLn $ show Devour ++ show 42 20:18:43 20:18:47 I just defined it with @let just now. 20:19:04 > text $ show Devour ++ show 42 20:19:06 > (showsPrec 5 42 . showsPrec 5 Devour . showsPrec 5 42) [] 20:19:06 42 20:19:07 "42" 20:19:22 Hmm 20:20:52 ion: What’s its canonical name btw? 20:22:16 Hm. 20:22:25 What’s whose canonical name? 20:22:35 :t showsPrec 5 Devour 20:22:36 ShowS 20:22:52 -!- oerjan has joined. 20:22:53 @src ShowS 20:22:53 ion: That of Devour. 20:22:53 type ShowS = String -> String 20:22:59 :) 20:23:09 Devour has a canonical name? 20:23:21 Melvar: Something to do with const ""? 20:23:44 Well, you said “Hah, i like Devour.” as though you knew it. 20:23:57 Hence why show Devour ++ whatever works, but shows composition fails 20:24:04 bb010g: instance Show Devour where showsPrec _ _ _ = "" 20:24:30 @pl showsPrec _ _ _ = "" 20:24:31 showsPrec = const (const (const [])) 20:24:47 melvar: I had not seen it before. 20:25:29 fiendish 20:25:54 And now … 20:26:05 > ("foo", Devour, "bar") 20:26:06 ("foo",>°) Om nom nom 20:27:12 •••ᗤ 20:27:25 Exactly. 20:36:10 @let data Chomp = Chomp; instance Show Chomp where showsPrec n _ s = drop n s 20:36:11 Defined. 20:36:25 > (Chomp, [1..]) 20:36:27 (,[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,2... 20:36:43 -!- Mattry has joined. 20:36:48 -!- MoALTz has joined. 20:37:05 hola 20:37:17 `bienvenido Mattry 20:37:17 Mattry: ¡Bienvenido al centro internacional para el diseño y despliegue de lenguajes de programación esotéricos! Por desgracia, la mayoría de nosotros no hablamos español. Para obtener más información, echa un vistazo a nuestro wiki: http://esolangs.org/. (Para el otro tipo de esoterismo, prueba #esoteric en irc.dal.net.) 20:37:47 gracias 20:38:12 -!- Mattry has left. 20:38:31 darn i forgot to ask how they found us 20:39:07 > (Just Chomp, [1..]) 20:39:09 (Just ,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,3... 20:41:40 > (42, Zalgo, "chaos") 20:41:40 somehow my mind blanks on any data structures shown with intermediate precedence operator constructors 20:41:41 (42,HE COMES,̫̣̳ͤ͋͛̈̑̌̅"̳̟̱̗̐̋̔̏̆͠c̐̏̂̈̔ͨ͑ẖ̱̰̂ạͫͧ͠ͅö̴͚͇͉̤̣̠̆̒s̭̜̙̩ͨ͡"̅͗͊ͩ... 20:43:09 @let data Rev = Rev; instance Show Rev where showsPrec _ _ = reverse 20:43:10 Defined. 20:43:23 > (42, Rev, Zalgo, Chomp) 20:43:24 Not in scope: data constructor ‘Chomp’ 20:43:30 :( 20:43:36 > (42, Rev, Zalgo) 20:43:37 (42,̳̣̫̅̌̑̈͛͋ͤ)SEMOC EH, 20:43:43 Sorry, i screwed up and had to @undefine once 20:44:20 > (42, Rev, Zalgo, Rev, "chaos") 20:44:22 (42,̳̣̫̅̌̑̈͛͋ͤ,̅ͥ͂͟"͇̭̞ͧͩ͊͗̅c̩̙̜̭ͨ͡h̴̠̣̤͉͇͚̒̆̈ạͧͫ͠ͅô̰̱̱s͑ͨ̔̈̂̏̐"̗̱̟̳̆̏̔̋̐͠... 20:44:51 > map ((,) Rev) [1..10] 20:44:53 [(,2),(,4),(,6),(,8),(,10)](,)9,(,)7,(,)5,(,)3,(,)1, 20:45:03 ooh 20:45:10 > map ((,) Rev) "scramble" 20:45:12 [(,'c'),(,'a'),(,'b'),(,'e')](,)'l',(,)'m',(,)'r',(,)'s', 20:45:12 nice 20:45:46 > map (flip (,) Rev) "scramble" 20:45:48 [('s',),('r',),('m',),('l',)],'e'(,),'b'(,),'a'(,),'c'(,) 20:45:54 ^scramble scramble 20:45:54 srmlebac 20:47:21 -!- edwardk has left ("Leaving..."). 20:48:35 ^scramble scramble 20:48:35 srmlebac 20:49:05 ^scramble Does_anyone_wonder_what_the_period_of_this_sentence_is? 20:49:05 De_noewne_httepro_fti_etnei?s_censsh_odie_h_awrdo_nyaso 20:49:12 ^scramble De_noewne_httepro_fti_etnei?s_censsh_odie_h_awrdo_nyaso 20:49:13 D_owehtpofieniscns_deharonaosy_dw__iohse_?et_t_ret_nene 20:49:19 ^scramble D_owehtpofieniscns_deharonaosy_dw__iohse_?et_t_ret_nene 20:49:19 Doetoinsn_eaoas_w_os_e__e_eenntrtt?ehi_dyonrhdsciefphw_ 20:50:03 ^scramble abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ012 20:50:03 acegikmoqsuwyACEGIKMOQSUWY021ZXVTRPNLJHFDBzxvtrpnljhfdb 20:50:13 > length "Dtdaspen_ds_h_ohtorssofeiiynewear?etc__enoho____enetniw" 20:50:15 55 20:50:21 ^scramble acegikmoqsuwyACEGIKMOQSUWY021ZXVTRPNLJHFDBzxvtrpnljhfdb 20:50:21 aeimquyCGKOSW01XTPLHDzvrnjfbdhlptxBFJNRVZ2YUQMIEAwsokgc 20:50:23 i think we discussed the period as a function of length at one time 20:50:48 and possibly found the sequence on OEIS 20:51:11 ^scramble seclrbam 20:51:11 scramble 20:51:39 ^unscramble scramble 20:51:39 seclrbam 20:52:08 -!- diginet_ has quit (Quit: diginet has quit!). 20:52:39 -!- diginet has joined. 20:53:18 OEIS surely has the sequence corresponding to the highest period of any element in the group S_n. 20:53:55 yes but is that the same, we don't get _all_ permutations here 20:54:57 Probably not the same. 20:55:09 @let scramble = concat . (_last %~ reverse) . transpose . chunksOf 2 20:55:11 Defined. 20:55:19 > scramble "seclrbam" 20:55:21 "scramble" 20:55:51 > foldr (\x xs -> x:reverse xs) "seclrbam" 20:55:53 <[Char] -> [Char]> 20:55:57 > foldr (\x xs -> x:reverse xs) [] "seclrbam" 20:55:59 "scramble" 20:56:20 -!- tswett has quit (Quit: Page closed). 20:57:03 @let slength = ((\(x:xs) -> 1 + length (takeWhile (/= x) xs)) . iterate scramble) 20:57:05 Defined. 20:57:17 > map slength [[1..n] | n <- [1..]] 20:57:20 [1,1,2,3,3,5,6,4,4,9,6,11,10,9,14,5,5,12,18,12,10,7,12,23,21,8,26,20,9,29,30... 20:58:17 @oeis 1,1,2,3,3,5,6,4,4,9,6,11,10 20:58:21 a(n) = card {cos((2^k)*Pi/(2*n-1)): k in N}.[1,1,2,3,3,5,6,4,4,9,6,11,10,9,1... 20:58:29 the first 1 is bogus 20:58:40 @oeis 0,1,2,3,3,5,6,4,4,9,6,11,10 20:58:43 Least number m such that 2^m == +- 1 (mod 2n + 1).[0,1,2,3,3,5,6,4,4,9,6,11,... 20:59:11 or, hm, i guess not 20:59:23 @list oeis 20:59:24 oeis provides: oeis sequence 20:59:38 @sequence 0,1,2,3,3,5,6,4,4,9,6,11,10 20:59:42 Least number m such that 2^m == +- 1 (mod 2n + 1).[0,1,2,3,3,5,6,4,4,9,6,11,... 20:59:47 bah 21:00:20 @oeis 1,1,2,3,3,5,6,4,4,9,6,11,10,9,14,5,5,12,18,12,10,7,12,23,21,8,26,20,9,29,30 21:00:22 a(n) = card {cos((2^k)*Pi/(2*n-1)): k in N}.[1,1,2,3,3,5,6,4,4,9,6,11,10,9,1... 21:00:25 int-e: there should be a command to get the link page 21:01:14 nooodl: that 2^m think does ring a vague bell 21:01:33 as in, i may have once understood why that gives the same thing 21:01:47 *thing 21:01:54 https://oeis.org/A216066 21:03:20 the other one is https://oeis.org/A003558 21:03:39 and is linked from the former with "essentially the same as" 21:04:31 [wiki] [[Talk:Brainfuck]] http://esolangs.org/w/index.php?diff=40301&oldid=39669 * Rdebath * (+7610) /* Syntax highlighting. */ new section 21:04:37 oerjan: the old buubot plugin I made did give the link, but buubot is dead 21:05:22 rip 21:08:42 -!- thisisausername has left. 21:18:27 hmm, actually 21:18:39 its descendant perlbot still has that plugin working 21:19:09 try /msg perlbot oeis: 3,20,28 21:19:25 or if you want on a channel, try /msg #buubot perlbot oeis: 3,20,28 21:21:17 > catalogNums <$> lookupSequence [1,1,2,3,3,5,6,4] 21:21:19 Just ["A072451"] 21:21:32 Ooh 21:22:12 > lookupSequence [1,1,2,3,3,5,6,4] 21:22:14 Just (OEIS {catalogNums = ["A072451"], sequenceData = [1,1,2,3,3,5,6,4,8,9,6... 21:22:37 :t OEIS 21:22:39 [String] -> SequenceData -> SequenceData -> String -> [String] -> [String] -> [String] -> [String] -> String -> Int -> Int -> [(Language, String)] -> [String] -> [String] -> [Keyword] -> [String] -> OEISSequence 21:23:01 http://hackage.haskell.org/package/oeis-0.3.5/docs/Math-OEIS.html#t:OEISSequence 21:23:19 :t lookupSequence 21:23:20 SequenceData -> Maybe OEISSequence 21:23:27 right... the buubot oeis plugin doesn't provide this detail, you have to follow the web link if you need the details 21:23:49 (it's a crazy use of unsafePerformIO ... not sure that it should be trusted.) 21:24:31 -!- mihow has quit (Quit: mihow). 21:25:07 :) 21:25:12 int-e: the buubot plugin isn't written in haskell, does that makeit less crazy? 21:25:26 int-e: you could DOS OEIS with it, perhaps? 21:26:02 oerjan: not effectively, I think 21:26:11 (due to timeouts etc) 21:27:25 > foldl' getSequenceByID $ repeat "A000042" 21:27:27 Couldn't match type ‘Data.Maybe.Maybe Math.OEIS.Types.SequenceData’ 21:27:27 with ‘a -> GHC.Base.String’ 21:27:27 Expected type: GHC.Base.String -> a -> GHC.Base.String 21:27:27 Actual type: GHC.Base.String 21:27:27 -> Data.Maybe.Maybe Math.OEIS.Types.SequenceDataCouldn't matc... 21:27:46 derp 21:27:55 int-e: you could try with buubot too 21:28:22 > getSequenceByID <$> repeat "A000042" 21:28:26 [Just [1,11,111,1111,11111,111111,1111111,11111111,111111111,1111111111,1111... 21:29:01 but yeah, not very effectively, because the http queries to oeis will be serialized within one command you give to buubot 21:29:19 you could try to use buubot's web interface to work around the irc rate limiting, but even then 21:29:25 it's probably not very effective 21:29:34 if you want to ddos oeis, there are probably better ways 21:29:41 14:27:39 > foldl' (\x->getSequenceByID x`seq`()) $ repeat "A000042" 21:29:42 also, don't do that even if you can 21:29:46 please 21:30:08 > (\x->getSequenceByID x`seq`()) <$> repeat "A000042" 21:30:13 mueval-core: Time limit exceeded 21:31:35 oeis really doesn't deserve that kind of malice. nor does lambdabot, imho 21:37:06 I like buubot/perlbot, in case you haven't noticed. I helped make its macro system, which is I think more powerful than lambdabot's 21:45:07 (only it's not very well documented, except by some cryptic single-line descriptions) 21:51:45 -!- not^v has joined. 21:56:23 -!- boily has joined. 21:57:09 -!- Sgeo has joined. 21:58:58 quintopia: QUINTHELLOPIAAAAAAAAAAAAAA! 22:06:30 > scramble "" 22:06:32 "" 22:07:48 -!- conehead has quit (Quit: Computer has gone to sleep). 22:10:10 :t chunksOf 22:10:12 Int -> [e] -> [[e]] 22:11:55 :D that oeis library 22:13:28 > scramble "CHICKEN!" 22:13:30 "CIKN!ECH" 22:13:39 > scramble "CIKN!ECH" 22:13:41 "CK!CHENI" 22:13:49 > scramble "CK!CHENI" 22:13:50 "C!HNIECK" 22:13:57 will it ever rechicken? 22:14:47 > map scramble (repeat "CHICKEN!") 22:14:49 ["CIKN!ECH","CIKN!ECH","CIKN!ECH","CIKN!ECH","CIKN!ECH","CIKN!ECH","CIKN!ECH... 22:15:00 > map scramble (repeat "CHICKEN!") 22:15:03 ["CIKN!ECH","CIKN!ECH","CIKN!ECH","CIKN!ECH","CIKN!ECH","CIKN!ECH","CIKN!ECH... 22:15:11 > iterate scramble "CHICKEN!" 22:15:13 ["CHICKEN!","CIKN!ECH","CK!CHENI","C!HNIECK","CHICKEN!","CIKN!ECH","CK!CHENI... 22:16:10 I was one scrambled chicken away from the unomeletted form. 22:19:33 -!- nooodl has quit (Ping timeout: 240 seconds). 22:43:45 > sort "unchecked permit" == sort "permuted chicken" 22:43:47 True 22:44:57 whoooah... deep. 22:51:07 -!- Patashu has joined. 22:54:13 -!- Phantom_Hoover has joined. 22:56:09 are scrabble players good at finding anagrams? (I employ the help of computers for finding them) 22:58:11 probably so. 22:58:17 meanwhile, images.google.ca is dead :( 23:01:15 Probably you can be good at playing at Scrabble if you can find anagrams, especially if it is Anagram Scrabble. 23:01:42 -!- oerjan has quit (Quit: bon quit). 23:02:37 no, for Scrabble you just have to memorize the crazy wordlist, especially of the short words and the words with high scoring letters 23:02:59 and you have to keep up the list as they rewise the scrabble dictionary 23:03:28 well, maybe they did that only once, but that time they added "QI" which like changes the whole game 23:05:44 https://en.wikipedia.org/wiki/Official_Scrabble_Players_Dictionary says the current English dictionary is the fourth edition, but a fifth edition is planned 23:08:00 -!- ^v has quit (Ping timeout: 272 seconds). 23:11:21 -!- conehead has joined. 23:19:17 Actually just knowing all of the words isn't good enough for Scrabble; it is part of it but there is other strategy involved too. 23:21:53 yes, there's some more 23:22:52 a move made only because you want to hear your opponent exclaim “oh fungot” is perfectly valid. 23:22:52 boily: only in an extremely indirect way you can have more than one 23:23:28 fungot: that's so true 23:23:28 b_jonas: argl... do i *have* to eat the donuts, everyone! 23:23:40 fungot: so what do you think really happened to her? 23:23:41 b_jonas: a programming language of the future 23:23:59 b_jonas: which her? remember, fungot has two girlfriends. 23:23:59 boily: maybe rtfm actually stands for rich text format. 23:24:00 fungot: uh... but how? 23:24:00 b_jonas: there was fnord in front of 23:24:10 helloily 23:29:53 how's the weather down South? 23:31:14 Do you know? Now I wrote many thing of Super ASCII MZX Town and level20.tex story into the "All The Tropes". See if you like them, or want to complain about them, add more stuff if you have more idea to add, found mistakes and you can fix it, etc? We can make multiple views rather than only my own biased kind of opinions of it. 23:31:35 Warm 23:35:35 I miss warm. I was near LEZL last week. 23:35:48 why 23:36:10 family? 23:37:34 on vacation with my parents :D 23:39:08 well, you're more than welcome to vacation again down here. it should be warm for at least another month, and I'll point you to the vacationy places. 23:39:54 (by warm i mean "at least 26") 23:40:46 good enough for me. it's been raining here since I got back, we've had day with 16 °C max... uuuurgh. 23:43:59 i imagine you're stuck there though, what with work and Responsible Adult Living 23:45:48 Stuck: check. Adult: check. Living: uhm... I'll go with check, just to be on the safe side. 23:50:50 i see you are silent on the subject of Responsible 23:52:14 ♪ LA LA LA I CAN'T HEAR YOU LA LA LA ♪ 23:52:47 seriously, I am responsible. it's just a drag. 23:56:31 boily: you were in saville, spain? 23:56:58 -!- shikhout has joined. 23:57:34 So, I wrote a chunksOf : (n : Nat) -> List a -> (List (Vect (S n) a), BoundedList n a) 23:59:33 -!- shikhin has quit (Ping timeout: 240 seconds). 23:59:56 i am most amused by the video on wikipedia of an antlion throwing sand at an ant to prevent it escaping its trap. insects are pretty cool.