00:05:08 that's what they build supercomputers out of 00:05:12 lenovo thinkpads 00:08:29 QUINTHELLOPIA! 00:08:33 BYETOPIA! 00:08:40 -!- boily has quit (Quit: FLUTTERING CHICKEN). 00:10:24 fluttring chicken? 00:50:06 shachaf: oh dear, i was vaguely thinking about Banjo... 01:04:02 98% 01:05:26 how do i call the unicode character identifier thingy? 01:05:46 there was a bot here that did it 01:06:37 oh now it's starting to download something else too. 01:11:13 although if so, there will be another tie, and how do they break that? 01:11:30 (banjo) 01:11:49 izabera: `unidecode, you mean? 01:12:00 `unidecode – 01:12:01 [U+2013 EN DASH] 01:12:05 ah en dash 01:12:06 thanks 01:13:22 `` unidecode x y z 01:13:23 [U+0078 LATIN SMALL LETTER X] [U+0020 SPACE] [U+0079 LATIN SMALL LETTER Y] [U+0020 SPACE] [U+007A LATIN SMALL LETTER Z] 01:13:30 what 01:13:41 wtf this is wrong 01:13:47 `` type unidecode 01:13:47 unidecode is /hackenv/bin/unidecode 01:13:57 `` file /hackenv/bin/unidecode 01:13:58 /hackenv/bin/unidecode: Python script, ASCII text executable 01:14:05 `` cat /hackenv/bin/unidecode 01:14:06 #!/usr/bin/env python \ import os, sys \ import unicodedata \ s = u" ".join("[U+{0:04X} {1}]".format(ord(c), unicodedata.name(c, "DUNNO")) for c in " ".join(sys.argv[1:]).decode("utf-8")).encode("utf-8") \ if u"DUNNO" in s: \ os.execvp("multicode", ["multicode"] + sys.argv[1:]) \ else: \ print s 01:15:01 here goes nothing... 01:15:08 why is it joining them with spaces? 01:15:12 <\oren\> izabera: why would it be wrong? 01:15:13 that's stupid 01:15:29 what, it gave up immediately. 01:36:47 Perhaps I should create a suite of programs demonstrating different abstract machines... 01:38:28 To teach people about CS 01:39:04 doesn't that require like 40+ years of experience 01:39:29 izabera: Is that directed at me? 01:39:43 yes... 01:39:46 It doesn't require THAT much experience to start on it. I mean, I understand the basic abstract machines 01:39:54 And this is just an introductory thing for people 01:40:36 It would cover things like Turing and Minsky machines 01:50:26 -!- adu has joined. 01:58:12 Hadu! 01:58:25 (Halldu?) 02:00:22 what? 02:01:26 adu: I was attempting to say hi 02:02:32 oerjan: of course you were 02:02:35 oerjan: banjo, demigod of corrupt ops 02:03:09 I used to have my client notify me anytime my nick appeared anywhere, but I think I configured it only only match on words, because I was getting too many hits on "graduate" 02:03:28 you're also an adult 02:03:37 izabera: :/ 02:04:06 just learn to gradually ignore them 02:04:21 :/ 02:04:44 `` grep adu /usr/share/dict/words 02:04:45 grep: /usr/share/dict/words: No such file or directory 02:04:46 xD 02:04:48 aww 02:05:08 -!- Sgeo_ has quit (Quit: Leaving). 02:05:14 http://arin.ga/3H3BbT/raw 02:05:22 adu: I'm trying to learn about Epistemic logic and Temporal logic, so I can mash them together into a horrible mess 02:05:33 adu: Also, I invented Probabilistic Combinatory Logic. 02:06:11 Hm... 02:06:22 I'm trying to think of a property of the world I can invent a logic about 02:06:34 <\oren\> esprit du corps: spirit of the corpse 02:06:43 I think Temporal logic is just regular logic plus the fermionic principle 02:06:57 adu: It's logic of time xD 02:07:13 Though I WOULD like to see wibbly wobbly temporal logic, which allows for time travel 02:07:17 B| 02:07:26 timey wimy? 02:07:37 adu: Exactly 02:07:54 thats my favorite kind of logic :) 02:08:05 So do you have any ideas for what I can make a logic about? Time and knowledge are definitely taken. 02:08:18 is "B" a reference to the new sonic shades? 02:08:21 Time/knowledge would be cool, but not original enough 02:08:31 adu: No, it was just a coolface. 02:08:41 Spatial logic I tried, but it's kind of stupid 02:08:55 EsoLogic perhaps? 02:08:57 That'd be cool 02:08:58 hppavilion[1]: do you watch Dr.Who? 02:09:02 Yes. 02:09:18 and you don't know about the sonic shades? 02:09:56 -!- Phantom_Hoover has quit (Read error: Connection reset by peer). 02:10:20 adu: Nope. I only watch it on netflix, because that's what I have access to 02:10:36 (I thought "sonic shades" was about a video game character xD) 02:10:46 s/ a /the/ 02:10:53 ms/the/ the / 02:12:11 I have netflix 02:12:28 it basically has all the B movies I never wanted to watch 02:12:43 Fair enough 02:13:22 some of my favorite movies are still not on netflix 02:13:45 like Idiocracy, Serenity, Battlestar Galactica 02:14:12 [wiki] [[Epistemic logic]] N http://esolangs.org/w/index.php?oldid=45442 * Hppavilion1 * (+98) Created page, maybe possibly might make good someday perhaps 02:14:47 [wiki] [[Epistemic logic]] M http://esolangs.org/w/index.php?diff=45443&oldid=45442 * Hppavilion1 * (+9) Stub 02:14:53 -!- andrew__ has joined. 02:15:16 hppavilion[1]: so does Epistemic logic cover X knows A, and Y knows B, so Z can't tell X C until Y tells Z D 02:16:03 adu: If you mix it with temporal logic and define some terms (e.g. "tell") 02:16:06 Then yes 02:16:18 I'm going to make EsoLogic 02:16:39 it already sounds like cells and propogators 02:19:54 hppavilion[1]: my first thought was that it was the study of epistemology 02:20:07 epistemologyology 02:20:50 -!- Sgeo has joined. 02:22:23 http://esolangs.org/wiki/Brainfuck_constants about this page 02:23:01 how does one prove that there's no shorter sequence? 02:24:14 oh, shortest known 02:24:20 so they've been created by humans 02:24:56 izabera: Alternatively, they could be brute forced by a computer 02:26:32 i have a "language" that has 5 symbols: 'a' '{' ',' '}' ' ' 02:26:48 it doesn't do much 02:27:18 `` num () { echo "$#"; }; num a 02:27:19 1 02:27:21 `` num () { echo "$#"; }; num a{,} 02:27:22 2 02:27:24 `` num () { echo "$#"; }; num a{,,} 02:27:25 3 02:27:28 `` num () { echo "$#"; }; num a{,,}{,,} 02:27:29 9 02:27:37 `` num () { echo "$#"; }; num a{,,}{,,} a{,,,}{,,,} 02:27:38 25 02:27:57 i want to find the shortest sequence that produces a given number 02:28:53 so for 25 there's "a{,,}{,,} a{,,,}{,,,}" but also "a{,,,,}{,,,,}" which is much shorter 02:29:27 -!- singingboyo has joined. 02:29:28 `` num () { echo "$#"; }; num a{,{,}{,}}{,,,} 02:29:29 20 02:29:29 -!- singingboyo has quit (Client Quit). 02:29:43 (1+2*2)*4. 02:29:45 nesting them isn't particularly helpful 02:29:55 izabera: yeah, I guess so 02:30:16 aside from a few exceptions, finding the shortest sequence is easy for composite numbers 02:30:23 primes are harder 02:31:28 `` num () { echo "$#"; }; num a{,,,}{,,,}{,,} a{,,} # 51 as 48+3 02:31:29 51 02:31:43 `` num () { echo "$#"; }; num a{,,,,}{,,,,}{,} a # 51 as 50+1 02:31:44 51 02:32:00 -!- singingboyo has joined. 02:32:07 so uhm 02:32:23 any idea other than bruteforcing it? 02:34:34 Hm... 02:37:30 [wiki] [[EsoLogic]] N http://esolangs.org/w/index.php?oldid=45444 * Hppavilion1 * (+1244) Created Page 02:38:27 EsoLogic is really just going to turn into a way to model the world. 02:38:30 Weird. 02:38:55 [wiki] [[EsoLogic]] M http://esolangs.org/w/index.php?diff=45445&oldid=45444 * Hppavilion1 * (+1) Formatting 02:41:22 izabera: I have experimented with a form of i*j*...-1 02:41:38 which is possible with {,a}{,a}... 02:41:52 show it? 02:42:24 well, I couldn't come up with an example that gives a shorter result than an ordinary case 02:42:40 -!- GoToTell has joined. 02:43:37 although I have an example of highly composite number: 69 = a{,,}{{,,}{,,,,,,},,} 02:43:52 probably this problem is not as easy as it seems 02:44:19 oh 02:44:23 you're right 02:44:48 The max size for any number would be a: num a[,] a[,] a[,] ... and so on, right? 02:45:16 max size would be a a a a a a a a 02:45:30 well, for given n the upper bound is `a{}` 02:45:42 except for n=2 02:45:45 Right. 02:45:45 and 1 02:46:30 But if you have an max size then you can brute force all combination of multiplication and additions. 02:48:12 Hmn, I wonder if it correlates to representing numbers in different bases. 02:48:43 so uhm 02:49:21 well i'll write the bruteforcer 02:50:11 -!- adu has quit (Quit: adu). 02:50:42 Always fun to code, if nothing else. 02:52:15 -!- hppavilion[1] has quit (Ping timeout: 240 seconds). 02:55:55 i'm also dumb and forgot that 51 isn't prime 02:57:07 funny enough, 50+1 is shorter than 3*17 02:57:15 `` factor 51 02:57:16 51: 3 17 02:57:21 `` num () { echo "$#"; }; num a{,,}{{,,}{,,,,},,} # 3*17 02:57:21 51 02:59:28 <\oren\> `` num () { echo "$#"; }; num a{,,}{,,} # 02:59:29 9 02:59:34 <\oren\> `` num () { echo "$#"; }; num a{,,}{,} 02:59:35 6 03:00:42 <\oren\> OH 03:01:01 <\oren\> I see, it's normal bash syntax, WTF 03:01:06 lol 03:01:18 yes it's just regular brace expansion 03:02:23 <\oren\> `` num () { echo "$#"; }; num a{{,,,,,}{,,,,,}{,,},} 03:02:24 109 03:02:43 <\oren\> `` num () { echo "$#"; }; num a{{,,,,}{,,,,}{,},} 03:02:44 51 03:04:00 <\oren\> `` num () { echo "$#"; }; num a{,,,,}{,,,,}{,} 03:04:01 50 03:04:12 <\oren\> `` num () { echo "$#"; }; num a{,,,,}{,,,,,} 03:04:13 30 03:04:15 <\oren\> `` num () { echo "$#"; }; num a{,,,,}{,,,,,,} 03:04:16 35 03:04:19 <\oren\> `` num () { echo "$#"; }; num a{,,,,,}{,,,,,,} 03:04:20 42 03:04:49 <\oren\> wait why am I doing this in the channel 03:05:29 http://ix.io/mgh 03:05:36 simple programming. 03:05:37 what 03:05:55 you're fast 03:05:57 additive only, to be exact 03:06:11 http://ix.io/mgi.py is a source code 03:06:33 hmm, seems to be a bit incorrect 03:06:48 I set up the recurrence wrongly 03:07:00 bracing requirement is a bit hard to get it right 03:07:49 * lifthrasiir afk 03:10:28 -!- Vinegar has quit (Ping timeout: 250 seconds). 03:11:43 -!- ent0nces has joined. 03:11:52 -!- staffehn_ has quit (Quit: No Ping reply in 180 seconds.). 03:12:12 -!- staffehn has joined. 03:12:44 -!- hppavilion[1] has joined. 03:13:11 okay, fixed: http://ix.io/mgl (source code http://ix.io/mgk.py) 03:13:15 -!- andrew__ has quit (Ping timeout: 240 seconds). 03:13:40 num can be also improved, let me check it out 03:13:59 good job :) 03:16:02 well, shorter by one byte in some cases, but not further. 03:16:08 -!- ent0nces has quit (Ping timeout: 246 seconds). 03:16:28 especially it seems that composite + small number k is useless for k>1 03:17:02 -!- Vinegar has joined. 03:17:05 anyway, http://ix.io/mgn.py is the new code 03:17:26 I'm yet to investigate subtractive approach though 03:17:52 -!- ent0nces has joined. 03:21:47 -!- hppavilion[1] has quit (Ping timeout: 264 seconds). 03:25:56 izabera: okay, I have a concrete example now 03:26:08 `` num () { echo "$#"; }; num a{,}{,{,,,}{,,,{,,,}{,,,}{,,,}}} # additive 03:26:09 538 03:26:16 `` num () { echo "$#"; }; num {,a{,}{,,,,}}{,a{,,}{,,,}{,,,}} # subtractive 03:26:17 538 03:26:24 this is the smallest example I have 03:26:46 683 and 934 are others below 1000 03:26:51 -!- andrew__ has joined. 03:27:44 `` num () { echo "$#"; }; num a{,}{,,,,}}{,a{,,}{,,,}{,,,} 03:27:44 480 03:28:06 wait 03:28:12 i removed the wrong ones 03:28:12 new list up to 10000: http://ix.io/mgp (code at http://ix.io/mgq.py) 03:28:40 `` num () { echo "$#"; }; num a{,}{,,,,}; num {,a{,}{,,,,}} 03:28:41 10 \ 10 03:28:51 -!- codergeek42 has joined. 03:32:59 why is that subtractive? 03:35:34 you're doing 10 + 48 + 10*48 so i don't see the subtraction? 03:36:03 anyway {a,} is neat 03:39:21 and your approach is very nice but i'm not sure you can produce the correct result without actually bruteforcing it (but i don't have a proof for this) 03:54:53 -!- Tod-Autojoined has changed nick to TodPunk. 03:54:54 [wiki] [[EsoLogic]] http://esolangs.org/w/index.php?diff=45446&oldid=45445 * Hppavilion1 * (+383) New things! Yay! 03:55:24 -!- hppavilion[1] has joined. 03:56:18 but most importantly: http://www.wizard101central.com/forums/showthread.php?456268-New-Jewels-Dual-Blades-for-all-schools! 03:56:40 new jewels with two +40% buffs at level FIFTEEN?? 03:56:46 that's insane! 03:57:42 ice blade is +45%! wtf! 03:58:33 and you can have two of those jewels! 03:59:05 wizard101 is a great game guys, you should definitely try it 03:59:48 omg i can have both balance AND ice blades omg omg omg 04:09:34 -!- adu has joined. 04:09:51 I want to make a Modal Logic programming language... 04:10:12 A sort of epistemic/probabilistic/deontic/temporal programming language 04:11:52 hppavilion[1]: like prolog? 04:12:09 adu: A logic language like prolog, yes 04:12:22 But with Temporal/epistemic/deontic/probabilistic properties 04:12:49 Possibly a bit fuzzy 04:20:34 gah i take a short break, and *poof* another reboot 04:21:33 -!- hppavilion[1] has quit (Ping timeout: 255 seconds). 04:21:50 i suspect some of the programs that start up automatically when it's "idle" crashes it. 04:22:10 on the bright side, IE remembered its tabs this time. 04:24:25 hm next time i put it to sleep before i walk away for any length of time. 04:27:35 -!- Vinegar has quit (Ping timeout: 276 seconds). 04:30:11 -!- andrew__ has quit (Ping timeout: 276 seconds). 04:31:03 -!- andrew__ has joined. 04:34:22 -!- ent0nces has quit. 04:35:12 -!- hppavilion[1] has joined. 04:39:56 -!- heroux has quit (Ping timeout: 276 seconds). 04:41:37 Hm... 04:41:43 What should I call my logic language? 04:41:59 loglan 04:43:35 taken 04:44:19 "taken" it is xD 04:45:36 -!- heroux has joined. 04:47:01 how can i find the nearest lower prime power? 04:47:34 i mean, the highest number that's a power of a prime number, that's lower than my number 04:48:22 127 is my number, 125 is the nearest lower prime power 04:48:34 not sure if this thing has a name 04:49:05 izabera: Lookup table|Brute force|prime checking algorithm|solve the Reimann Hypothesis 04:49:53 impractical|???|yeah that|that's the next step 04:50:00 I recommend the last one. 04:50:02 Wait, what? 04:50:26 OK, just to make sure, are you ACTUALLY working on the Riemann Hypothesis? 04:51:14 no silly 04:51:42 OK, good. 04:51:52 I have seen the future when they prove it has no solution. 04:52:03 It seems really obvious to them. 04:53:31 -!- Melvar` has joined. 04:54:03 -!- ocharles___ has joined. 04:54:36 Helvar! 04:54:37 ` 04:54:38 /home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: : not found 04:54:39 ! 04:54:59 lifthrasiir: Have any better names? 04:55:52 -!- staffehn_ has joined. 04:56:32 -!- PinealGlandOptic has joined. 04:56:35 -!- int-e_ has joined. 04:56:49 -!- digitalcold has joined. 04:56:49 -!- atehwa_ has joined. 04:56:52 -!- Sprocklem_ has joined. 04:58:42 -!- mbrcknl_ has joined. 04:59:38 <\oren\> I updated the font 04:59:58 <\oren\> this time with autogenerated char count at the end of allchars.htm 05:00:01 -!- Melvar has quit (Ping timeout: 246 seconds). 05:00:02 -!- staffehn has quit (Ping timeout: 246 seconds). 05:00:05 -!- ocharles__ has quit (Ping timeout: 246 seconds). 05:00:07 -!- Xe has quit (Ping timeout: 246 seconds). 05:00:08 -!- Sprocklem has quit (Ping timeout: 246 seconds). 05:00:09 -!- mbrcknl has quit (Ping timeout: 246 seconds). 05:00:10 -!- digitalc1ld has quit (Ping timeout: 246 seconds). 05:00:10 -!- PinealGl1ndOptic has quit (Ping timeout: 246 seconds). 05:00:10 -!- int-e has quit (Ping timeout: 246 seconds). 05:00:11 -!- atehwa has quit (Ping timeout: 246 seconds). 05:00:11 -!- Gregor has quit (Ping timeout: 246 seconds). 05:00:14 link link link link 05:00:17 hppavilion[1]: moment 05:00:19 -!- adu has quit (Ping timeout: 240 seconds). 05:00:20 -!- Gregor has joined. 05:00:24 <\oren\> http://www.orenwatson.be/allchars.htm 05:00:25 too late 05:00:26 Sure 05:00:46 hppavilion[1]: no, I meant the literal "moment" 05:00:47 -!- Xe- has joined. 05:00:52 or its shorthand, "mom" 05:01:01 That's what I thought xD 05:01:03 <\oren\> 5601 characters, total 05:01:09 I knew you meant the literal "moment" 05:01:28 * lifthrasiir thinks he probably should make a font 05:01:33 -!- adu has joined. 05:01:40 You'd come in third AT LEAST if you did 05:01:46 -!- Xe- has changed nick to Xe. 05:02:12 hppavilion[1]: who were the first and the second? (and just to be sure, do they include oren?) 05:02:55 lifthrasiir: oren is first, I'm second, assuming no one has done it before us 05:03:00 On this channel, that is 05:03:09 <\oren\> b_jonas I think has his own font 05:03:12 do you have your own font? 05:03:14 \oren\: your #define's are the best 05:03:30 actually I have my own font as well, very old ASCII-limited one though 05:03:33 lifthrasiir: Yes, but it can't be rendered outside of a special program I made 05:03:50 <\oren\> izabera: which ones? 05:03:55 Well, unless one were to make another renderer or a compiler. 05:03:56 #define brase break;case 05:04:01 #define brault break;default 05:04:05 <\oren\> oh. yeah I like those 05:04:11 https://github.com/lifthrasiir/angolmois/blob/625f843/angolmois.c#L876-L916 05:04:16 -!- codergeek42 has quit (Quit: Ex-Chat). 05:04:17 this is how it is encoded :) 05:04:20 -!- mbrcknl_ has changed nick to mbrcknl. 05:04:20 -!- ocharles___ has changed nick to ocharles__. 05:04:47 what is that o.o 05:05:27 the "bitmap" font composed of a filled square or four kinds of right triangle or their impositions as well 05:05:43 ...which is then compressed. 05:06:00 <\oren\> and apparently encoded in base 96? 05:06:06 it's LZ77 05:06:25 -!- GoToTell_ has joined. 05:06:40 33 through 97 encodes a literal code (which is remapped through `words`) 05:07:25 98 through... 126? I don't know, but anyway they encode a count which is followed by a distance offseted by 32. 05:08:10 <\oren\> Whoa, innovative 05:08:47 -!- GoToTell has quit (Ping timeout: 252 seconds). 05:09:15 \oren\: my original goal is to make a minimal game in the minimal number of bytes, so it was inevitable 05:09:35 I probably crushed the whole game into 15,000 bytes of really unreadable source code 05:10:05 then I cleaned it up for making it a bit easier to read while still being minimal (i.e. limited to 2,000 lines of code) 05:10:41 <\oren\> do you have a sample image? 05:12:44 -!- GoToTell_ has changed nick to GoToTerll. 05:13:07 \oren\: https://raw.githubusercontent.com/lifthrasiir/angolmois-rust/gh-pages/img/angolmois1.jpg https://raw.githubusercontent.com/lifthrasiir/angolmois-rust/gh-pages/img/angolmois2.jpg 05:14:53 -!- variable has joined. 05:17:02 <\oren\> Nice! 05:17:30 \oren\: http://stackoverflow.com/questions/13955163/imitating-a-blink-tag-with-css3-animations add it to http://www.orenwatson.be/ansi.htm 05:19:05 -!- tromp__ has joined. 05:20:13 -!- singingb1yo has joined. 05:20:32 -!- Sprocklem has joined. 05:20:44 -!- pikhq_ has joined. 05:23:25 -!- Gregor` has joined. 05:25:21 -!- Gregor has quit (*.net *.split). 05:25:21 -!- Sprocklem_ has quit (*.net *.split). 05:25:22 -!- singingboyo has quit (*.net *.split). 05:25:23 -!- tromp has quit (*.net *.split). 05:25:23 -!- Nithogg has quit (*.net *.split). 05:25:25 -!- pikhq has quit (*.net *.split). 05:25:26 -!- Hoolootwo has quit (*.net *.split). 05:25:26 -!- j-bot has quit (*.net *.split). 05:26:54 -!- Hoolootwo has joined. 05:27:45 -!- Nithogg has joined. 05:31:29 Hm... 05:31:38 I'm trying to think of a new idea for a modal logic 05:32:26 hppavilion[1]: solve the Reimann Hypothesis is a great name for a logic language 05:32:39 xD 05:32:53 STRH 05:33:29 Time, Responsibility, Knowledge, Belief 05:33:32 What else? 05:35:24 Graph Logic perhaps? 05:37:56 ooo SemanticLang 05:39:11 adu: ? 05:39:42 The Semantic Web is all about graphs 05:40:01 hppavilion[1]: I might have spent too much time reading about OpenCyc and OWL/RDF 05:40:17 Ah 05:40:41 for me, RDF is a way of life 05:40:56 it's like a lens you see the world thru 05:42:08 without the RDF worldview, you might make an HTTP log format like http://www.softwareishard.com/har/schema/HTTPArchiveV12.xsd 05:42:24 with the RDF worldview, you might make an HTTP log format like http://www.w3.org/TR/HTTP-in-RDF10/ 05:44:11 http://www.softwareishard.com/blog/har-12-spec/ is the JSON spec that goes along with HTTPArchiveV12.xsd 05:49:56 [wiki] [[Aubergine]] http://esolangs.org/w/index.php?diff=45447&oldid=45415 * Quintopia * (-9) /* Examples */ Golfed the truth-machine some more 05:58:13 -!- Vinegar has joined. 06:07:19 -!- Vinegar has quit (Ping timeout: 240 seconds). 06:08:28 -!- Vinegar has joined. 06:14:35 -!- atehwa_ has changed nick to atehwa. 06:16:54 [wiki] [[Aubergine/aubergine.py]] http://esolangs.org/w/index.php?diff=45448&oldid=45416 * Quintopia * (-45) oops this was debugging 06:21:59 -!- adu has quit (Quit: adu). 06:24:15 -!- variable has quit (Ping timeout: 240 seconds). 06:29:45 [wiki] [[Aubergine]] http://esolangs.org/w/index.php?diff=45449&oldid=45447 * Quintopia * (-65) /* Hello, world! */ 06:29:57 [wiki] [[Aubergine]] http://esolangs.org/w/index.php?diff=45450&oldid=45449 * Quintopia * (+2) /* Hello, world! */ 06:31:36 -!- J_Arcane has quit (Ping timeout: 255 seconds). 06:32:17 [wiki] [[Aubergine/aubergine.py]] http://esolangs.org/w/index.php?diff=45451&oldid=45448 * Quintopia * (-146) Ref impl allows jumping outside of program in either direction to halt 06:33:07 Hm... 06:33:50 Am I correct in my calculuations that B(BBB) = a(bc)(de)(fg) wher B is from the B,C,K,W system (Babc = a(bc)) 06:33:53 ? 06:47:04 where are those small letters coming from? 06:47:08 -!- GoToTerll has quit (Quit: HydraIRC -> http://www.hydrairc.com <- IRC with a difference). 06:47:40 myname: Right, right, forgot. 06:47:49 Those are the things it's applied to 06:48:05 B(BBB)abcdefg = a(bc)(de)(fg) 06:48:11 It seems like it shouldn't be right 06:50:16 -!- Vinegar has quit (Ping timeout: 244 seconds). 06:50:32 [wiki] [[Aubergine/aubergine.py]] http://esolangs.org/w/index.php?diff=45452&oldid=45451 * Quintopia * (+2) this is out of bounds too according to ref impl 06:51:24 my attempt: (B(BBB))abcdefg = B(BBB)abcdefg = (BBB)(ab)cdefg = BBB(ab)cdefg = B(B(ab))cdefg = B(ab)(cd)fg = ab((cd)f)g 06:51:58 myname: Combinatory logic is hard :/ 06:52:13 [wiki] [[Aubergine]] http://esolangs.org/w/index.php?diff=45453&oldid=45450 * Quintopia * (-33) /* Examples */ Golfed the quine some more 06:52:31 Remember that I had to figure out how many variables there were in the process, so abcdefg might be too many 06:53:44 [wiki] [[Combinatory logic/Analysis of combinators]] http://esolangs.org/w/index.php?diff=45454&oldid=45436 * Hppavilion1 * (+2217) Various new combinator walkthroughs, some might even be right! 06:56:48 [wiki] [[Aubergine]] http://esolangs.org/w/index.php?diff=45455&oldid=45453 * Quintopia * (+0) /* Hello, world! */ Original had a comma 07:05:29 -!- Vinegar has joined. 07:06:50 [wiki] [[Combinatory logic/Analysis of combinators]] http://esolangs.org/w/index.php?diff=45456&oldid=45454 * Hppavilion1 * (+570) MOAR combinators 07:15:38 -!- hppavilion[1] has quit (Ping timeout: 260 seconds). 07:19:21 -!- hppavilion[1] has joined. 07:26:15 -!- hppavilion[1] has quit (Ping timeout: 240 seconds). 07:29:44 -!- lleu has quit (Quit: That's what she said). 07:36:58 -!- hppavilion[1] has joined. 07:38:13 -!- Patashu has joined. 07:42:41 -!- paul2520_ has changed nick to paul2520. 07:43:43 -!- paul2520 has changed nick to Guest43336. 08:06:33 hppavilion[1]: a(bc)(de)(fg) = B(a(bc)(de))fg = BB(a(bc))(de)fg = B(BB(a(bc))defg = BB(BB)(a(bc))defg = B(BB(BB))a(bc)defg = B(B(BB(BB))a)bcdefg = BB(B(BB(BB)))abcdefg 08:07:18 it's a mechanical transformation that way 08:07:54 @pl \a b c d e f g -> a(b c)(d e)(f g) 08:07:54 ((((((.) .) .) . (.)) .) .) . (.) 08:09:04 argh is that the same 08:10:20 @pl \a bc d e f g -> a bc(d e)(f g) 08:10:20 (((((.) .) .) . (.)) .) 08:11:48 @pl \abc d e f g -> abc(d e)(f g) 08:11:48 (((.) .) .) . (.) 08:12:55 i suppose there might be alternative paths 08:44:23 -!- Vinegar has quit (Ping timeout: 265 seconds). 08:47:35 -!- hppavilion[1] has quit (Ping timeout: 240 seconds). 08:59:24 \oren\: re char count, thanks 08:59:28 it says 5601 09:06:12 \oren\: since you're now extracting the set of characters automatically, you can also add some automatic checks: make sure that all characters are on the demo page, make sure that all printable characters encodable in certain byte encodings are all in your font, say iso-8859-{1,2,4,15,16}, cp125{2,0,1}-new, ibm{437,850,852} 09:10:14 Especially in ibm437 because that's important, has strange characters, and the unicode encoding is not well defined historically. 09:35:44 -!- andrew__ has quit (Remote host closed the connection). 09:36:39 -!- andrew__ has joined. 09:50:04 -!- Frooxius has quit (Read error: Connection reset by peer). 09:50:11 -!- Frooxius has joined. 10:01:10 -!- oerjan has quit (Quit: Nite). 10:31:36 -!- mroman has joined. 10:31:47 fungot: Hi 10:31:47 mroman: to use the janko layout :( en tii� ei toimi fnord vaan sanoo ett� mulla ei oo fnord ja nyt koko fnord haisee fnord. let me check 10:31:59 fungot: Is that a keyboard layout? 10:31:59 mroman: who needs two asses?' as if vim is some unknown entity 10:32:23 fungot: two donkeys are better than one. 10:32:24 mroman: each blogger has the ability to send items fnord. ( and we didn't have autocad) ( else) 10:33:10 -!- ais523 has joined. 10:34:43 fungot: but two mules are even better than two donkeys 10:34:44 b_jonas: and very very bad explanation lying on pastebin and i'm adding the last bits; the interpreter is in vm/ heap/ stack/ probably? 10:57:50 fungot: Are you a mule? 10:57:51 mroman: although i guess tentacles could be called " main" procedures at the top level is really just a suburb of new york. i almost have to. 11:36:17 -!- boily has joined. 11:40:31 ^style 11:40:33 Available: agora alice c64 ct darwin discworld enron europarl ff7 fisher fungot homestuck ic irc* iwcs jargon lovecraft nethack oots pa qwantz sms speeches ss wp youtube 11:41:35 -!- Patashu has quit (Ping timeout: 240 seconds). 11:43:23 fungot: fnord? 11:43:24 boily: in case you haven't noticed. " heh." ( if that were the subject of a cfj was used as an interpreted has failed this ' local' served up an english breakfast, complete with ftl ship, while he watches them via a microscope. 11:44:03 a Full English Breakfast delivered by FTL ship. I could see myself eating that last Sunday. 11:45:10 fungot: you still don't really understand punctuation, do you? 11:45:10 b_jonas: and at this point in time. 11:46:14 fungot's spacetime alignment is a little fuzzy... 11:46:14 boily: fnord annotated 7907 with " rsa" at http://paste.lisp.org/ display/ fnord? starts with lambda calculus 11:47:52 > let loeb x = go where go = fmap ($ go) x in tail . loeb $ const 1 : map (fmap sum . take) [0..] 11:47:54 [0,1,1,2,3,5,8,13,21,34,55,89,144,233,377,610,987,1597,2584,4181,6765,10946,... 11:56:19 -!- vjoba has joined. 11:57:42 `relcome vjoba 11:57:44 vjoba: 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 EFnet or DALnet.) 11:57:58 Taneb: Tanelle. that is vile. 11:58:24 boily: I was trying to get the triangle numbers, is the worst thing 11:59:11 that is terrifyingly vile. 11:59:29 -!- vjoba has left ("Konversation terminated!"). 12:00:03 beuh, a fleeing `relcomed newcomer... 12:00:20 Maybe they're going to DALnet or EFnet 12:01:22 Or maybe they really do not like rainbows 12:03:05 `perl -le$==1,(1x$_)=~/(^)(1|11\1)*(?{$=++})^/,print$=for 0..20 12:03:06 2 \ 3 \ 5 \ 8 \ 13 \ 21 \ 34 \ 55 \ 89 \ 144 \ 233 \ 377 \ 610 \ 987 \ 1597 \ 2584 \ 4181 \ 6765 \ 10946 \ 17711 \ 28657 12:05:06 I have no idea how that works 12:05:48 * boily eats breakfast cereals. cereals are simple. 12:06:55 Taneb: http://www.perlmonks.com/?node_id=796576 and follow links from there 12:07:33 I don't have a really obfuscated fib, but.. 12:07:35 [ {.{.|:(+/ .*)^:(<20)~2 2$*i.4 12:07:40 :( 12:07:58 how do you detect cycles in a list like this? a->b b->c c->d ... z->a 12:08:18 Tortoises and hares 12:08:22 izabera: isn't there the.. yeah 12:08:32 yeah but 12:08:54 ok it's not a linked list actually 12:09:08 well the principle still works I think 12:09:22 Unless it could be a lazy infinite list 12:09:31 no it's finite 12:09:39 i'm trying to fix something in (guess what) bash 12:09:48 how bash resolves namerefs 12:11:13 i'll try to apply tortoise and hare <.< 12:23:44 -!- boily has quit (Quit: PLINTH CHICKEN). 12:27:03 -!- ais523 has quit (Quit: lunch). 12:43:18 -!- sebbu has quit (Ping timeout: 255 seconds). 12:44:27 [wiki] [[Talk:5-logic]] http://esolangs.org/w/index.php?diff=45457&oldid=14929 * Martin Büttner * (+504) 12:46:23 -!- sebbu has joined. 12:51:11 -!- andrew__ has quit (Remote host closed the connection). 12:56:53 -!- heroux has quit (Ping timeout: 250 seconds). 12:58:13 izabera: topological sorting? 12:58:44 err what 12:59:25 i didn't mean to steal your focus sorry 12:59:44 please be esoteric 12:59:51 I don't know. It's the only algorithm I associate with cycle detection in graphs. 12:59:57 well.. that's the only one I was taught at least. 13:00:43 -!- ais523 has joined. 13:01:30 You throw every node out that has no inputs 13:01:34 and you're left with cycles 13:03:30 i'm not doing anything that fancy <.< 13:15:23 :( 13:24:21 -!- heroux has joined. 13:42:24 -!- Welo has joined. 13:47:34 -!- Melvar` has changed nick to Melvar. 13:54:26 -!- mauris has joined. 14:22:42 -!- `^_^v has joined. 14:24:03 -!- mauris_ has joined. 14:25:23 -!- mauris has quit (Ping timeout: 264 seconds). 14:47:07 -!- J_Arcane has joined. 14:47:33 Question. Does the particular representation of a computability class that David Madore defines in http://www.madore.org/~david/weblog/d.2015-11-16.2337.html count as an esoteric programming language (not implementable, because it's more powerful than Turing-complete)? 14:49:07 It is well defined enough that you can write prorams for it, but it's not inteded to be practically programmed, so it might count as one, but then IA64 machine code could also count as esoteric programming language in that sense. 14:50:13 where's the english version? 14:50:26 there's none 14:50:35 it's in French 14:51:32 I think the definition of an esolang is fuzzy and weak enough that it would probably count 14:51:40 not having read it, just going by your description 14:52:02 I think the only thing that makes IA64 machine code not an esolang is that it's actually used in practice for practical purposes... 14:52:55 -!- int-e_ has set topic: int-e. 14:52:59 what... 14:53:02 -!- int-e_ has changed nick to int-e. 14:53:19 -!- int-e has set topic: The flating channel. | /ɛ̃ˈglɪʃ spɛˈliŋ ʀɘfɔʀm/ | https://dl.dropboxusercontent.com/u/2023808/wisdom.pdf http://codu.org/logs/_esoteric/ http://tunes.org/~nef/logs/esoteric/?C=M;O=D | https://esolangs.org/. 14:53:37 sometimes my brain is awfully confused :-( 14:56:37 -!- TieSoul has joined. 15:00:03 Well, that's a lie. It's always terribly confused, but it's usually much better at hiding that fact from the outside world. 15:00:04 Pity it doesn't have a name given. 15:00:08