00:07:45 ^echo @messages-loud 00:07:45 @messages-loud @messages-loud 00:07:45 mroman said 15h 32m 2s ago: fnord. 00:13:20 -!- dianne has joined. 00:16:30 ^echo what 00:16:30 what what 00:18:10 ...is that intentional behavior in order to make fungot potentially able to do interesting things with other bots? 00:18:10 quintopia: no such factoid 00:18:17 oh 00:18:43 hmm, ^echo is not bot safe? 00:18:49 i think it was intentional behavior to be silly hth 00:19:36 ^echo yields falsehood when preceded by its own quotation 00:19:37 yields falsehood when preceded by its own quotation yields falsehood when preceded by its own quotation 00:19:42 was "no such factoid" just markov output or does fungot have a factoid feature? 00:19:42 olsner: is it very hard for me to duck from the things you're about to use, without some intermediate abstraction ( except for sunterlib and sunet lateron). would that be 00:19:46 indeed fungot doesn't prevent triggering other bots 00:19:46 oerjan: to be exact it's stupid of anyone if they use php instead of another language i remember sawing you helping someone in parsing scheme, can i use that 00:20:00 but it has an extensive ignore list itself 00:20:25 olsner: markov hth 00:20:38 ^echo thanks but no 00:20:38 thanks but no thanks but no 00:20:51 tdh, I guess 00:21:44 ^echo oerjan is very what 00:21:44 oerjan is very what oerjan is very what 00:23:31 -!- Sgeo has joined. 00:23:33 ^echo > 1 00:23:33 > 1 > 1 00:23:34 False 00:26:25 -!- Sgeo has quit (Read error: Connection reset by peer). 00:40:40 ^echo ^echo 00:40:40 ^echo ^echo 00:43:06 -!- lkirk has joined. 00:43:25 -!- variable has joined. 00:43:57 -!- NihilistDandy has joined. 00:44:20 -!- ProofTechnique has quit (Ping timeout: 250 seconds). 00:44:43 -!- doesthiswork has quit (Quit: Leaving.). 00:49:25 -!- copumpkin has joined. 00:56:31 So, uh 00:56:34 In FlogScript 00:56:38 Can you, like, actually index strings 00:56:38 e.e 01:00:39 -!- lkirk has quit (Remote host closed the connection). 01:01:21 -!- contrapumpkin has joined. 01:04:49 -!- copumpkin has quit (Ping timeout: 245 seconds). 01:06:12 -!- contrapumpkin has quit (Client Quit). 01:18:11 -!- copumpkin has joined. 01:25:20 -!- contrapumpkin has joined. 01:27:32 -!- propumpkin has joined. 01:28:46 -!- copumpkin has quit (Ping timeout: 255 seconds). 01:30:20 -!- contrapumpkin has quit (Ping timeout: 256 seconds). 01:40:48 -!- propumpkin has changed nick to copumpkin. 01:49:37 -!- contrapumpkin has joined. 01:51:52 -!- vodkode_ has joined. 01:52:48 -!- propumpkin has joined. 01:53:00 -!- copumpkin has quit (Ping timeout: 250 seconds). 01:53:11 -!- propumpkin has quit (Client Quit). 01:56:02 -!- variable has quit (Ping timeout: 250 seconds). 01:56:12 -!- contrapumpkin has quit (Ping timeout: 264 seconds). 01:58:37 -!- Sgeo has joined. 02:07:29 Lymia: i expect that splitting a string and then counting the length of the first part accomplishes that 02:07:43 or even, splitting by length 02:09:01 or slicing 02:17:29 -!- zzo38 has joined. 02:27:39 Why would a computer take hours after booting up to act normal? 02:30:52 Not everyone's a morning person. 02:37:28 Hellallo! 02:37:42 -!- NihilistDandy has changed nick to ProofTechnique. 02:38:22 There, that's better 02:40:06 -!- vodkode_ has quit (Quit: Leaving). 02:40:36 -!- vodkode_ has joined. 02:41:47 -!- vodkode_ has quit (Remote host closed the connection). 02:42:49 -!- vodkode_ has joined. 02:45:31 -!- Sgeo has quit (Ping timeout: 244 seconds). 02:48:29 -!- bb010g has quit (Quit: Connection closed for inactivity). 03:07:59 -!- copumpkin has joined. 03:15:59 -!- Phantom_Hoover has quit (Remote host closed the connection). 03:35:57 -!- copumpkin has quit (Quit: My MacBook Pro has gone to sleep. ZZZzzz…). 03:42:38 -!- heroux has quit (Ping timeout: 250 seconds). 03:43:35 -!- heroux has joined. 03:52:39 -!- hjulle has quit (Ping timeout: 265 seconds). 04:30:32 -!- vodkode_ has quit (Ping timeout: 246 seconds). 04:32:47 -!- variable has joined. 04:42:11 -!- Sprocklem has quit (Ping timeout: 245 seconds). 04:51:49 -!- adu has joined. 05:07:45 -!- variable has quit (Ping timeout: 245 seconds). 05:13:40 -!- infinitymaster has joined. 05:21:44 -!- Sgeo has joined. 05:21:44 Is there any "urn:bible:" scheme? 05:30:26 -!- Tod-Autojoined has changed nick to TodPunk. 06:03:10 -!- vodkode_ has joined. 06:15:12 -!- bb010g has joined. 06:21:21 -!- infinitymaster has quit (Quit: Leaving...). 06:53:53 -!- adu has quit (Quit: adu). 06:55:22 -!- irctc099 has joined. 07:29:42 -!- Sgeo has quit (Ping timeout: 244 seconds). 07:32:35 Make URIs such as and so on to be valid. 07:37:48 -!- vodkode_ has quit (Ping timeout: 240 seconds). 07:38:07 I made up a kind of backtracking parser like: forever { (X,Y)=pop; foreach (W,Z) in action[Y][input[X]] do push(X,call W with argument Z); foreach Z in next[Y][input[X]] do push(X+1,Z); } 07:45:04 How do you compare this to the other kind of parsing? 07:49:46 You will want to start by pushing (length(input),error state) and then (0,0) onto the stack. 07:52:34 -!- vodkode_ has joined. 07:55:36 -!- Phantom_Hoover has joined. 07:59:23 Actually here is better way: push(length(input),error value); push(0,0); forever { pop(X,Y); if X=length(input) then return Y; foreach (W,Z) in action[Y][input[X]] do push(X,call W(Z,X)); foreach Z in next[Y][input[X]] do push(X+1,Z); } At first you must ensure that the input sequence ends with the EOF token 08:00:04 -!- mroman has joined. 08:04:12 something's wrong with my vserver. 08:04:27 Do you know what thing is wrong? 08:05:22 it reboots for unknown reasons 08:05:30 and now my root password doesn't seem to work anylonger. 08:06:05 oh wait. no it works. 08:06:28 hm 08:06:40 maybe the did maintenance on their physical hosts 08:06:50 but forgot to inform me that they reboot vms 08:16:21 Is it OK now though? 08:18:25 * Taneb good mooooorning 08:21:31 zzo38, I am in the UK 08:21:38 (York, in particular, now) 08:21:46 zzo38: yeah 08:21:48 uptime is 17h now 08:21:54 it rebooted twice yesterday though 08:25:28 -!- vodkode_ has quit (Ping timeout: 240 seconds). 08:30:22 How is this parser I made up compared with other ones? 08:36:39 what parser? 08:37:18 The one which is: add EOF to input buffer; push(length(input),error value); push(0,0); forever { pop(X,Y); if X=length(input) then return Y; foreach (W,Z) in action[Y][input[X]] do push(X,call W(Z,X)); foreach Z in next[Y][input[X]] do push(X+1,Z); } 08:46:41 so 08:47:00 action[Y][input[X]] contains parse functions? 08:47:42 with one character lookahead? 08:48:35 Not quite 08:49:56 Rather, the functions might be used to enter or exit the parser for a particular nonterminal; they can do other things too though. 08:55:59 -!- oerjan has quit (Quit: Niteoid). 09:01:04 -!- oren has joined. 09:05:44 9% of the human population is disabled? 09:07:04 More than 1 billion persons in the world have some form of disability. This corresponds to about 15% of the world's population. 09:07:07 WP says it's even 15% 09:08:52 Probably includes nearsighted people, people who have slight deafness (like me), people who are too old to walk. 09:10:22 So the number would be pretty high, there are so many people who need glasses 09:12:40 If you consider that as "disabled" then yes. 09:12:44 Then the number is pretty damn high. 09:13:22 if you take the definition of "disability funds" because you can't work due to your disability then the number should be less. 09:14:13 Well there are different levels, aome jobs might need perfect eyesight or perfect hearing, but most jobs don't. 09:15:57 On the other hand sometimes people complain about an infuriating noise distracting them, and I say "what noise". 09:19:43 Hmm... it seems statistically trouble walking or climbing stairs is the most common disability 09:23:35 well if you're fit to do another job you'll be forced to retrain for another job. 09:24:24 You can't just not work because you can't to the job you originally did any longer, you'll have to learn how to do another job. 09:24:43 unless you wanna live of social welfare which isn't really a lot of money. 09:24:51 Right 09:25:06 *off 09:25:29 unless you have some disability pension 09:25:34 I don't really know how they work. 09:25:56 Although I think many of the people who acquire a disablity do so because they simply are getting old... 09:26:55 Everything from their eyes to their bones starts to have problems 09:27:08 there's insurance against incapacity to work 09:27:38 but I'm not sure if that's an additional optional insurance or one you have to have or one you automatically get. 09:28:20 this stuff probably varies greatly by jurisdiction 09:29:15 Yeah. 09:29:24 It appears that 60% of my salary is "insured". 09:30:05 if I'm 70% disabled I get 60% of my original salary paid for two years 09:30:20 but after that it stops :) 09:30:38 so I'd have two years to find a job I can still do 09:30:53 or if I'm to disabled to continue meaningful work I have to apply for "income disability" 09:31:14 (there's "work disability" == "can't do your job anymore" and "income disability" == "can't do any meaningful job anymore") 09:31:38 oh 09:32:04 unless I'm older than 50 years at the time of becoming disabled 09:32:10 then there's no two years restriction. 09:32:36 oren: this stuff varies a lot by jurisdiction, your employer 09:32:44 and which insurance company your employer uses. 09:34:03 and if I die my children will get money 09:34:23 "orphan's pension"? 09:34:34 I guess that's the english word for that. 09:34:59 which is 60% of something that also xx% of something else 09:35:10 It's aimed at getting them through school 09:35:15 but not to live off it for longer periods. 09:35:21 but I don't have children. 09:35:22 :D 09:36:06 I need to see about getting a job pretty soon 09:37:10 And stop being a NEET 09:38:37 -!- Koen_ has joined. 09:38:53 My current plan is to stay in the E that doesn't pay as well as long as I can 09:41:40 -!- TieSleep has changed nick to TieSoul. 09:44:39 It's going well 09:47:09 -!- dianne has quit (Quit: byeannes). 09:48:22 https://gist.github.com/TieSoul/373d98cac227ec51ba4d so I'm working on something 09:48:37 (brainfuck is just a test for the lexer/parser system) 10:14:25 and what are you working on? 10:15:25 -!- Patashu has quit (Disconnected by services). 10:15:25 -!- Patashu_ has joined. 10:23:34 The comments at http://en.chessbase.com/post/us-champ-r9-forfeit are so much fun; some of them suggest the arbiter should be using a double standard and not forfeit *top* players when they violate rules despite having been warned about it... 10:24:10 (Not really fun. I'm suffering from a case of http://xkcd.com/386) 10:25:54 They should be disqualified if they seriously violate the rules, whether they are the top players or not. They can try again in the next tournament though. 10:26:21 Hmm, this terminal thought the ) was part of the url... 10:30:01 mroman: I'm working on a lexer and parser system for arbitrary grammars 10:30:10 zzo38: I'm also now waiting for the first case of a player being disqualified for "analysing any game on another chessboard." when they wander around and look at their competitor's game. ;-) 10:30:33 or competitors' 10:30:58 TieSoul: to what level of "arbitrary" 10:31:16 any unambiguous grammar? 10:31:59 oren: yup 10:36:38 https://gist.github.com/TieSoul/ed33bf2c5365b2ed0a7e an example 10:39:22 -!- sebbu2 has changed nick to sebbu. 10:52:55 so it's based on regexes 11:24:16 yup 11:27:45 fungot: Do you like regexes? 11:27:45 mroman: you may need to introduce any extra nesting by receiving the multiple values extension is as important!". kthxbye. 11:28:10 TieSoul: see. I told you to introduce extra nesting and multiple values extension. 11:30:01 lol 11:35:39 but no... you told me you couldn't do it... 11:35:55 fungot: Can you do it? 11:35:55 mroman: i think the category theory is mostly a browser-only thing ever, the lives of folks who were thinking about lazy strings/ ropes/ whatever they are 11:36:05 :D 11:36:11 Category Theory is sure a browser-only thing. 11:36:28 `? category theory 11:36:32 In category theory, category theory is a theory in the category of theories. 11:36:46 ... and it's only used in browsers. 11:37:56 `? browser 11:38:00 browser? ¯\(°​_o)/¯ 11:41:50 What's a browser? 11:41:55 Must be a category theory thing. 11:42:25 fungot: What browser do you use? 11:42:25 mroman: yah i agree. though riastradhs variant is not formally checkable 11:42:38 fungot: agree with what? 11:42:38 mroman: i don't mind looking at some code? i want to call something a functor unless it's returning a function 11:43:42 fungot: Category Theory is just a theory. It hasn't been proven yet. 11:43:55 `define A browser is a Gopher client for convenient access to Gopher services and documents. 11:44:08 Failed to connect to socket 2. \ \ Looking up 127.0.0.1:3128 \ Making HTTP connection to 127.0.0.1:3128 \ Sending HTTP request. \ HTTP request sent; waiting for response. \ Alert!: Unexpected network read error; connection aborted. \ Can't Access `http://google.com/search?q=define:%41%20%62%72%6f%77%73%65%72%20%69%73%20%61%20%47%6f%70%68%65%72%20% 11:44:14 (It's `learn) 11:46:10 oh. 11:46:14 `learn A browser is a Gopher client for convenient access to Gopher services and documents. 11:46:20 Learned 'browser': A browser is a Gopher client for convenient access to Gopher services and documents. 11:48:14 `? Gopher 11:48:15 Gopher? ¯\(°​_o)/¯ 11:48:57 Gopher is int-e's vision of the successor of HTTP/2 11:49:24 `learn Gopher is int-e's vision of the successor of HTTP/2. 11:49:37 Learned 'gopher': Gopher is int-e's vision of the successor of HTTP/2. 11:50:56 and google is down. 11:51:05 can't reach google.com, google.de nor google.ch 11:52:25 TieSoul: You play Pokémon? 11:52:33 yeah 11:52:35 why? 11:52:42 I'm stalking your gists. 11:52:49 lol 11:52:51 and there's a Nidoqueen. 11:52:56 I don't know what Arbok is though 11:53:12 my only public gist 11:53:19 is from a pokemon battle simulator I wrote 11:53:19 oh that snake pokémon 11:53:21 lol 11:53:46 `` rev <<< arbok 11:53:47 kobra 11:53:53 `` rev <<< ekans 11:53:57 snake 11:54:28 `` rev <<< pikachu 11:54:29 uhcakip 11:54:34 well lol 11:54:39 What's an uhcakip? 11:54:43 uh cake ip 11:54:45 Uh, Cake IP? 11:55:19 `` rev <<< izabera 11:55:20 arebazi 11:55:42 well... I'm off to buy me a bicycle. 11:55:50 why 11:55:55 we have cars 11:55:59 cars suck 11:56:06 we also have trains and planes 11:56:06 and pollute the universe! 11:56:09 The WHOLE universe. 11:56:15 yeah but trains are friendly people. 11:56:31 -!- mroman has quit (Quit: Lost terminal). 11:56:44 I was going to recommend the LEO (Link Everything Online) gopher service (which featured a english/german/english dictionary!), but I'm afraid they dismantled the gopher server years ago. 12:01:48 `` rev <<< muk 12:01:49 kum 12:02:00 Muk is a pokemon btw 12:03:02 `` rev <<< mudkip 12:03:03 Old joke from the playground years ago: Ekans is snake backwards, Arbok is cobra backwards, what about Muk? 12:03:03 pikdum 12:03:12 dum pikachu? 12:28:01 [wiki] [[Beatnik]] http://esolangs.org/w/index.php?diff=42363&oldid=42359 * Chris Pressey * (+213) Add internal link to Hello world and external link to Python implementation 12:30:34 -!- boily has joined. 12:31:25 -!- zadock has joined. 12:31:26 -!- zadock has quit (Max SendQ exceeded). 12:45:43 what is a .debanyway 12:47:31 > ar t libiw30_30~pre9-8_amd64.deb 12:47:31 debian-binary 12:47:31 control.tar.gz 12:47:31 data.tar.gz 12:47:32 Not in scope: ‘ar’ 12:47:32 Perhaps you meant one of these: 12:47:32 ‘a’ (imported from Debug.SimpleReflect), 12:48:21 Ah, so it's like an archive with some files and metadata as to what to do with them? 12:49:34 yeah, control.tar.gz contains meta information, install and uninstall scripts, things like that 12:52:21 * oren is considering trying to make a .deb for dwarf fortress 12:53:22 Ah but there are tools for that. https://wiki.debian.org/HowToPackageForDebian looks like a suitable starting point. 12:54:11 (Disclaimer: I have not actually made a deb package yet.) 13:03:23 -!- oren has quit (Read error: Connection reset by peer). 13:03:48 -!- orin has joined. 13:11:09 orbyen. hellorin. 13:16:11 -!- doesthiswork has joined. 13:23:49 -!- shikhin has changed nick to bacon. 13:23:57 -!- bacon has changed nick to shikhin. 13:25:31 I restarted my computer because firefox was screwing up even after I pkilled it 13:27:33 lulz 13:32:30 it seems to be fine now 13:33:34 now what I really need to figure out is why my level generator code is making roads that lead to nothing 13:36:35 http://postimg.org/image/w9gs905y3/full/ the problem occurse in the pink square 13:38:30 -!- bb010g has quit (Quit: Connection closed for inactivity). 13:43:34 Fixed. I really screwd up the road-merging part last night 13:44:49 -!- Patashu_ has quit (Ping timeout: 264 seconds). 13:47:04 You could just add things that the roads lead to. 13:48:01 Jafet: That is what was supposed to happen 13:49:00 Roads come from either side of the level or from tunnels and go off either side or into a tunnel 13:49:34 A road isn't supposed to bea ble to just... end 13:53:08 -!- GeekDude has joined. 13:59:28 -!- irctc099 has quit (Ping timeout: 246 seconds). 14:00:40 You can say that to the town council over here. 14:03:29 :t 1 -- 1 14:03:32 Num a => a 14:14:56 what game is this? 14:23:52 I think one that orin is making 14:25:37 Help I am in at least 2 IRC channels WITH CYBORGS 14:28:37 Taneb: welcome to the future 14:28:59 Taneb: did any of them say "come with me if you want to live"? 14:29:09 \o/ 14:29:09 | 14:29:09 >\ 14:29:12 There is one 14:29:16 (did I get this right?) 14:29:18 I don't think either hav 14:29:19 e 14:29:47 (yeah I did. good.) 14:34:27 -!- hjulle has joined. 15:10:15 -!- vodkode_ has joined. 15:11:38 -!- llue has joined. 15:11:38 -!- llue has quit (Changing host). 15:11:38 -!- llue has joined. 15:15:41 -!- GeekDude has quit (Ping timeout: 252 seconds). 15:24:16 -!- bb010g has joined. 15:25:12 -!- vodkode_ has quit (Ping timeout: 276 seconds). 15:52:06 -!- MoALTz__ has quit (Quit: Leaving). 16:04:07 -!- GeekDude has joined. 16:12:20 Phantom_Hoover, I'm blaming you for this: http://www.bbc.co.uk/news/uk-england-coventry-warwickshire-32264914 16:21:51 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 16:31:20 -!- yorick has quit (Read error: Connection reset by peer). 16:33:49 -!- yorick has joined. 16:34:07 -!- yorick has quit (Remote host closed the connection). 16:34:28 -!- yorick has joined. 16:35:31 -!- yorick has quit (Remote host closed the connection). 16:36:08 -!- yorick has joined. 16:36:09 -!- yorick has quit (Changing host). 16:36:09 -!- yorick has joined. 16:58:24 Taneb, i'm not even in england! 16:58:53 Phantom_Hoover, wow, how did you manage to do it, then? 17:00:58 -!- copumpkin has joined. 17:01:08 Taneb: Time travel, obviously. 17:01:12 Ah 17:01:26 You should try it, it's great for deniability. 17:07:34 In any case it sounds like a brilliantly successful demonstration. 17:10:09 Should I move the stuff from the old LEO gopher service into my own? I don't even have a copy though, so I can't. 17:11:18 hezzo38. what's LEO? 17:11:55 I don't know; int-e mentioned it above. 17:12:33 int-ello. what's LEO? 17:27:20 boily: "Link Everything Online". You may know its remnants ( ;-) ) on the World Wide Web, under leo.org. 17:30:52 tdh. t. 17:37:24 int-e: it sounds like space travel might be more effective to get to england 17:38:59 Koen_: Perhaps, but that may compromise your alibi. 17:39:48 well, time travel preserves the alibi because people assume you're not time traveling, nothing more 17:40:09 similarly space travel wouldn't compromise your alibi if people didn't know you could space travel to england 17:41:51 fungot, do you ever time travel or space travel? 17:41:51 b_jonas: lain was a bit comical 17:50:19 -!- magician has joined. 17:50:58 `relcome magician 17:50:59 ​magician: 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.) 17:53:21 -!- Guest3780 has quit (Ping timeout: 252 seconds). 17:53:21 -!- magician has changed nick to Guest3780. 17:58:31 boily: Btw, "remnants": The main part of what LEO was meant to be is indeed gone: It was a directory service for Gopher, intended to be comprehensive. 18:57:56 I think there are now other directory services for gopher 19:20:26 -!- boily has quit (Quit: %%%%%%%%). 19:26:17 . o O ( Gopher - where we're going, we don't need an information superhighway. ) 19:38:52 -!- ais523 has joined. 20:07:05 -!- Koen_ has quit (Remote host closed the connection). 20:12:42 So, are there infinitely many pairs of 5-smooth numbers differing by 2? 20:13:33 According to http://oeis.org/A219794, it would be "very surprising" if there were. 20:13:40 I don't see why that's the case. 20:23:42 I can think of a bunch. 1 and 3, 2 and 4, 3 and 5, 4 and 6... 20:25:05 It's because the density of the 5-smooth number is so low; there are only O(log(n)^3) of them up to n. (Compare this to primes with O(n/log n) primes up to n.) 20:25:30 That makes sense. 20:25:44 Some Haskelling suggests that the largest pair is 160 and 162. 20:26:06 Which is just the doubling of the largest pair of numbers differing by 1, which is 80 and 81. 20:26:52 The only pair differing by 2 which isn't "obvious" given the pairs differing by 1 is (25, 27). 20:27:20 Oh that's another funny detail. lim inf a(n) >= 2 (an amazing fact, hmm) means that only finitely many pairs arise by doubling 20:28:24 Because it says that there are only finitely many pairs of 5-smooth numbers with difference 1. 20:29:04 The only pair differing by 3 not "obvious" from prior pairs is (125, 128). For 4, 5, and 6, there are no "non-obvious" pairs. 20:30:34 -!- tswrcclt has joined. 20:30:58 For 7, there are two: (128, 135) and (243, 250). 20:31:48 My computer is being very sluggish now. 20:32:01 I think GHCi crashed. 20:33:47 -!- Decim has joined. 20:34:12 I'm making an AI what should it do 20:34:25 make coffee 20:34:32 It should play Brood War. 20:34:54 it should write functional Brainfuck code 20:35:06 it should analyze a source tarball and work out how to compile it 20:35:27 Omai 20:35:27 It should analyze English text and classify words into parts of speech. 20:35:33 it should analyze a source tarball and then compile it 20:35:46 Note that my suggestions are actually serious. 20:35:47 These are really good ideas 20:36:08 it should play arbitrary NES games 20:36:16 someone did that already so it's possible 20:36:36 Yeah 20:36:46 The brainfuck thing though 20:37:33 (btw, I wonder if you could make Prolog write brainfuck code to solve a particular problem) 20:38:14 (it would output all possible solutions too which is nice) 20:38:31 What did you mean by writing functional code I would have to make the algorithm learn the entire language 20:38:37 And idk the language so 20:38:48 It's a pretty simple language. 20:38:50 Guess I have to learn it before I start? 20:39:09 brainfuck is about the simplest language ever 20:39:16 Eight commands. "Add one", "subtract one", and so forth. 20:39:23 Tarballs are another thing entirely 20:39:35 Compiling Tarball AI bot 20:39:56 I don't know kids I'm only a kid 20:40:06 Help, GHC is using nearly six gaggleboots of memory. 20:40:13 if you're starting out with AI 20:40:20 try something easy like Tic-Tac-Toe 20:40:21 :P 20:40:28 Starting out? 20:40:45 tswrcclt: that's how you know it's a serious programming language ... :-/ 20:41:14 I had to make a self responsive bot for a school project although I got a D- on it 20:41:18 Uh, memory usage seems to have stabilized. 20:41:46 Is space an issue? 20:41:46 Went all the way up to 6.9 before going back down a little. 20:45:32 Infinite possibilites in tic tac toe or more to a large ammount of finite possibilites 20:47:28 Decim: space is always an issue :) 20:47:44 Just uncap ur ram 20:48:12 And overclock everything while keeping your server under a mile of ice 20:48:54 wtf. "2 GB DDR3L SDRAM, 32 GB Solid-State Drive and 1TB OneDrive Cloud Storage for one year" ... 20:49:06 ? 20:49:23 I made the mistake to search for "laptop" on amazon, now marvelling at the crap they offer. 20:49:31 Lol 20:49:54 Int-e there's a lot better stuff than that 20:50:37 Also more on point I don't have enough space for something like a tarball compiler 20:52:10 Decim: Of course there is. And it's good to see that even absolute crap has 2GB RAM, and normal laptops have 4GB or 8GB. 20:53:53 What's your setup Int-e 20:54:04 I forgot mine 20:54:13 Still, memory usage matters; on VPSs, RAM determines the price. 20:55:23 I have 8GB RAM in a PC at home... which is too small for some things I'm doing. (ghc is pushing the limits; some big Isabelle theories are taking off the lid) 20:57:09 But lambdabot is running on a VM with 512MB RAM + 512MB swap, which is not enough to build it anymore. 21:00:02 What are you doing 21:00:10 And wtf is an isabelle theory 21:00:19 TieSoul: "We" did arbitrary Atari games. 21:00:42 Compiling haskell-src-exts with ghc-7.10.1 takes 5GB... 21:00:55 ...it's a dependency of lambdabot 21:01:03 Take me to the begining of this whole ghc stuff isabelle theory idk I havent payed attention to stuff 21:01:22 Don't you guys have articles or something 21:01:45 None of this has to do anything with #esoteric really. 21:01:53 Probably 21:02:05 Why does it depend on lambdabot 21:02:20 Isabelle is a proof assistent, http://isabelle.in.tum.de/ , and she's quite memory-hungry. 21:02:33 ...what would happen if you deleted every version of lambdabot 21:02:48 Why would I do that? 21:02:59 Idk u were dieing 21:03:06 Not that I could. It's been forked several times on github. 21:03:10 And you were like fuck it 21:03:36 Decim: I suppose the world would just go on turning. 21:04:20 Until 569075432 AD when the sun expands 21:04:34 I think that 5b 21:04:35 Idk 21:06:34 Aw man isabelle is just on a bullshit level of nope for me I don't think I could ever have that much memory Im pretTy poor atm 21:11:59 Gnight 21:13:43 -!- nortti has changed nick to lawspeaker. 21:15:40 -!- lawspeaker has changed nick to nortti. 21:16:48 -!- Decim has quit (Remote host closed the connection). 21:18:51 -!- Sprocklem has joined. 21:23:12 -!- bixnode has joined. 21:37:45 -!- callforjudgement has joined. 21:37:58 -!- ais523 has quit (Read error: Connection reset by peer). 21:38:09 -!- callforjudgement has changed nick to ais523. 21:41:46 -!- bixnode has quit (Remote host closed the connection). 21:42:04 -!- bixnode has joined. 22:16:28 -!- boily has joined. 22:22:32 helloily 22:23:00 quinthellopia 22:23:23 -.- you're not boily 22:23:41 I know 22:25:06 you tryna trick me with your "b" name and your characteristically boily-like response 22:26:45 ah sorry 22:26:48 I didn't try to 22:27:15 well in that case 22:27:20 bon_journas 22:27:50 Is thid document understandable to you? http://sprunge.us/cCCL (I didn't invent the OASYS VM; it days from 1992, but was not documented before, so this is a document of it.) 22:28:37 s/thid/this/ 22:30:45 -!- vodkode_ has joined. 22:30:56 quinthellopia! 22:31:02 b_jonas: you're not me. 22:31:20 zzo38: I'm looking 22:42:13 what do you this day mssr. boily 22:46:52 -!- ais523 has quit (Read error: Connection reset by peer). 22:46:56 -!- callforjudgement has joined. 22:47:07 -!- callforjudgement has changed nick to ais523. 22:49:10 -!- vodkode_ has quit (Ping timeout: 276 seconds). 22:49:26 zzo38: yes, it's understandible, but there's some difficulties: 22:49:44 it would be nice if there was an introductory paragraph at the beginning to tell what the whole thing is about; 22:50:11 -!- tswrcclt has quit (Quit: Connection closed for inactivity). 22:50:27 OK, is there anything else to consider? 22:50:34 I think it would read easier if you first told the simpler case about how matching an input phrase and calling the corresponding method is handled, and only after that told about phrases with commas; 22:50:59 tell somewhere what character set the strings and vocabulary uses; 22:52:21 maybe, before telling how a method, a class, and the list of properties is represented in the input, put an introduction telling what those things are for; 22:53:22 in particular, mention that a method has an invocant which isn't listed in the argument list; 22:55:26 and maybe call the "message number" of a method an "error message number" or something instead 22:55:47 because it seems to be used for handling the error when a suitable object is not found; 22:56:03 Yes, that is what the "message number" does 22:57:59 in the listing of tasks the main loop does, split "Parse the command." to two parts: find the method to invoke for the command, then find the arguments for that method from the command using selector methods. 22:58:09 OK 22:58:31 Because that really seems two steps to me. 23:00:56 -!- Patashu has joined. 23:02:03 where you say "C rounding", does that mean the rule from old C (which allows two possibilities for some inputs) or modern C rounding from later standards? 23:02:42 I don't actually know. 23:04:03 OASYS was originally written in C++ though. 23:05:40 um, when you say "You must invoke the selector method on each object of the class", how is the class determined? 23:06:20 oh, is it determined from matching the class phrase? 23:06:29 O, it is determined by which class phrase it matches. 23:06:32 hmm 23:06:34 Yes, that is correct 23:07:08 how does this matching work then if the class phrases are variable length and the method phrases can have object slot gaps and fixed words mixed in any order? 23:07:28 -!- oerjan has joined. 23:08:45 It works just by which matches, such as if "blue key" is a class phrase and "put in " is a method phrase, then "put blue key in blue key" will match. I don't know what else you meant? 23:09:29 @tell Gregor glogbot could need an NTP update hth 23:09:29 Consider it noted. 23:09:58 zzo38: I mean what if there's an ambiguity, or at least a word occurs in many phrases? will the matcher backtrack to try all method phrases with all combinations of class phrases to find a match? that seems unlikely 23:10:31 I suppose it is implementation-defined, although it has to try to find the match. 23:10:49 I see 23:10:53 My own implementation in BASIC does use backtracking though. 23:11:14 I have the C++ implementation too but don't remember how it works. 23:11:33 -!- variable has joined. 23:12:05 then maybe mention that this is implementation-defined 23:12:52 OK 23:13:10 As long as it gets the correct result it doesn't matter how it is implemented though. 23:13:40 it can matter if there's an ambiguity, or if it doesn't always find the match 23:13:56 in fact 23:14:01 it can even matter what error message you get 23:14:28 OK, I will try to figure it out 23:14:30 like if you say "put red key in blue key" the error message could tell you it doesn't know about "red key" but the rest seems fine 23:15:01 The C++ implementation (as well as my BASIC implementation) will just print "I don't understand you." if that happens. 23:15:11 ok 23:15:31 I guess that's mostly enough because in this case "red" is likely not in the vocabulary 23:15:42 a game like this will generally use single words when possible 23:15:54 If that's the case it will print "I don't understand the word 'red'." when that occurs. 23:16:10 But that's really an implementation detail anyways I suppose. 23:16:33 yep 23:19:30 g'nite 23:19:40 OK 23:30:30 mroman: I'm working on a lexer and parser system for arbitrary grammars <-- that's undecidable hth 23:30:59 oerjan: you can just enter an infinite loop trying to decide 23:31:10 I'm also working on a parser system, but currently only for LALR(1) 23:31:10 whether you are actually trying the impossible or just don't know about the chomsky hierarchy, i do not yet know. 23:31:26 ais523: hm i suppose 23:31:51 "arbitrary grammars" could mean type 1 I guess, for someone who doesn't realise what type 0 is? 23:32:19 type 2 rather, iirc 23:32:24 or, well, yes 23:32:38 is type 2 decidable even if you allow an empty RHS? 23:33:07 type 1 is decidable anyway just by brute force 23:33:29 type 1 is PSPACE, essentially 23:33:38 (equivalent in strenght) 23:33:45 right, it doesn't look very computationally fast 23:34:09 type 2 is decidable in O(n^3) 23:34:32 well for a fixed grammar 23:35:07 oerjan: right, the bison manual mentions that offhand 23:35:18 and I forgot until you mentioned it 23:35:18 perhaps even including the grammar. 23:35:25 huh, the post correspondence problem is neat 23:35:33 unambiguous type 2 in O(n^2) 23:35:42 it's got to be possible to make an esolang out of that 23:35:49 given that it's a simple undecidable problem 23:36:14 oerjan: and LR(k) for any k in O(n), right? 23:36:15 and earley parsers gracefully get both of those as well as O(n) for LR(1) 23:36:24 well yeah 23:36:26 err, for any fixed k 23:36:50 LR(k) = LR(1) on language acceptance level 23:36:51 something that amused me a lot is that the syntax yacc uses as input is LR(2) but not LR(1) 23:37:04 heh 23:37:05 the yacc-in-yacc in the POSIX standard gets around it by doing some of the parsing in the lexer, which is cheating 23:37:18 how did they manage that 23:37:31 basically there doesn't have to be any delimiter between rules 23:37:45 and an identifier is a rule LHS if it's followed by a colon, part of the RHS otherwise 23:38:03 "we'll make a parser generator that can parse any reasonable language, and then make its own language not fit" best idea 23:38:09 when you see an identifier after a rule RHS, therefore, you have to reduce the RHS if there's a colon after it, shift the identifier otherwise 23:38:18 = two symbols of lookahead 23:38:36 *a colon after the identifier 23:39:13 hah 23:39:20 now I'm wondering if there's some crazy way to get it to be LR(1) anyway by rewriting the grammar with a bunch of intermediate steps 23:39:38 isn't there some universal way to convert LR(2) to LR(1) and still match the same set of strings? just the structure of the grammar is all wrong 23:39:50 yes, that's what i implied above 23:40:08 the POSIX standard's method of working around this is to define "identifier and a colon" as a separate token, which is really blatant cheating 23:42:13 maybe, it's still a regular language for the lexer 23:42:24 -!- Phantom_Hoover has quit (Read error: Connection reset by peer). 23:51:49 -!- Phantom_Hoover has joined. 23:55:33 `` ls wisdom/zy* 23:55:36 wisdom/zygohistomorphic-prepromorphism 23:56:00 `? zygohistomorphic-prepromorphism 23:56:00 Zygohistomorphic-prepromorphism Used when you really need both semi-mutual recursion and history and to repeatedly apply a natural transformation as you get deeper into the functor 23:56:52 `learn A zygohistomorphic prepromorphism is used when you really need both semi-mutual recursion and history and to repeatedly apply a natural transformation as you get deeper into the functor. 23:56:57 Learned 'zygohistomorphic': A zygohistomorphic prepromorphism is used when you really need both semi-mutual recursion and history and to repeatedly apply a natural transformation as you get deeper into the functor. 23:57:30 `` mv wisdom/zygohistomorphic{, prepromorphism} 23:57:31 mv: cannot stat `wisdom/zygohistomorphic{,': No such file or directory 23:57:47 `` mv wisdom/zygohistomorphic{," prepromorphism"} 23:57:49 No output. 23:58:01 `` rm wisdom/zy*-* 23:58:09 No output. 23:58:17 `` ls wisdom/zy* 23:58:21 wisdom/zygohistomorphic prepromorphism 23:58:44 * oerjan vaguely considers whether he could have done that more efficiently.