00:03:49 MDude: is there any way to distinguish jerkcity comics from random MS Comic Chat screenshots 00:04:02 can they truly be said to be distinct categories 00:04:50 Frequency of refferences to dicks? 00:14:30 can you show me an if-else in bf? 00:18:09 +>[.<->[-]]<[>>.<<-] 00:18:51 ok wait i'm a beginner, gimme a minute to understand it 00:19:59 -!- Phantom__Hoover has joined. 00:21:04 increment cell0 to 1, if cell1 != 0 print it, then decrement cell0, then cell1 = 0 while cell0-- != 0 print cell2 00:21:45 ok that... doesn't look like an if-else 00:23:11 -!- Phantom_Hoover has quit (Ping timeout: 273 seconds). 00:24:23 -!- Melvar` has joined. 00:24:23 -!- idris-bot has quit (Ping timeout: 244 seconds). 00:24:41 ok uhm the while loop is skipped since you decremented cell0 00:25:06 nice, thank you 00:25:07 well a while block executed once is just an if block, if you want to look at it that way 00:25:12 http://www.paste.org/77995 00:25:12 sure 00:25:33 -!- Melvar has quit (Ping timeout: 276 seconds). 00:25:48 This is my attempt at an interpreter for "State" 00:26:12 orin: can you use a pastebin that doesn't have an anti-adblock? :\ 00:26:55 huh? Ihave adblock and i'm seeing no problems 00:28:09 http://pastecode.org/index.php/view/99675460 00:28:23 thanks 00:28:26 -!- doesthiswork has joined. 00:29:05 Oh. I see, it's because I also use noscript 00:29:59 spam spam spam spam spam best pastebin evur spam spam spam spam http://arin.ga 00:31:08 no js required, it gives you the raw version when you load it from curl/wget, and you can set an expire date like '17 years 9 days 2 hours 55 minutes' 00:31:36 00:32:32 Anyway, rdococ, do you have any example programs? 00:32:57 izabera: have you looked at https://esolangs.org/wiki/Brainfuck_algorithms 00:33:07 i currently am 00:33:19 looking at it 00:43:09 -!- Phantom__Hoover has quit (Read error: Connection reset by peer). 00:47:50 how do i move the pointer 1000 cells to the left? 00:48:29 depends on the implementation whether that is even possible 00:48:40 where it is possible, 1000 <'s in a row should do it 00:49:01 ...i meant to the right ^^ 00:49:28 and i was hoping for a different answer 00:52:18 if the tape has only zeros and then you put N in a cell, you can then use [-[>+<-]>] pattern to move the pointer over N spots 00:52:57 [wiki] [[ASCII art/mandelbrot]] N http://esolangs.org/w/index.php?oldid=42438 * Esowiki201529A * (+1067) Created page with " vL , '*m-` -m/**\a, ..." 00:54:13 [wiki] [[ASCII art/mandelbrot]] http://esolangs.org/w/index.php?diff=42439&oldid=42438 * Esowiki201529A * (+0) 00:55:59 if the tape does not have only zeroes... 1000 >'s should do it :D 00:56:16 yay <.< 00:56:23 (fun fact: most programs do not require 1000 cells) 01:02:39 if you have 1000 nonzero cells followed by a zero, you may want to consider [>] 01:10:50 -!- SgeoWeb has joined. 01:11:13 youtube is dead 01:11:29 My home laptop is dead 01:11:41 As is my sanity 01:12:28 -!- bb010g has joined. 01:12:37 `relcome bb010g 01:12:44 `relcome sgeo's insanity 01:12:57 relcome? 01:13:03 bb010g: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: . (For the other kind of esoterica, try #esoteric on irc.dal.net.) 01:13:03 sgeo's: insanity: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: . (For the other kind of esoterica, try #esoteric on irc.dal.net.) 01:13:38 Hmm. o.o 01:16:23 [wiki] [[Brainfuck algorithms]] http://esolangs.org/w/index.php?diff=42440&oldid=42253 * Quintopia * (+79) /* z = sign(x-y) */ i had this algorithm backwards apparently. i think i fixed it. 01:17:37 Is it a bad idea to call out a subreddit mod for failing to disclose financial incentives? 01:17:50 I mean, this mod is helping me, but still 01:18:46 [wiki] [[Brainfuck algorithms]] M http://esolangs.org/w/index.php?diff=42441&oldid=42440 * Quintopia * (+49) /* z = sign(x-y) */ 01:20:55 [wiki] [[Brainfuck algorithms]] M http://esolangs.org/w/index.php?diff=42442&oldid=42441 * Quintopia * (-41) /* z = sign(x-y) */ 01:22:02 * SgeoWeb looks a bit closer 01:22:06 Could have been a mistake 01:22:09 SgeoWeb: do you have reason to suspect the mod's judgment is compromised by a conflict of interest? 01:22:40 quintopia: no, but I have reason to believe it's a violation of the subreddit's own rules, which state that posters of affiliate links should have it disclosed in their flair 01:24:00 Eh, if it's a mistake, they won't mind me asking about the affiliate thing directly 01:24:14 I see other Amazon links by them that don't have the affiliate tag 01:24:26 And ones to non-affiliate-capable sites 01:30:12 i wouldn't mention it then 01:31:57 -!- oerjan has joined. 01:59:49 http://www.amazon.com/gp/product/B00OBQ5950/ 01:59:57 Don't seem to see details on the HD 02:03:50 what details are you looking for? 02:04:54 Whether the HD will park itself if it detects vibration 02:05:10 Also all the negative reviews about the SSD breaking and being dumped into a BIOS utility scare me 02:20:22 -!- contrapumpkin has changed nick to copumpkin. 02:22:05 -!- lifthrasiir has quit (Ping timeout: 264 seconds). 02:22:22 -!- lifthrasiir has joined. 02:23:51 -!- llue has quit (Read error: Connection reset by peer). 02:23:52 -!- lleu has quit (Read error: Connection reset by peer). 02:23:58 -!- SgeoWeb has changed nick to Sgeo. 02:24:16 -!- Sgeo has changed nick to SgeoWbe. 02:24:19 -!- SgeoWbe has changed nick to SgeoWeb. 02:29:14 -!- TieSoul_ has joined. 02:30:09 -!- Froox has joined. 02:32:28 -!- Frooxius has quit (Ping timeout: 250 seconds). 02:32:45 -!- TieSoul has quit (Ping timeout: 248 seconds). 02:40:03 -!- adu has joined. 02:59:44 -!- jameseb- has joined. 03:05:05 -!- b_jonas has quit (*.net *.split). 03:05:05 -!- dianne has quit (*.net *.split). 03:05:05 -!- lambdabot has quit (*.net *.split). 03:05:06 -!- jameseb has quit (*.net *.split). 03:05:06 -!- zemhill_ has quit (*.net *.split). 03:09:20 Apparently austria is actually spelled with a o <- Ö hth 03:11:33 -!- Sprocklem has joined. 03:11:33 -!- b_jonas has joined. 03:11:33 -!- dianne has joined. 03:11:33 -!- lambdabot has joined. 03:11:33 -!- zemhill_ has joined. 03:12:23 -!- Sprocklem has changed nick to Guest17241. 03:12:27 oesterreich 03:12:59 https://github.com/mishoo/UglifyJS2/issues/121#issuecomment-92522991 03:20:02 Hmm... what if i dynamically tell what base a number is in as it's read? so for eixample, 2F0 is (2*10+15)*16=560 03:20:46 2*3? 03:22:03 shachaf: good point. 03:22:38 -!- Froox has quit (Quit: *bubbles away*). 03:23:16 in such representation, it is not obvious to me an algorithm for opimizing the size of higher numbers 03:24:53 consider if we have only 36 known digits, then in representing 37... 03:26:40 We can do 1Y 03:30:35 can i propose a code challenge? 03:30:46 What kind of code challenge? 03:31:08 `` echo {a,b,}c{1..3} 03:31:08 ac1 ac2 ac3 bc1 bc2 bc3 c1 c2 c3 03:31:12 invert it 03:32:05 find the shortest brace expansion that generates a set of strings 03:36:32 `` echo {1..3}{a,b,c}{4..6} 03:36:33 1a4 1a5 1a6 1b4 1b5 1b6 1c4 1c5 1c6 2a4 2a5 2a6 2b4 2b5 2b6 2c4 2c5 2c6 3a4 3a5 3a6 3b4 3b5 3b6 3c4 3c5 3c6 03:37:20 `` echo {x,{,w}q}{,a} # you can even nest it 03:37:26 x xa q qa wq wqa 03:40:21 `` echo {abc,def}{g,} 03:40:22 abcg abc defg def 03:41:06 `` echo {1..3}{a..c} 03:41:07 1a 1b 1c 2a 2b 2c 3a 3b 3c 03:41:20 `` echo {1..3}{aa..ac} 03:41:21 1{aa..ac} 2{aa..ac} 3{aa..ac} 03:42:22 you may restrict the challenge to the {a,b,c} expansion style, ignore the {a..z} ^^ 03:43:27 `` echo {`{,`}}{1..3} 03:43:28 bash: {,: command not found \ bash: {,: command not found \ bash: {,: command not found \ {}}1 {}}2 {}}3 03:43:36 `` echo {\{,\}}{1..3} 03:43:36 {1 {2 {3 }1 }2 }3 03:43:52 you may restrict the challenge to lowercase letters only <.< 03:44:02 And then, do you have to consider if the text include itself braces? 03:44:11 you may restrict the challenge to lowercase letters only <.< 03:44:13 (Even outside of a block) 03:44:25 lowercase letters only <.< 03:44:46 -!- MDude has changed nick to MDream. 03:45:21 O, so you mean all of the text is only with lowercase letter and not .. either, I suppose is you mean? 03:45:34 no i mean 03:45:54 -!- Guest17241 has quit (Quit: [). 03:45:58 the input is a single line with several words, space separated or whatever 03:46:07 that only use lowercase letters 03:46:16 -!- Sprocklem_ has joined. 03:46:20 O, so spaces is OK too, but only between items. 03:46:35 hey the input format is not important 03:47:33 i'm just trying to remove the annoying cases <.< 03:48:07 OK 03:48:07 get a list of words and produce the smallest brace expansion that generates them ^^ 03:48:19 OK 03:53:17 I want to make up a "temporary://" URI scheme for temporary identifiers. The format is scheme,authority,path,query,fragment like other URI and work same way relative URIs too, but it is local to the current instance and is not a global URI and probably doesn't points to anything. I also want to make up "urn:bible:" scheme. 03:54:44 [wiki] [[Special:Log/move]] move * Esowiki201529A * moved [[Itflabtijtslwi]] to [[Ignore this fancy little acronym because this is just that slashes language with input]] 03:54:44 [wiki] [[Special:Log/move]] move * Esowiki201529A * moved [[Talk:Itflabtijtslwi]] to [[Talk:Ignore this fancy little acronym because this is just that slashes language with input]] 03:54:59 Would urn:bible: only be Bible locations, or could it also specify translation? 03:55:13 And if so, is there a list of translations, or a more generic way anyone could produce a 'translation'? 03:55:31 [wiki] [[Special:Log/move]] move_redir * Esowiki201529A * moved [[Ignore this fancy little acronym because this is just that slashes language with input]] to [[Itflabtijtslwi]] over redirect 03:55:31 [wiki] [[Special:Log/move]] move_redir * Esowiki201529A * moved [[Talk:Ignore this fancy little acronym because this is just that slashes language with input]] to [[Talk:Itflabtijtslwi]] over redirect 03:55:57 SgeoWeb: Only the Bible reference, I think. 03:56:25 If you want a specific translation, you will use the URL that points to the text of that translation. 03:58:50 For example you can write urn:bible: or urn:bible:: or urn:bible::: or urn:bible:::-: might be the possible formats. 03:59:20 -!- SgeoWeb has quit (Ping timeout: 246 seconds). 04:03:36 http://www.westpoint.edu/eecs/SiteAssets/SitePages/Faculty%20Publication%20Documents/Okasaki/jfp03flat.pdf <-- now i'm wondering if it is obviously impossible to do this with S and K specifically 04:06:55 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 04:08:20 anything starting with K.. or SK.. can be simplified. 04:08:55 -!- adu has quit (Quit: adu). 04:09:20 SSxy = Sy(xy), if y is K that's also useless 04:11:31 SSxSz = SS(xS)z = Sz(xSz), so needs z = S 04:12:27 SSxSSa = SS(xSS)a = Sa(xSSS) oh i see this just keeps being trivial 04:12:47 -!- adu has joined. 04:13:50 [wiki] [[Gibberish/JavaScript]] http://esolangs.org/w/index.php?diff=42451&oldid=42437 * Esowiki201529A * (+109) /* self interpreter */ 04:14:36 um *Sa(xSSa) 04:16:03 -!- vodkode__ has left ("Leaving"). 04:16:33 [wiki] [[Gibberish/JavaScript]] http://esolangs.org/w/index.php?diff=42452&oldid=42451 * Esowiki201529A * (+6) /* Fibonacci sequence */ 04:20:07 -!- vodkode_ has joined. 04:25:50 OMG HOW DO I DRAW A FUCKING CIRCLE IN ASCII ART THAT LOOKS LIKE A CIRCLE 04:26:17 i'm completely unable to do it -_- 04:26:38 -_- looks like a good start 04:27:02 c.c 04:27:03 c.c.c 04:27:03 c.c 04:28:18 even bots can 04:28:48 (_) might be a better start 04:29:35 depends how big it should be 04:30:36 enough for a clock >.< 04:32:06 -!- adu has quit (Quit: adu). 04:33:58 http://ascii.co.uk/art/clock hth 04:37:10 -!- SgeoWeb has joined. 04:42:26 -!- vodkode_ has quit (Quit: Leaving). 04:49:22 [wiki] [[Gibberish/JavaScript]] http://esolangs.org/w/index.php?diff=42453&oldid=42452 * Esowiki201529A * (+2) /* Fibonacci sequence */ 04:49:59 Di oirtabke desktops exist?> 04:50:04 Do portable desktops exist? 04:50:13 -!- vodkode_ has joined. 05:08:45 -!- zadock has joined. 05:12:30 a homerow shift error 05:12:49 gsnvy 05:14:06 > plot (\n -> n `mod` 7) 0 80 05:14:07 No instance for (Enum a0) arising from a use of ‘plot’ 05:14:07 The type variable ‘a0’ is ambiguous 05:14:08 Note: there are several potential instances: 05:15:28 :t plot 05:15:29 (Enum a1, RealFrac a) => (a1 -> a) -> a1 -> a1 -> Doc 05:15:52 > (0$0`plot`) 05:15:54 The operator ‘plot’ [infixl 9] of a section 05:15:54 must have lower precedence than that of the operand, 05:15:54 namely ‘$’ [infixr 0] 05:16:45 > plot (\n -> fromIntegral (n `mod` 7)) 0 80 05:16:46 ⠀⠀⡠⠂⠀⢀⠔⠀⠀⡠⠂⠀⢀⠔⠀⠀⡠⠂⠀⢀⠔⠀⠀⡠⠂⠀⢀⠔⠀⠀⡠⠂⠀⢀⠔⠀⠀⡠⠂⠀ 05:16:47 ⡠⠊⠀⢀⠔⠁⠀⡠⠊⠀⢀⠔⠁⠀⡠⠊⠀⢀⠔⠁⠀⡠⠊⠀⢀⠔⠁⠀⡠⠊⠀⢀⠔⠁⠀⡠⠊⠀⢀⠔ 05:17:12 -!- vodkode_ has quit (Ping timeout: 240 seconds). 05:18:40 > plot (\x -> sin (x*80)) 0 (pi/40) 05:18:41 Terminated 05:18:50 > plot (\x -> sin (x*80)) 0 (pi/40) 05:18:51 Terminated 05:19:03 hmph silly function 05:19:38 > plot (\x -> sin (fromIntegral (x*pi/40))) 0 80 05:19:39 No instance for (Enum a0) arising from a use of ‘plot’ 05:19:39 The type variable ‘a0’ is ambiguous 05:19:39 Note: there are several potential instances: 05:19:47 * variable looks at oerjan 05:19:55 > plot (\x -> sin (fromIntegral (x*pi/40))) 0 (80::Int) 05:19:57 No instance for (Floating Int) arising from a use of ‘pi’ 05:19:57 In the second argument of ‘(*)’, namely ‘pi’ 05:19:57 In the first argument of ‘(/)’, namely ‘x * pi’ 05:20:01 oops 05:20:18 > plot (\x -> sin (fromIntegral x * pi/40)) 0 (80::Int) 05:20:19 ⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⢄⣀⣀⣀⣀⣀⣀⣀⣀⣀⡈⠉⠉⠉⠉⠉⠉⠉⠉⠉⠉⠉⠉⠉⠉⠉⠉⠉⠉⠉ 05:20:51 wat 05:21:23 > plot (\x -> 2*sin (fromIntegral x * pi/40)) 0 (80::Int) 05:21:24 ⣀⣀⣀⡠⠤⠤⠤⠤⠤⠤⠢⠤⠤⠤⠤⠤⠤⣀⣀⣀⡈⠉⠉⠑⠒⠒⠒⠒⠒⠒⠒⠒⠒⠒⠒⠒⠒⠉⠉⠉ 05:21:57 i feel this is not how plots should work 05:22:07 > plot (\x -> 1 + 2*sin (fromIntegral x * pi/40)) 0 (80::Int) 05:22:09 ⠤⠤⠤⠔⠒⠒⠒⠒⠒⠒⠑⠒⠒⠒⠒⠒⠒⠤⠤⠤⢄⣀⣀⡈⠉⠉⠉⠉⠉⠉⠉⠉⠉⠉⠉⠉⠉⣀⣀⣀ 05:23:18 > plot (\n -> sqrt(49 - (n-7)*(n-7))) 0 15 05:23:20 ⠀⡠⠒⠊⠒⠢⡀⠀ 05:23:20 ⡈⠀⠀⠀⠀⠀⠈⡀ 05:24:07 > plot (\n -> 7-sqrt(49 - (n-7)*(n-7))) 0 15 05:24:09 ⠁⠀⠀⠀⠀⠀⠀⠁ 05:24:09 ⠈⠢⣀⣀⣀⡠⠊⠀ 05:24:31 > plot (\x -> 1 + 10*sin (fromIntegral x * pi/40)) 0 (80::Int) 05:24:32 ⠀⠀⠀⠀⠀⣀⠤⠔⠒⠒⠑⠒⠒⠤⢄⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ 05:24:32 ⠀⠀⣀⠔⠊⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⠒⢄⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ 05:24:32 ⠤⠊⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⠢⢄⠑⠤⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠠⠔⢁ 05:24:52 > plot (\x -> 10*(1+sin (fromIntegral x * pi/40))) 0 (80::Int) 05:24:53 ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ 05:24:53 ⠀⠀⠀⠀⢀⠤⠒⠊⠉⠉⠈⠉⠉⠒⠢⢄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ 05:24:53 ⠀⢀⠤⠊⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠉⠢⢄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ 05:25:00 sheesh 05:25:28 > plot id 0 80 05:25:29 ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ 05:25:29 ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡠⠊ 05:25:29 ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡠⠊⠀⠀ 05:25:47 you'd get a better pic in /msg :) 05:26:04 OKAY 05:26:28 no implicit plot? sux 05:34:09 -!- roasted42 has joined. 05:34:24 -!- roasted42 has quit (Changing host). 05:34:24 -!- roasted42 has joined. 05:34:25 -!- roasted42 has changed nick to TheM4ch1n3. 05:49:28 they whould draw the plot to a jpeg and upload it to a server somewhere, then respond with a link 05:52:30 how about take a link to a jpeg and then plot it as ascii? 05:53:39 ok i have no IDEA why my hands want to spell would as whould? 05:54:43 i hacked you 05:56:36 orin: because https://youtu.be/lich59xsjik?t=51s 05:57:22 -!- adu has joined. 06:01:10 -!- adu has quit (Client Quit). 06:07:35 [wiki] [[Tomagotcha!]] N http://esolangs.org/w/index.php?oldid=42455 * 0x0dea * (+1838) Add Tomagotcha! "language" 06:10:13 [wiki] [[Hello world program in esoteric languages]] http://esolangs.org/w/index.php?diff=42456&oldid=42378 * Esowiki201529A * (+5) /* A colon semicolon */ 06:12:20 -!- SgeoWeb has quit (Ping timeout: 246 seconds). 06:22:23 [wiki] [[Beatnik]] http://esolangs.org/w/index.php?diff=42457&oldid=42372 * Esowiki201529A * (+1133) /* Hello, world */ 06:24:39 -!- vodkode_ has joined. 06:33:47 -!- doesthiswork has quit (Quit: Leaving.). 06:34:44 -!- ProofTechnique has quit (Ping timeout: 272 seconds). 06:45:07 [wiki] [[Beatnik]] M http://esolangs.org/w/index.php?diff=42458&oldid=42457 * 0x0dea * (-1133) Remove incorrect "Hello, world!" program 06:53:45 https://www.youtube.com/watch?v=-4jwzan3AyA 06:55:20 [&]%@*>"Type 'beer' for beer.~Type 'quit' to quit.~"PS [&BEER'BEER],#99>:+,#&VERSE#/"No more bottles of beer on the wall.~"PS [&QUIT'QUIT]GQ+.$0> 06:55:37 [&VERSE#,^#],^#<,^#<<\,^#< I just finish by now to make OASYS assembler with C, this is how to make a kind of beer program with it. Is this program understandable to you? 06:58:19 This example program uses a pointer variable; OAC (the original compiler for OASYS) does not support pointer variables. (OAC also doesn't support macros, doesn't support calling methods before they are defined, etc.) 07:07:57 -!- j-bot has quit (Ping timeout: 248 seconds). 07:11:06 orin: thanks now i'm finally up to date tdh 07:12:31 well to 2011 anyway 07:15:49 -!- ProofTechnique has joined. 07:39:02 What part didn't you understand? 07:44:45 -!- magician has joined. 07:47:01 -!- Guest3780 has quit (Ping timeout: 246 seconds). 07:47:01 -!- magician has changed nick to Guest3780. 07:51:19 -!- variable has quit (Ping timeout: 244 seconds). 07:51:33 [wiki] [[Special:Log/move]] move * Esowiki201529A * moved [[Funciton]] to [[Function]]: Err,Function. 07:51:34 [wiki] [[Special:Log/move]] move * Esowiki201529A * moved [[Talk:Funciton]] to [[Talk:Function]]: Err,Function. 07:52:26 wtf 07:53:51 [wiki] [[Special:Log/move]] move_redir * Oerjan * moved [[Talk:Function]] to [[Talk:Funciton]] over redirect: No, it's not named that. 07:54:15 [wiki] [[Special:Log/move]] move_redir * Oerjan * moved [[Function]] to [[Funciton]] over redirect 08:13:40 [wiki] [[Special:Log/move]] move * Esowiki201529A * moved [[A programming language is a formal constructed language designed to communicate instructions to a machine, particularly a computer.]] to [[Aplifcldtcitampac]]: Err 08:14:43 [wiki] [[Aplifcldtcitampac]] http://esolangs.org/w/index.php?diff=42467&oldid=42465 * Esowiki201529A * (+14) 08:15:34 -!- j-bot has joined. 08:17:25 [wiki] [[Aplifcldtcitampac]] http://esolangs.org/w/index.php?diff=42468&oldid=42467 * Esowiki201529A * (-14) Undo revision 42467 by [[Special:Contributions/Esowiki201529A|Esowiki201529A]] ([[User talk:Esowiki201529A|talk]]) 08:18:26 [wiki] [[Special:Log/move]] move_redir * Esowiki201529A * moved [[Aplifcldtcitampac]] to [[A programming language is a formal constructed language designed to communicate instructions to a machine, particularly a computer.]] over redirect 08:18:35 -!- idris-bot has joined. 08:22:33 -!- Phantom_Hoover has joined. 08:25:25 oerjan: maybe you should tell them how to create redirects without moving twice 08:27:17 -!- zadock has quit (Ping timeout: 264 seconds). 08:36:10 -!- Melvar` has changed nick to Melvar. 08:38:36 -!- Patashu has joined. 08:39:38 [wiki] [[Gibberish/JavaScript]] http://esolangs.org/w/index.php?diff=42471&oldid=42453 * Esowiki201529A * (+77) /* Hello, World! */ 08:45:38 [wiki] [[Gibberish/JavaScript]] http://esolangs.org/w/index.php?diff=42472&oldid=42471 * Esowiki201529A * (+1) /* Hello, World! */ 08:46:44 -!- jameseb- has changed nick to jameseb. 08:48:33 -!- gniourf has joined. 08:50:51 [wiki] [[Gibberish/JavaScript]] http://esolangs.org/w/index.php?diff=42473&oldid=42472 * Esowiki201529A * (+39) /* Hello, World! */ 08:53:04 [wiki] [[Gibberish/JavaScript]] http://esolangs.org/w/index.php?diff=42474&oldid=42473 * Esowiki201529A * (+9) /* Hello, World! */ 08:54:19 [wiki] [[Gibberish/JavaScript]] http://esolangs.org/w/index.php?diff=42475&oldid=42474 * Esowiki201529A * (+1) /* Hello, World! */ 08:57:38 [wiki] [[Gibberish/JavaScript]] http://esolangs.org/w/index.php?diff=42476&oldid=42475 * Esowiki201529A * (+28) /* Hello, World! */ 09:07:31 -!- vodkode_ has quit (Ping timeout: 276 seconds). 09:07:53 elliott: the thought has appeared to me 09:13:27 -!- hassa-aravit has quit (Remote host closed the connection). 09:42:40 -!- dianne has quit (Quit: byeannes). 09:45:56 What's OASYS? 09:52:18 zzo38: does urn:bible include books banned by catholic church? 09:52:29 and you probably need an identifier for "which bible" and "which version" of the bible 09:52:41 -!- Gregor` has joined. 09:53:05 -!- Gregor` has changed nick to Guest47678. 09:53:14 or is that urn:apocrypha? 10:00:56 -!- Gregor has quit (*.net *.split). 10:00:56 -!- APic has quit (*.net *.split). 10:02:51 > plot (-x -> x) 0 (10 :: Int) 10:02:52 Pattern syntax in expression context: - x -> x 10:02:57 > plot (\x -> x) 0 (10 :: Int) 10:02:59 No instance for (RealFrac Int) arising from a use of ‘plot’ 10:02:59 In the expression: plot (\ x -> x) 0 (10 :: Int) 10:03:15 > plot (\x -> x) 0 (10 :: Float) 10:03:16 ⠀⠀⠀⠀� 10:03:16 ⠀⠀⡠⠊⠀ 10:03:16 ⡠⠊⠀⠀⠀ 10:03:36 > plot (\x -> 1/x) 1 (10 :: Float) 10:03:37 ⢄⣀⣀⣀⣀ 10:03:45 hm ok 10:03:49 > plot (\x -> 1/x) 1 (20 :: Float) 10:03:50 ⢄⣀⣀⣀⣀⣀⣀⣀⣀⣀ 10:03:59 > plot (\x -> 10/x) 1 (20 :: Float) 10:04:00 ⠂⠀⠀⠀⠀⠀⠀⠀⠀⠀ 10:04:00 ⠠⠀⠀⠀⠀⠀⠀⠀⠀⠀ 10:04:00 ⠀⠑⠢⠤⠤⣀⣀⣀⣀⣀ 10:04:07 much better. 10:17:27 -!- Phantom_Hoover has quit (Remote host closed the connection). 10:19:08 -!- Phantom_Hoover has joined. 10:24:21 -!- TheM4ch1n3 has quit (Ping timeout: 245 seconds). 10:27:50 -!- boily has joined. 10:40:20 > plot 10:40:22 No instance for (Typeable a10) 10:40:22 arising from a use of ‘show_M714213049450625511621244’ 10:40:22 In the expression: 10:40:29 hm 10:40:40 I don't suppose @src works for @let'd functions? 10:40:42 @src plot 10:40:43 Source not found. stty: unknown mode: doofus 10:45:52 > plot (\x -> x + 1/x + 1/(1+x)) 1 (20 :: Float) 10:45:53 ⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀ 10:45:53 ⠀⠀⠀⠀⠀⠀⠀⢀⠔⠁ 10:45:53 ⠀⠀⠀⠀⠀⢀⠔⠁⠀⠀ 10:46:10 > plot (\x -> x + 1/x + 1/(1+x) + 1/(1/(1+x)))) 1 (20 :: Float) 10:46:12 :1:45: parse error on input ‘)’ 10:46:15 > plot (\x -> x + 1/x + 1/(1+x) + 1/(1/(1+x))) 1 (20 :: Float) 10:46:17 ⠀⠀⠀⠀⠀⠀⠀⠀⠀� 10:46:17 ⠀⠀⠀⠀⠀⠀⠀⠀⠠⠁ 10:46:17 ⠀⠀⠀⠀⠀⠀⠀⠠⠁⠀ 10:51:53 hm 10:52:01 I found a way to calculate log(2) o_O 10:52:17 sum_{i=1}^{N} (1/(N+i)) 10:52:22 approaches log(2) 10:53:24 sum_{i=1}^{N} (1/(x*N+i)) approaches log(1+x^-1) 10:54:03 so by choosing x I can calculate every log \o/ 10:54:03 | 10:54:03 /`\ 10:56:07 mroman, how fast is the convergence 11:00:27 I don't know. 11:00:34 can wolframalpha tell me that? 11:01:50 It doesn't understand convergence rate 11:02:02 you're approximating 1/x by a step function? usually that ends up with with an O(1/N) error term; with some luck, O(1/N^2) if you center the steps on the curve (but you didn't). 11:03:06 I'm approximating log 11:03:23 (1/(x*N+i)) <-- not here 11:03:55 -!- Guest47678 has changed nick to Gregor. 11:04:18 @def myLog N x = sum [1/(x*N+i)|<-[1..N]] 11:04:19 .L.hs:162:7: Not in scope: data constructor ‘N’ 11:04:20 11:04:20 .L.hs:162:27: Not in scope: data constructor ‘N’ 11:04:24 -!- Gregor has changed nick to Guest75683. 11:04:30 @def myLog n x = sum [1/(x*n+i)|<-[1..n]] 11:04:31 .L.hs:162:34: Not in scope: ‘|<-’ 11:04:35 @def myLog n x = sum [1/(x*n+i)|i<-[1..n]] 11:04:38 Defined. 11:04:48 > myLog 10 1 11:04:50 0.6687714031754279 11:04:54 > logBase 2 10 11:04:55 3.3219280948873626 11:04:59 > logBase 10 2 11:05:00 0.30102999566398114 11:05:02 hu 11:05:12 eh 11:05:14 > log 2 11:05:15 0.6931471805599453 11:05:22 > myLog 100 11:05:23 Double> 11:05:28 > myLog 100 1 11:05:36 0.690653430481824 11:05:36 > myLog 1000 1 11:05:38 0.6928972430599376 11:05:46 > myLog 10000 1 11:05:47 0.6931221811849484 11:05:59 doesn't look like it converges fast :) 11:06:02 > myLog 100000 1 11:06:03 0.6931446805661916 11:06:18 -!- nszceta has joined. 11:06:21 10000 steps for four digits isn't that fast I guess 11:06:26 :i plot 11:06:40 > myLog 100000 2 11:06:42 0.40546427477598784 11:06:45 > log (3/2) 11:06:46 0.4054651081081644 11:06:54 :t plot 11:06:55 (Enum a1, RealFrac a) => (a1 -> a) -> a1 -> a1 -> Doc 11:08:17 What you're doing is to evaluate int_{x}^{x+1} 1/x dx = log(1+1/x) by a (lower) Riemann sum. 11:08:32 @def myLog n x = (sum [1/(x*(n+i))|i<-[1..n]])*x 11:08:33 .L.hs:162:1: Warning: 11:08:33 Pattern match(es) are overlapped 11:08:33 In an equation for ‘myLog’: myLog n x = ... 11:08:38 @def myLog' n x = (sum [1/(x*(n+i))|i<-[1..n]])*x 11:08:42 Defined. 11:08:46 > myLog' 100 1 11:08:48 0.690653430481824 11:09:04 > [log 2, myLog 100 1, myLog' 100 1] 11:09:05 [0.6931471805599453,0.690653430481824,0.690653430481824] 11:10:27 @def let myLog n x = (sum [1/(x*(n+i-1/2))|i<-[1..n]])*x in myLog 100 1 11:10:27 Parse failed: TemplateHaskell is not enabled 11:10:31 > let myLog n x = (sum [1/(x*(n+i-1/2))|i<-[1..n]])*x in myLog 100 1 11:10:33 0.6931440556283007 11:11:13 -!- hjulle has joined. 11:12:00 (This one should have an O(1/N^2) error term, but I don't want to prove that rigorously.) 11:13:40 Help! 11:13:47 I'm trapped in a channel empty of fungots. 11:14:12 (... and full of weirdos) 11:15:47 Why does the UK forbid rageporn? 11:16:04 Shouldn't it be already illegal to upload videos of other people without their consens? 11:17:43 legislating morality 11:17:46 woohoo 11:18:00 anyway, ask 8chan.co 11:18:02 We live in an age of overregulation of private life, and excessive freedom for corporations, in the name of safety and prosperity, respectively. Of course we're missing both targets. 11:18:26 Do everything within the context of a corporation and it's A-OK 11:18:34 (The prosperity one works better, for the top 1%) 11:19:19 hm. perhaps for longer sentences. 11:19:59 Hmm? 11:20:01 it also saved talk shows for another two weeks. 11:20:10 Oh, right, we had that network blip. 11:20:15 In Germany violating personalyt rights like that apperentely gives you 2 years maximum. 11:20:20 *personality 11:20:25 *apparentely 11:20:55 -!- fungot has joined. 11:22:43 mroman: Oh all my convergence rate discussion above assumes that x>0. 11:23:14 what's a summary conviction? 11:24:08 Ah. No jury. I see. 11:29:06 -!- boily has quit (Quit: UNNAMABLE CHICKEN). 11:35:32 ln(2)=sum_{k=1}^\infty 1/(k*2^k) 11:35:36 that'll be a bit faster 11:35:54 it uses the fact that ln(1/2)=-ln(2) and the standard Taylor series for ln at 1 11:36:24 the remainder of the partial sum of order N is less than 1/(N+1)2^N 11:36:41 very likely smaller, but that's a good starting point 11:37:42 more generaly, if you want a ln, you can use the arctanh function 11:50:25 -!- zadock has joined. 11:55:12 -!- ProofTechnique has quit (Ping timeout: 272 seconds). 12:11:40 -!- zadock has quit (Quit: Leaving). 12:11:43 -!- tromp_ has quit (Ping timeout: 244 seconds). 12:14:28 -!- rdococ has joined. 12:14:52 hi 12:21:01 -!- Patashu has quit (Ping timeout: 244 seconds). 12:23:45 mroman, rageporn? 12:25:23 microwave fungot 12:25:23 b_jonas: i say we should learn it. then i starved to death anyway. let's do it, well, there's diversity in scheme community. it's uniting a substantial subset of the environment 12:25:47 Phantom_Hoover: uploading sex tapes with your ex 12:26:10 revenge porn, then 12:26:10 I wonder if it's possible to create a language, without storage, that is turing complete anyway? 12:26:18 oh. 12:26:22 My english fucked up again :( 12:26:24 rageporn just sounds like people having sex while very, very angry 12:26:24 Yeah, revenge porn. 12:26:26 rdococ: lambda calculus? 12:26:47