00:01:45 -!- constant has changed nick to trout. 00:02:32 oerjan: ? 00:02:41 i see it now 00:03:05 actually its (1 ==) . nand 00:03:12 why the abs? 00:03:53 because Int is signed, so if you flip all the bits, you flip the sign 00:03:54 hm... 00:04:07 yes but... 00:04:20 yes but? 00:04:39 > let k = 15 ; mns :: [[Int]] ; mns = [ [ abs (complement (m .&. n)) | m <- [0..k] ] | n <- [0..k] ] in text . reverse $ intercalate "\n" $ map (concat . map (\n -> case n of 1 -> "X"; -1 -> "Y"; _ -> " ")) mns 00:04:41 X 00:04:41 XX 00:04:41 X X 00:04:41 XXXX 00:04:41 ... 00:04:48 er 00:04:56 > let k = 15 ; mns :: [[Int]] ; mns = [ [ complement (m .&. n) | m <- [0..k] ] | n <- [0..k] ] in text . reverse $ intercalate "\n" $ map (concat . map (\n -> case n of 1 -> "X"; -1 -> "Y"; _ -> " ")) mns 00:04:58 Y 00:04:58 YY 00:04:58 Y Y 00:04:58 YYYY 00:04:58 ... 00:05:17 ok no apparent 1's... 00:06:14 > let k = 15 ; mns :: [[Int]] ; mns = [ [ complement (m .&. n) | m <- [0..k] ] | n <- [0..k] ] in 'X' `elem` (concat $ intercalate "\n" $ map (concat . map (\n -> case n of 1 -> "X"; -1 -> "Y"; _ -> " ")) mns) 00:06:15 -!- Phantom__Hoover has quit (Read error: Connection reset by peer). 00:06:16 Couldn't match expected type `[a]' 00:06:16 against inferred type `GHC.Types... 00:07:00 > let k = 15 ; mns :: [[Int]] ; mns = [ [ complement (m .&. n) | m <- [0..k] ] | n <- [0..k] ] in 'X' `elem` (intercalate "\n" $ map (concat . map (\n -> case n of 1 -> "X"; -1 -> "Y"; _ -> " ")) mns) 00:07:02 False 00:07:07 ok there are none 00:07:23 oerjan: there couldnt be any 00:07:34 n > 0 has initial 0 in the bits 00:08:09 anyway 00:08:10 point is 00:08:15 how cool is that 00:08:25 (1 ==) . nand gets you sierpinski's triangle 00:08:38 check out The Philosophical Computer 00:08:52 > let k = 15 ; mns :: [[Int]] ; mns = [ [ m .&. n | m <- [0..k] ] | n <- [0..k] ] in text $ intercalate "\n" $ map (concat . map (\n -> case n of 0 -> "X"; _ -> " ")) mns 00:08:54 XXXXXXXXXXXXXXXX 00:08:54 X X X X X X X X 00:08:54 XX XX XX XX 00:08:54 X X X X 00:08:54 XXX... 00:10:04 bit simpler 00:12:14 > let k = 15 ; mns :: [[Int]] ; mns = [ [ m .&. n | m <- [0..k] ] | n <- [0..k] ] in text $ intercalate "\n " $ map (map (\n -> case n of 0 -> 'X'; _ -> ' ')) mns 00:12:16 XXXXXXXXXXXXXXXX 00:12:16 X X X X X X X X 00:12:16 XX XX XX XX 00:12:16 X X X X 00:12:16 ... 00:12:54 -!- copumpkin has quit (Ping timeout: 252 seconds). 00:13:36 -!- copumpkin has joined. 00:14:30 is that (0 ==) . and 00:14:31 ? 00:14:38 yep 00:14:44 interesting 00:14:50 well it makes sense 00:14:50 but 00:15:24 the really interesting thing is that these are the nand/and tautologies/contradictions for all propositions 00:18:47 mhm 00:19:33 -!- augur has quit (Remote host closed the connection). 00:21:05 I wonder. In NFU, is there a function f whose domain is the set of all non-empty sets, and whose image is the set of all singleton sets, such that for all non-empty sets S, f(S) is a subset of S? 00:22:39 * oerjan vaguely recall new foundations is incompatible with axiom of choice 00:22:42 *+s 00:22:48 oerjan: NFU *has* the axiom of choice. 00:23:13 ah, fuck 00:23:30 So yeah, there is. Consider the set P = { { (S, {x}), x in S}, S is non-empty }. P is a set of pairwise disjoint non-empty sets. 00:24:33 Therefore, there is a set C, called a choice set from P, which contains exactly one element of each element of P. In other words, for all non-empty sets S, C contains a pair of the form (S, {x}), where x is in S. 00:24:48 So C is the "universal choice function" we're after. 00:25:34 tswett: wikipedia says that it disproves choice 00:25:48 coppro: Wikipedia says that NFU disproves choice? 00:26:40 tswett: yes, because there is no function x \mapsto {x} 00:26:47 this is required to avoid Cantor's Paradox 00:26:54 "Much of this entry discusses NFU, an important variant of NF due to Jensen (1969) and exposited in Holmes (1998)." 00:27:15 and then wikipedia proceeds not to define NFU properly... 00:27:38 yeah :/ 00:28:11 ah wait 00:28:14 based on reading 00:28:18 coppro: I guess I can believe that NFU disproves one *formulation* of the axiom of choice. 00:28:20 NF disproves choice, but NFU is not a strict superset 00:28:23 of NF 00:28:29 Right. 00:28:33 ok 00:28:35 carry on 00:28:50 -!- augur has joined. 00:29:00 Now I wonder if we can go the other way: given this universal choice function, can we prove the axiom of choice? 00:29:42 For all non-empty S, let f(S) be a singleton subset of S. Is it true that "for each set P of pairwise disjoint non-empty sets, there is a set C, called a choice set from P, which contains exactly one element of each element of P"? 00:30:15 If I'm not mistaken, the answer is yes: let C be the union of f(T) for all T in P. 00:39:09 It really seems like given stratified comprehension as an axiom, NFU has very few other axioms. 00:39:40 There are probably a couple of axioms so "obvious" I've completely forgotten them, like extensionality. 00:40:22 But given that stratified comprehension is the "basic" axiom and the ones I've forgotten are "obvious" axioms, the only axiom I've seen so far that is neither basic nor obvious is the axiom of choice. 00:42:27 -!- augur has quit (Remote host closed the connection). 00:45:54 well comprehension, extensionality and choice are afair the only axioms of naive set theory 00:46:03 -!- ogrom has joined. 00:46:11 I wasn't aware that naive set theory had choice as an axiom. 00:46:56 well you cannot obviously deduce it (without going through the actual inconsistencies :P) 00:47:20 Aha, here's another neither-basic-nor-obvious axiom. 00:48:05 If n is a natural number, let S be a set of cardinality n, and let 1 -> S be the set of all singleton subsets of S. 00:48:11 Then n = |S| = |1 -> S|. 00:48:28 The n = |S| part is obvious, of course, but |S| = |1 -> S| is not. 00:49:31 Can this axiom also be expressed as the existence of a function? Yeah, I think so. 00:50:10 It's the function { (x, {x}), x is a natural number }, isn't it? 00:51:35 -!- jiella has quit (Quit: Leaving.). 00:53:19 * coppro loves Zorn's lemma 00:55:36 * quintopia eats zorn's lemon 00:58:11 * oerjan peels a bananach algebra 00:58:43 One more NBNO axiom. The Axiom of Small Ordinals: "For any sentence phi in the language of set theory, there is a set S such that for all x, x is a small ordinal such that phi iff (x in A and x is a small ordinal)." 00:58:47 ...what? 01:02:11 Okay. If phi is a statement about small ordinals, then there is a set A such that each small ordinal is in A if and only if it satisfies phi. 01:05:47 OKAY 01:10:17 Looks like there's exactly one NBNO axiom remaining, the Axiom of Large Ordinals. 01:25:34 -!- Vorpal has quit (Ping timeout: 240 seconds). 01:37:44 -!- olsner has quit (*.net *.split). 01:42:22 -!- olsner has joined. 01:52:56 -!- olsner has quit (*.net *.split). 01:56:18 -!- augur has joined. 01:58:05 -!- olsner has joined. 02:06:44 -!- oerjan has quit (Quit: leaving). 02:41:35 -!- evincar has left. 02:46:49 help my brain 02:48:24 how can we help it? 02:48:41 haealp 02:48:45 tswett: In what way? What help? 02:49:17 Okay, so Forsome takes [S], a box of a type. That type is S. It then takes f, a function taking a box of an S, and returning a type. It finally returns a box of a type. 02:49:32 The type of Forsome is an expression involving Forsome. 02:50:13 Its first argument is [Box [Type]], which is a box of type, and also is the expression for the phrase "a box of a type". 02:50:52 itidus21: http://lesswrong.com/lw/k9/the_logical_fallacy_of_generalization_from/ <-- the thing to remember though is that inspite of what is true and what isn't, science keeps developing more and more dangerous things, due to it's unwitting constant participation in arms races 02:50:56 It then takes f, a function taking a box of an S, and returning a type. What is "an S"? Well, S = Box [Type], so "an S" is a box of a type. 02:51:17 admittedly i haven't read the article itself yet, and it's not necessarily denying that 02:51:19 So f (here) is a function taking a box of a box of a type, and returning a type. 02:53:01 What is f? It's the function taking [[S]] (a box of a box of a type) and returning the type "a function taking a box of an S, and returning a type" (a type). 02:53:28 describing types in english is so cumbersome, if only someone had invented a concise symbolic syntax for them 02:54:02 And modified the human brain to make that symbolic syntax as easy to understand as English, in all cases. 02:54:10 What is a box of a type? 02:54:33 yeah because the english sentences one produces this way are so easy to understand 02:54:36 zzo38: for all type S, a "box of an S" is a one-element set whose element is an S. 02:56:20 The distinction is important in NFU. 02:56:35 I still do not understand very well. 02:56:50 Well, I haven't given you any of the context. 02:56:58 OK 02:57:07 I suppose that is why 03:05:07 hello log reader! i know that theres plenty of things wrong with what i'm saying. i haven't been awake very long and i had some kind of nightmare. 03:05:39 What kind of nightmare? The kind of nightmare with plenty of things wrong with what you are saying? 03:09:15 the one where i'm in an alternate universe where haskell curry joined the circus, and all of programming was affected 03:09:30 itidus21: that was my fault. I'm sorry. 03:12:46 -!- ogrom has quit (Quit: Left). 03:13:07 nah it was the one where marty mcfly travels to a future which is dominated by something more exciting than the internet 03:13:26 ^world wide web sorry 03:13:50 -!- Nisstyre-laptop has joined. 03:18:15 or being chased through a kafkaesque maze by a female gregor 03:18:41 I've had some REALLY interesting mentions on this channel of late >_> 03:18:49 I hope female me has hair as fabulous as male me. 03:19:53 One hopes. 03:20:26 somehow i think she dresses like tom baker 03:20:34 even though you don't 03:20:54 ^i think 03:22:03 is there something like http://subterfugue.org/ but working on modern linux 03:35:29 -!- mig22 has joined. 03:42:45 there is https://github.com/dustin/labrea which is a bit different, but also very cool 03:50:23 I made the Ptolemaic just intonation to work with Famicom with the exact ratios in all octaves (if using equal temperament, you get approximate ratios which are less precise in higher octaves). 03:59:21 Cue ominous choral music 04:13:24 What ominous choral music? 04:48:33 "行今if君欲it、an他界a待s君。為不君呉上onit、君噛the手that餌s君。" Okay, English written with Chinese characters is really silly looking. 04:51:30 "行今 if 君欲 it、an 他界 a待s 君。為不君呉上 on it、君噛 the 手 that 餌s 君。" 04:51:35 And only slightly less strange space'd 04:52:24 what does it say? 04:52:40 google translate gives pinyin but i can't read it as english 04:53:04 "Go now if you want it, an otherworld awaits you. Don't you give up on it, you bite the hand that feeds you." First couple lines of "Otherworld", from the FFX soundtrack. 04:53:09 Random boredom. 04:53:15 heh, that song! 04:53:27 i haven't thought about that song in, like, 10 years 04:53:29 pretty good one though 04:53:40 Kinda partial to Uematsu music. 04:53:43 :) 04:53:47 i wonder if english written with arabic alphabet works ok 04:54:06 you can do so many cool things with arabic letters, typographically / calligraphically speaking 04:54:45 If it weren't for the random has-to-be-alphabetic bits, English in Chinese characters basically works. Except, of course, you really need to know your characters to do it. 04:55:11 Like, that whole phrase only repeats 君... 05:02:29 naming stuff is hard 05:02:34 what is a good way to name things 05:03:13 Throw the Scrabble tiles on the floor, whichever ones land face up, mixed up their order and use that as their name. 05:03:32 @fresh 05:03:32 Hahr 05:13:17 -!- Jafet has quit (Quit: Leaving.). 06:01:54 I made up Famicom Hangman it works so far! Only things left to add is tme limit and 7166 more phrases (I already have 514). 06:02:48 kmc: Some people name programs after Italian foods. 06:03:25 I suppose that is one way. 06:11:52 If you have phrases (single words is also OK) to add to Famicom Hangman you can suggested it. Rules are: Maximum length is 32 (but recommended maximum 30; text is centered and the edge is outside of the NTSC safe area). Letters (all converted to uppercase, although input is case-insensitive), digits, spaces, and some punctuation is allowed: - , . ? ! / & ' " 06:12:08 (nine kinds of punctuation) 06:12:43 (Actually, : and ; are also allowed, making eleven kinds of punctuation) 06:12:59 O, and also parentheses, I forgot that. 06:56:04 using chrome element inspector to fix typographical errors in the page i'm reading 07:01:33 Can you tell it to save the changes, though? 07:24:28 -!- atriq has joined. 07:25:10 I had a dream that I was playing a sidescrolling platformer/shoot-em-up with randomly generated levels 07:25:10 atriq: You have 3 new messages. '/msg lambdabot @messages' to read them. 07:27:21 but was it good 07:27:33 I wasn't very good at it 07:28:05 It had lava and turrets 07:28:09 No wait 07:28:14 They weren't turrets 07:28:17 They were people 07:28:34 what does that mean 07:29:07 were there people shaped like turrets? did a wizard turn people into turrets? 07:29:29 It means they were people who acted like turrets 07:29:35 i.e. standing still shooting at me 07:29:54 maybe they had bad legs 07:30:04 Maybe 07:39:52 -!- ogrom has joined. 07:42:14 -!- zzo38 has quit (Remote host closed the connection). 08:04:57 -!- Sgeo_ has joined. 08:05:13 -!- Sgeo_ has quit (Read error: Connection reset by peer). 08:09:13 -!- Indecipherable has joined. 08:13:26 -!- atriq has quit (Remote host closed the connection). 08:15:06 -!- Phantom_Hoover has joined. 08:16:39 -!- TeruFSX has quit (Read error: Connection reset by peer). 08:23:53 -!- Indecipherable has quit (Quit: used jmIrc). 08:30:43 -!- atriq has joined. 08:34:21 -!- barts has joined. 08:34:48 hi guys 08:35:36 Hey 08:35:40 `welcome barts 08:35:51 barts: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page. (For the other kind of esoterica, try #esoteric on irc.dal.net.) 08:37:03 oh hi 08:37:05 :) 08:37:52 -!- Phantom_Hoover has quit (Ping timeout: 244 seconds). 08:40:48 -!- Vorpal has joined. 09:24:16 -!- carado has joined. 09:24:36 Why did I think it would be a good idea to port mcmap to Haskell 09:28:22 -!- Phantom_Hoover has joined. 09:37:43 @ask fizzie If I, in the near future, were to ask you questions regarding the implementation of mcmap, could you easily answer them? 09:37:43 Consider it noted. 09:37:51 -!- atriq has quit (Quit: Leaving). 09:40:50 because doing what normal people would consider useless things is highly esoteric 09:44:31 -!- Phantom_Hoover has quit (Ping timeout: 244 seconds). 09:46:13 i think just as images can be stored as lossy and lossless, maybe programs can be stored as lossy and lossless 09:49:41 to be honest i think its the sort of nonsense zzo38 might have a cogent opinion on 10:11:02 -!- monqy has quit (Quit: hello). 10:19:00 -!- carado has quit (Quit: Leaving). 10:19:13 -!- carado has joined. 10:23:16 -!- aloril_ has quit (Ping timeout: 244 seconds). 10:30:08 -!- Phantom_Hoover has joined. 10:36:41 -!- aloril_ has joined. 10:52:34 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds). 10:55:14 -!- jiella has joined. 11:08:11 -!- barts_ has joined. 11:11:23 -!- barts has quit (Ping timeout: 260 seconds). 11:15:57 -!- Arc_Koen has joined. 11:16:06 hallo 11:23:03 hi 11:28:03 -!- Phantom_Hoover has joined. 11:29:38 ggggh the coffee maker is full of delicious coffee 11:29:43 I love coffee 11:29:51 no you don't 11:29:53 coffee is bad 11:29:55 you are ba 11:29:56 d 11:29:56 but if I drink coffee I won't be able to sleep tonight 11:51:08 -!- atriq has joined. 11:55:32 -!- Jafet has joined. 11:58:40 @messages? 11:58:40 Sorry, no messages today. 11:58:44 Yay! 11:59:11 @massages 11:59:11 You don't have any new messages. 12:10:09 what the hell 12:10:38 the internet connection in these halls has an upstream more than twice as fast as the downstream 12:11:12 Lol 12:11:42 They got the package that says "we're hosting a bunch of websites! Yay" 12:28:46 They say you're not allowed t run servers too, it makes no sense 12:29:10 How... how do they know if you're running a server? 12:29:15 Wait 12:29:24 There's loads of ways they can know if you're running a server 12:29:36 Maybe Coventry University has an evil plan to take over the world 12:32:51 And they're gonna use all the upload speed to take over the internet 12:33:09 -!- Phantom_Hoover has quit (Ping timeout: 260 seconds). 12:33:17 The reason this doesn't make sense is because the philosophy department created the plan and nobody can be bothered to shut them up 12:38:12 Blaxxun. Y U NO EXIST ANYMORE? 13:08:43 Wait 13:08:43 Hmm 13:08:47 What number's opaque? 13:08:51 255? 13:08:51 0? 13:25:38 -!- jiella has quit (Quit: Leaving.). 13:28:33 If you're not sure, go with 127.5. 13:28:33 −42 13:34:12 in Java, Math.OPAQUE 13:51:55 -!- ogrom has quit (Quit: Left). 14:01:59 -!- atriq has quit (Quit: Leaving). 14:13:33 -!- MoALTz has joined. 14:36:22 -!- mig22 has quit (Quit: mig22). 14:52:03 wait, is "whitespace" invariable? 15:43:27 -!- Slereah has quit (Ping timeout: 276 seconds). 15:44:26 -!- Slereah has joined. 15:50:54 -!- clog has quit (Ping timeout: 240 seconds). 15:51:48 -!- AnotherTest has joined. 15:51:55 Hello 15:52:57 -!- ogrom has joined. 15:53:11 On Wikipedia, programming language pages have this side bar thing which shows some basic but useful information (paradigms, creator, year of creation etc.); maybe we could do this on the esolangs wiki too? 15:53:22 -!- HackEgo has quit (Ping timeout: 240 seconds). 15:53:22 -!- EgoBot has quit (Remote host closed the connection). 15:54:00 -!- HackEgo has joined. 15:54:01 -!- EgoBot has joined. 15:56:22 -!- Nisstyre-laptop has quit (Remote host closed the connection). 16:00:22 -!- EgoBot has quit (Remote host closed the connection). 16:00:54 -!- EgoBot has joined. 16:01:34 -!- Phantom_Hoover has joined. 16:02:48 I believe it's called an "info box" 16:13:56 A couple of photos from the GPS receiver connected to my NTP server. http://imgur.com/a/WtaOp 16:21:22 AnotherTest: maybe bf derivatives should have their own infoboxes. 16:29:33 -!- AnotherTest1 has joined. 16:29:34 -!- AnotherTest has quit (Read error: Connection reset by peer). 16:33:02 -!- Phantom_Hoover has quit (Ping timeout: 255 seconds). 16:39:48 -!- clog has joined. 16:45:13 -!- Phantom_Hoover has joined. 16:45:56 -!- Phantom_Hoover has quit (Read error: Connection reset by peer). 16:50:19 "Ultimate GPS Breakout" is kind of an impressive name, I'll give it that. 16:50:20 fizzie: You have 1 new message. '/msg lambdabot @messages' to read it. 16:50:24 @messages 16:50:24 atriq asked 7h 12m 41s ago: If I, in the near future, were to ask you questions regarding the implementation of mcmap, could you easily answer them? 16:50:45 @tell atriq That really depends on the questions. 16:50:45 Consider it noted. 16:51:00 @tell atriq With a nonzero likelihood, yes, I suppose. 16:51:01 Consider it noted. 16:56:23 -!- AnotherTest1 has changed nick to AnotherTest. 16:57:38 lifthrasiir: Perhaps that could be a field in the input box? "Derived from:"/"Derivative of:" 16:58:46 ah, I was thinking of mappings from 8 BF primitives to derivative codes 17:03:26 *info box 17:05:49 Any wiki admins interested in this idea? 17:11:01 @ask ais523 On Wikipedia, programming language pages have "info boxes" which show some basic but useful information. Maybe we could do this on the esolangs wiki too? (To give you an idea of the information that the boxes would contain; I was thinking of: paradigms, creator, year of creation, derived from, influenced by, influenced, specification, reference implementation etc. 17:11:02 Consider it noted. 17:14:02 -!- Slereah has quit. 17:42:29 -!- elliott has joined. 17:42:35 lifthrasiir: congratulations on your IOCCC win 17:43:54 elliott: thanks 17:44:19 -!- Phantom_Hoover has joined. 17:44:43 I was actually in hurry and ended up with reusing a year old code (very subtly modified though) 17:45:08 so I never thought that it would win 17:45:47 which one is yours? 17:46:20 Best short program: Seonghoon Kang - Decodes spelled out numbers 18:12:25 -!- carado has quit (Ping timeout: 246 seconds). 18:17:26 -!- Phantom_Hoover has quit (Ping timeout: 256 seconds). 18:18:12 -!- MoALTz has quit (Read error: Connection reset by peer). 18:18:36 Where’s the source? 18:18:53 -!- MoALTz has joined. 18:26:41 -!- jix has quit (Quit: Lost terminal). 18:30:52 -!- carado has joined. 18:33:34 -!- jix has joined. 18:42:07 -!- zzo38 has joined. 18:45:10 -!- jiella has joined. 18:51:29 -!- ais523 has joined. 19:10:31 zzo38: I wrote down your idea for a "trigger" operator http://esolangs.org/wiki/Kkipple 19:11:43 I also included an "execute" stack which executes its content as Kkipple code when triggered, though I'm not sure it really fits with the rest of the language 19:15:32 -!- Nisstyre has joined. 19:34:13 -!- AnotherTest has quit (Quit: Leaving.). 19:38:37 -!- Nisstyre-laptop has joined. 19:38:38 -!- kinoSi has quit (Read error: Connection reset by peer). 19:39:07 -!- kinoSi has joined. 19:39:51 -!- oklopol has quit (Read error: Connection reset by peer). 19:40:08 -!- oklopol has joined. 19:42:52 also I thought the @ stack could be used not only to ease outputting numbers, but for input as well 19:43:37 so I made it that pushing a number onto it would push the ascii codes of its digits instead, and triggering it would merge the digits inside into a number 19:45:03 -!- oerjan has joined. 19:45:15 problem is, getting digits from input into it is kind of hard, for instance if input is '1', io>@* will actually make the number 49 and not 1 19:46:04 the simplest solution seems to have two different stacks, one for turning digits into a number, and one for turning a number into digits 19:46:30 or maybe only one stack, but triggering it would toggle it between the two roles 19:46:35 hello oerjan 19:46:38 hi 19:47:24 my brain is unlikely to be of help today because the housemate has a cold and is constantly talking in the phone 19:47:33 *one housemate 19:48:55 which means, by synchronicity, that any mathematical chain of thought is 100% likely to be interrupted by unbearable noise. 19:49:33 The close the door 19:49:53 zzo38: the door is closed. the walls are "paper thin". 19:51:04 if you open the door, though, the thinness of the walls won't matter any longer! 19:52:01 i discovered to my surprise the walls actually _do_ stop the other housemate's music, probably because he has no real bass speaker. 19:52:30 well, most of the time. 19:55:13 -!- Slereah has joined. 19:55:16 Hey folks 19:55:38 Slereah: hey you cannot speak, it's untraditional! 19:56:06 Yes, except fuck you 19:56:13 wait a minute, have you been gone? it's hard to tell when you never speak. 19:56:18 Fuck you in the ass with a big rubber dick! 19:56:25 I changed PC 19:56:31 So I had to turn down the IRC for a bit! 19:56:33 #esoteric never changes 19:56:35 except when it does 19:56:45 War never changes. 19:56:54 Slereah: i have ops and i'm not afraid to ... shutup elliott 19:57:12 hm that was a bit too ambiguous 19:57:22 i agree, oerjan should kick chickenzilla 19:57:29 fuck that guy 19:57:38 what did he do 19:57:43 idk 19:57:45 what does anyone do 19:58:07 PLOT AGAINST ME 19:58:08 I mostly drip mucus 19:58:13 Because cold :( 19:58:38 thankfully irc is not a sound-based chat 19:58:52 or else i would soon ban you for coughing 19:59:00 COUGH 19:59:03 COUGH COUGH COUGH 19:59:05 C 19:59:06 O 19:59:07 U 19:59:07 G 19:59:08 H 19:59:19 although spamming might also work. sometimes. 19:59:20 coff 19:59:22 So anyway 19:59:31 Anything interesting happened in the last two years? 19:59:39 Did you solve the halting problem? 19:59:44 guess im gonna die cuz i cant stop coffin 19:59:49 : D 19:59:59 : D 20:00:03 : D 20:00:11 : 20:00:27 -!- Phantom_Hoover has joined. 20:00:28 poor elliott, coughed is lower jaw off 20:00:32 *his 20:00:46 i see that soundnfury guy isn't here. did you chase him away 20:00:48 I added one idea to list of ideas 20:01:30 hm my underload stuff was last year, wasn't it. 20:02:03 So it turns out nobody implemented the languages I was too lazy to implement! 20:02:12 I am disappointed in your lack of doing my own work 20:02:16 My idea is ANSI codes self-modifiable funge. 20:02:31 Slereah: i did prove some things turing complete. also i did implement some languages, probably not yours though. 20:02:37 oerjan: is that a yes. come on keep me updated on all the bullshit that happens here 20:03:08 elliott: i haven't noticed soundnfury since last he bitched against haskell or something 20:03:33 guys i don't understand haskell 20:03:38 it's almost as if it's some kind of esoteric languag elOL 20:03:42 joke (c) me 2012 20:03:59 Slereah: elliott took over as wiki admin, we have featured languages now 20:04:09 two of them or so 20:04:09 well it depends what you mean by have 20:04:23 i note that as a wiki admin you are responsible for updating those, oerjan 20:04:34 08:37:14: yup, thats it 20:04:34 08:37:51: any huevos, I think imma let you computer geeks do your stuff 20:04:34 08:37:55: now 20:04:34 08:38:22: so long and thanks for listening 20:04:38 this log looks good 20:04:57 08:03:07: -!- UnknownCharacter has joined #esoteric. 20:04:57 08:03:17: i loveeeeeeeeeeeeeeeeeeeeee 20:04:57 08:06:06: `WELCOME UnknownCharacter 20:04:57 08:06:18: UNKNOWNCHARACTER: WELCOME TO THE INTERNATIONAL HUB FOR ESOTERIC PROGRAMMING LANGUAGE DESIGN AND DEPLOYMENT! FOR MORE INFORMATION, CHECK OUT OUR WIKI: HTTP://ESOLANGS.ORG/WIKI/MAIN_PAGE. (FOR THE OTHER KIND OF ESOTERICA, TRY #ESOTERIC ON IRC.DAL.NET.) 20:04:57 also elliott is rarely here, probably because he's spending most of his time in an alternate reality where i am wiki admin. 20:04:58 08:06:55: i was just passing by 20:04:59 08:07:01: but thanks for welcoming me 20:05:01 08:07:04: oh its just a bot command 20:05:04 08:07:20: it makes for grandoise welcomings 20:05:05 08:07:23: well, fuck u then 20:05:07 wow good 20:05:26 08:08:02: srory 20:05:27 08:08:05: ^sorry 20:05:27 08:08:15: im sorry, 2 20:05:27 08:08:32: let's make out to make up only if u r a hot girl 20:05:29 best log ever 20:06:36 this is really good 20:06:46 08:19:22: with the rain covering my tears... i sat down on some stairs leading to a parking lot 20:06:46 08:19:39: can you type a bit faster please 20:06:46 08:19:40: and i wondered why this all happened. 20:06:46 08:19:50: i'm getting bored between messages 20:06:46 08:19:58: dont rush me, emotions cant be rushed 20:07:29 hi are you elliott 20:07:33 no 20:07:37 08:25:32: lol... okay, I didn't kill myself... but i wish i had thought of that. 20:07:47 elliott: hi are you 20:07:55 08:28:11: it does seem that way.. he hasn't made any references to brainfuck, lisp, turing, or haskell 20:08:29 ooh, elliott is here reading the logs out load 20:08:36 *loud 20:08:44 yes 20:08:45 08:31:53: so... to deal with your suicidal thoughts as a result of a bitter and traumatising breakup, you came to a channel about weird programming languages 20:09:07 oh wow 20:09:11 08:32:12: couldn't you talk to a psychiatrist, or one of those helplines they have? 20:09:11 08:32:25: they kinda annoy me 20:09:11 08:32:26: so no 20:09:11 08:32:47: plus, im an artist. 20:09:16 oh, just like every one else then 20:09:16