00:07:52 -!- mihow has joined. 00:13:11 oerjan: "-- an overflow room will be available where reporters can still ask questions and have access to additional subject matters to interview after the press conference." How do you interview a subject matter? 00:14:04 i don't know, i'm not a journalist. 00:15:31 Speaking of the greatest science breakthrough of the century (this is a joke), I just accepted a draft of my thesis from the printing house. Progress! 00:16:26 yay! 00:22:36 -!- J_Arcane has quit (Ping timeout: 252 seconds). 00:22:39 -!- J_Arcane_ has joined. 00:22:43 -!- J_Arcane_ has changed nick to J_Arcane. 00:23:48 FOR SCIENCE! 00:23:59 -!- tromp_ has joined. 00:27:47 -!- J_Arcane has quit (Ping timeout: 264 seconds). 00:28:20 * boily is killed by Cerebov. aaaargh. 00:29:33 at least it was a cerebral way to die 00:29:39 <\oren\> I got another package from china/rotterdam 00:31:03 * boily *THWACKS* oerjan 00:31:12 `? izabera 00:31:13 he\\oren\. being shipped as always? 00:31:15 izabera is a tachyherpetologist. They are probably implemented in zsh. 00:31:29 `` sed -i 's/zsh/bash/' wisdom/izabera 00:31:34 wasn't izabera bashly implemented yesterday? 00:31:35 No output. 00:32:03 Elronnd: you cannot have been paying _any_ attention to izabera if you think e is implemented in anything other than bash hth 00:32:03 i was forbidden to edit that factoid 00:32:27 "she" is fine :p 00:32:32 aha 00:33:06 `` sed -i 's/They are/She is/' wisdom/izabera 00:33:09 No output. 00:34:17 izabera: also, a tachyherpetologist is someone who slows down pythons hth 00:34:37 ooh 00:34:42 thanks for explaining it 00:34:58 at least i'm sure that was the intended meaning, i'm not sure that it's correct greek morphology. 00:35:25 disregard morphology, apply linguistic duck tape. 00:35:36 (cf. trigotillectomic chicken.) 00:35:48 i suspect it actually is correct, tachy- seems to prefix that way. 00:36:16 `wisdom 00:36:18 space elevator/Like the shorter and more familiar strings of stringed musical instruments, the cable of a space elevator has a natural resonant frequency. 00:36:33 `culprits wisdom/space elevator 00:36:37 oerjan elliott ais523 ais523 Bike 00:36:48 `wisdom 00:36:50 boily: \oerjan\? 00:36:50 substructural typing/Not to be confused with structural subtyping. 00:36:53 A tachyderm is a slow-moving elephant-like thing. 00:38:47 does anyone here compete in the hashcode thing? 00:39:06 https://hashcode.withgoogle.com/ this thing 00:39:46 hppavellon. \oerjan\??? 00:39:52 s/n\./n[1]/ 00:41:04 boily: " he\\oren\. being shipped as always?" 00:41:46 I'm not eligible. :/ 00:41:52 fizzie: Why not? 00:41:56 googler 00:41:59 Ah 00:42:00 Right 00:42:07 Yeah, never get to do anything funs. 00:42:11 :( 00:42:23 (Well, that's not quite true.) 00:42:35 hppavilion[1]: he\\oren\ is the porthello for \oren\ hth 00:42:40 (added remark in case google reads this) 00:42:42 boily: I know 00:42:55 boily: I was referencing "being shipped as always" 00:43:06 I'm sure the crawler "reads" this. 00:43:14 you're fucked 00:43:21 "It sucks working at google. I never get to do anything fun. (proceeds to play with the Quantum Halting Problem Solver)" 00:43:23 I keep getting #esoteric log hits for my searches every now and then. 00:43:48 xD 00:43:51 izabera: ? 00:43:54 Remark? 00:44:04 fizzie | (Well, that's not quite true.) 00:44:12 izabera: Yes, yes 00:44:13 hppavilion[1]: ooooooooooooh. 00:44:15 I noticed 00:44:33 boily: What did YOU mean by that? 00:45:31 fizzie: What fun things do you get to do? 00:45:52 -!- lynn has quit (Ping timeout: 256 seconds). 00:46:12 Well, for example, I [COMPANY CONFIDENTIAL MATERIAL AUTOMATICALLY REDACTED]. 00:46:39 hppavilion[1]: you want I mean to ship \oren\ and oerjan together? 00:46:43 Speaking of things, I waved at a street view car that was passing the other day, but the image didn't make it to the (public) Maps. 00:46:54 that's very confidential 00:46:56 boily: Huh? 00:47:44 zzo38: It's the [REDACTED] <-- SPOILER 00:48:09 i got it, but now i cannot be sure that i wasn't unconsciously picking it up from lower down on the page :( 00:48:11 I keep getting more and more confused 00:48:32 I think I might've said that at some point 00:48:39 About 3-6 months ago 00:48:44 * oerjan obsessively hides puzzle solutions in the newspaper when solving them 00:49:12 hppavilion[1]: well i cannot include the [REDACTED] part, naturally 00:49:19 oerjan: Oh? 00:49:25 since that's the spoiler. 00:49:32 anyway i was actually looking for an hashcode team <.< 00:49:34 Oooooooh 00:50:30 For the instructions I'm planning on adding to ELK? 00:50:55 -!- J_Arcane has joined. 00:50:57 * izabera feels ignored 00:51:07 TPM, AOTC, ROTS, ANH, ESB, ROTJ, and TFA 00:51:08 `welcome J_Arcane 00:51:10 J_Arcane: 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.) 00:51:16 * hppavilion[1] pokes izabera 00:51:22 ;-; 00:51:43 hppavilion[1]: btw quantum computers are not believed to be capable of solving the halting problem hth (never more than exponential speedup) 00:51:53 oerjan: Yeah, I figured not 00:52:06 I would like to see a problem solvable in O(1/n) time >:) 00:52:39 (Inverse Polynomial- IP- is the complexity class) 00:53:12 hppavilion[1]: you want I mean to ship \oren\ and oerjan together? <-- aka backslash pairing 00:53:56 hppavilion[1]: yep 00:54:52 * oerjan realizes that got quite out of context 00:54:58 yep to the instructions 00:55:46 :) 00:55:51 oerjan: Any clue what they should do? 00:57:34 well ROTS and ROTJ should rotate stack pointer and PC respectively. 00:58:33 ESB expands the stack boundary 00:59:42 TPM transfers private memory, useful for safe threading 01:00:38 unclear why ROTJ rotates PC 01:00:40 ANH adds a new heap 01:00:54 oh wait 01:01:08 maybe it can rotate the jump flags 01:02:03 AOTC accesses other computers 01:02:16 oerjan: The call stack is currently separate from the registers 01:02:36 rotate jump flags? 01:02:50 What are jump flags? 01:02:59 TFA performs trivial floating-point arithmetics 01:02:59 flags that you can branch on 01:03:14 such as zero or carry 01:03:43 oerjan: Ah. And what does rotating them do? 01:04:00 same as rotating any bit field hth 01:04:17 (you probably need at least one more flag) 01:06:53 izabera: Fird, secost, thirnd? <-- Firrd, secost, thind hth 01:07:27 you just moved a r 01:07:44 i made it logical 01:08:08 oerjan: Please check the channel you are currently communicating with. 01:08:08 somehow 01:08:20 1st = fir + st, so 1rd should be fir + rd hth 01:08:42 etc. 01:09:35 I may be about to embarrass myself by asking this, but is there a builtin heap in most VMs? 01:09:57 so embarassing 01:10:02 hppavilion[1]: we take logic to its illogical conclusion. what's your problem? 01:10:13 oerjan: Ah 01:15:42 -!- tjt263_ has quit (Quit: sleep). 01:18:49 izabera: there? 01:21:27 *is there 01:22:23 -!- XorSwap has joined. 01:22:40 oerjan: So I'm designing a (non-production, education) VM called Deque-o-Bytes for use as a lesion in minimization 01:22:46 -!- jaboja64 has quit (Ping timeout: 240 seconds). 01:23:15 i'm here 01:24:21 It's almost exactly what it sounds like, but it probably uses longs (the 32- or 64-bit kind) instead 01:25:06 And an actual intentional, advertised feature of the VM is that it's horribly bloated and half of its features could be implemented in an obvious way using macros 01:30:44 -!- jaboja has joined. 01:33:10 ^bf --->->->>+>+>>+[++++[>+++[>++++>-->+++<<<-]<-]<+++]>>>.>-->-.>..+>++++>+++.+>-->[>-.<<] 01:33:10 Hello, World! 01:34:22 that's the new golfed hello world pattern, isn't it? 01:34:34 or, hmm 01:34:39 what's with those triply-nested loops in the middle? 01:35:43 can a brainfuck program be proven to be the shortest? 01:36:41 *Specific* ones can be, but *in general* it seems quite nontrivial courtesy of the halting problem. 01:37:29 you'd need to be able to, for each shorter program, either prove it to halt, prove it not to halt, or prove that it can't create the same output for some given input 01:37:51 this is easy for almost every program, but that "almost" is a pretty big confounding factor! 01:38:05 mathematicians be almost damned! 01:39:29 <\oren\> trump is winning 01:40:12 \oren\: I'm following the US primaries 01:40:17 I thought new hampshire hadn't voted yet though 01:40:40 trump is considered most likely to win there but the chance of an upset is also considered pretty high if not higher 01:42:05 ais523: RDebath just deleted that from the Brainfuck page. 01:42:19 pikhq_: Well, time to actually implement banana scheme. 01:42:28 Someone get me the Reality Hacksaw 01:42:51 oerjan: well it has a capital W 01:42:55 it was found on ppcg a while ago 01:43:05 could be a possible copyright issue? 01:43:43 * boily unfolds a portable reality saw from his mapole 01:43:55 also, i'd say the biggest confounding factor is probably the enormous number of shorter programs to check? 01:44:11 * hppavilion[1] takes said reality saw and starts sawing apart reality so that he can implement Banana Scheme 01:44:35 ais523: no, see the talk page. i'm not sure i agree with it. 01:44:39 oerjan: How many shorter possible programs are there, given the minimum length of a Hello World? 01:44:56 And eliminating those that use , at all and that don't use . at all? 01:45:33 hppavilion[1]: well the above is 87 chars... 01:45:47 Speaking of which, the shortest possible BF Hello World is obviously ,[.,] hth. It's just a bit conditional. 01:46:00 > 7^87 01:46:01 Of course, it requires a compliant interpreter 01:46:02 33383316601519079764840019573017918591994183158265244484590572513470087543 01:46:13 hppavilion[1]: shortest Easy hello world is almost certainly ,H[.,]ello, world! 01:46:31 err 01:46:33 And if you don't allow the user to type anything in, but have a standard derivative interpreter (that is, one with ! and #), then you get ,[.,]!Hello, world! 01:46:39 ,H[.,e]llo, world! ? 01:46:53 depends on how exactly Easy's I/O even works 01:47:03 hppavilion[1]: of course you'd want to prune it in various ways, but it's a lot of work and possibly too much... 01:48:05 oerjan: You didn't eliminate invalid looping. 01:48:32 oerjan: 7 because clearly . is unused? 01:48:47 ais523: , 01:49:12 ais523: You aren't really allowed to , in hello worlds 01:50:08 err right 01:50:10 got those muddled 01:50:25 actually, arguably you can so long as you ignore the result 01:50:31 this is how the Takeover hello world works 01:51:19 ais523: Fair enough 01:51:30 -!- boily has quit (Quit: RECTIFIED CHICKEN). 01:51:54 hppavilion[1]: it's a first estimate. getting a perfectly accurate estimate is essentially the same as solving the problem. 01:52:14 oerjan: Yeah, and? 01:52:17 GET TO IT 01:52:32 * hppavilion[1] cracks his whip in an entirely non-sexual way 01:52:34 NOPE 01:53:21 i don't do things that might take longer than the universe survives hth 01:53:53 oerjan: Fair enough. 01:53:56 ok so wildly estimating... 01:54:09 > 86/8 01:54:11 10.75 01:54:17 er 01:54:20 > 86/7 01:54:22 12.285714285714286 01:54:50 oerjan: What does 'hth' mean? 01:54:56 ` 01:54:58 oops 01:54:59 /home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: : not found 01:54:59 zgrep: hope that helps hth 01:55:01 `? hth 01:55:03 hth is help received from a hairy toe. It is not at all hambiguitous. 01:55:28 there should be a variant of wisdom that only contains true and helpful entries 01:55:31 rather than lies 01:55:36 oerjan: I... Do... err... okay. :/ 01:55:38 shachaf: HAHHAHAHAHAHAHAHAHHAAHHAAHAH 01:56:01 `tomfoolery hth 01:56:02 /home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: tomfoolery: not found 01:56:15 `cat lies 01:56:16 cat: lies: No such file or directory 01:56:16 `` cat bin/wisdom 01:56:17 F="$(find wisdom -name "*$(echo "$1" | lowercase)*" -type f | shuf -n1)"; echo -n "${F#wisdom/}/" | rnooodl; cat "$F" | rnooodl 01:57:06 `cat bin/rnooodl 01:57:07 perl -pe 's/([Nn])ooodl/"$1@{[o x(3+rand 7)]}dl"/ge' 01:57:43 shachaf: Do you really think we need that? If so, feel free to create it. 01:58:11 shachaf: I mean, the code is right there if you just change a bit 01:59:11 I'd do it myself, but last time I tried... 01:59:21 `` cp bin/wisdom bin/lies 01:59:21 Well, thank god I can create new universes at will 01:59:24 No output. 01:59:33 Actually, no, that's not what I wanted, is it. 01:59:35 `lies 01:59:37 agdq/AGDQ is Awesome Games Done Quick, an annual video games speedrunning event for charity ever winter, see http://gamesdonequick.com and https://gamesdonequick.com/tracker/events/ 01:59:46 zgrep: No, we wanted `? 01:59:51 `` cat bin/? 01:59:52 TIMEFORMAT='real: %lR, user: %lU, sys: %lS' exec bash -c -- "$1" \ echo hi \ exec \ #!/bin/sh \ CMD=`echo "$1" | cut -d' ' -f1` \ ARG=`echo "$1" | cut -d' ' -f2-` \ exec ibin/$CMD "$ARG"#!/bin/sh \ topic=$(echo "$1" | lowercase | sed "s/noo\+dl/nooodl/;s/ *$//") \ topic1=$(echo "$topic" | sed "s/s$//") \ cd wisdom \ if [ $ "$topic1" = "ngevd" $ 01:59:59 `culprits bin/lies 02:00:03 zgrep 02:00:14 `` rm bin/lies 02:00:17 No output. 02:00:40 We need a bible 02:00:53 What should it be called? 02:01:04 * oerjan finds it fitting that the first output from the `lies command wasn't one 02:01:39 oerjan: "Esobible" sounds stupid 02:01:44 "Book of Eso?" 02:01:47 *"? 02:02:25 `` cp bin/wisdom bin/bookofeso 02:02:28 No output. 02:02:41 Now somebody fix it so it isn't just wisdom xD 02:03:12 (I should probably learn bash...) 02:03:30 Then again, this might unnecessarily bloat HackEgo... 02:03:53 -!- XorSwap has quit (Quit: Leaving). 02:04:53 yes. yes it might. 02:12:50 oerjan: That was the idea. Make `wisdom be lies and `lies be wisdom. 02:12:58 Well, truth. Close enough. 02:13:22 `? lie algebra 02:13:23 A Lie algebra is what you get if you take the region infinitesimally close to the identity of a Lie group and blow it up to normal size. 02:14:02 `? lie group 02:14:04 lie group? ¯\(°_o)/¯ 02:14:55 zgrep: "tomfoolery" is a better name for the command 02:15:03 Hm, okay. 02:15:50 -!- MDude has quit (Ping timeout: 276 seconds). 02:15:58 `? le 02:15:59 cat: le: Is a directory 02:16:12 `? lie 02:16:12 Lies are even easier than monoids. They form groups, known as Lie groups. 02:16:31 `? HackEgo 02:16:33 HackEgo, also known as HackBot, is a bot that runs arbitrary commands on Unix. See `help for info on using it. You should totally try to hax0r it! Make sure you imagine it's running as root with no sandboxing. 02:16:50 `? le/rn 02:16:51 le/rn makes creating wisdom entries manually a thing of the past. 02:17:24 Aw, you've spoiled it. 02:17:35 The whole joke was that you couldn't create wisdom/le/rn with le/rn 02:17:47 I guess I did part of the spoiling. 02:19:17 `culprits wisdom/le/rn 02:19:18 shachaf shachaf 02:19:29 You took part twice, it seems. 02:20:01 `? le//rn 02:20:02 le/rn makes creating wisdom entries manually a thing of the past. 02:20:41 `? le/arn 02:20:41 lern 2 spel 02:20:59 Okey, isle lern. 02:23:38 `? zgrep 02:23:39 zgrep? ¯\(°_o)/¯ 02:24:23 -!- ais523 has quit. 02:24:32 -!- ais523 has joined. 02:25:42 -!- jaboja has quit (Ping timeout: 272 seconds). 02:27:12 i,i `le//rn le/arn//L'Arn est une rivière du sud de la France. 02:27:21 Unfortunately that's mixing up genders. :-( 02:29:03 -!- tjt263_ has joined. 02:32:57 -!- Phantom__Hoover has quit (Read error: Connection reset by peer). 02:45:47 -!- heroux has quit (Ping timeout: 264 seconds). 02:47:00 -!- heroux has joined. 02:48:45 shachaf: it's not the gender, but le turning into l' before a vowel hth 02:49:08 oerjan: they're both wrong hth 02:49:34 Arn is masculine if i'm reading https://fr.wiktionary.org/wiki/Arn correctly 02:50:31 Oh. 02:50:41 Then why is it "une"? Because of "rivière"? 02:51:25 I don't know French. 02:51:47 yes. 02:52:25 then fix it twh 02:52:32 le/arn -> l'arn 02:52:36 Arn and sud are masculine, rivière and France are feminine in that hth 02:52:39 l'arn 2 contractions 02:53:15 Of course, making bin/l'arn wouldn't hurt either. 02:53:21 i have only a shambling knowledge of french, but i have a knack for grammar. 02:53:46 wait, i left the fridge open... 02:58:05 -!- mihow has quit (Quit: mihow). 03:24:34 -!- adu has joined. 03:25:51 -!- lleu has quit (Read error: Connection reset by peer). 03:30:16 -!- lynn has joined. 03:31:22 Possibly new computational class: 0 03:32:07 The class 0 is all the machines that, for a given program and any input, produce a given message 03:32:23 Text is a language of computational class 0 03:34:12 QUESTION 03:34:38 What is the name of a program (sort of like "Compiler") that compiles a language to one of much lower computational class? 03:35:55 So if I was to make a more powerful variant on Text, what would the compiler be called? 03:37:02 `? le//rn 03:37:04 le/rn makes creating wisdom entries manually a thing of the past. 03:37:12 `? le/rn 03:37:14 le/rn makes creating wisdom entries manually a thing of the past. 03:38:04 hppavilion[1]: computational class is usually defined so that you cannot compile to a lower class 03:38:38 by being closed under reductions. 03:39:32 assuming, that is, that the compiler doesn't have access to the input the program will get, this is almost automatic. 03:39:36 oerjan: Yes, so what is the name of the program that e.g. takes a program written in hptext (which is equivalent to a PDA) and outputs a Text program? 03:39:54 hppavilion[1]: there is no such program, is what i'm saying. 03:39:59 Then again, I suppose it's really just redirecting the stdout to a file xD 03:40:06 oerjan: Yes, that's what I figured 03:40:20 since there is not Text program equivalent to the hptext program, you cannot compile down to one. 03:40:25 *no 03:42:02 it gets more subtle if the compiler also gets the input. hm in that case isn't it really the case that your compiler is a hptext interpreter... 03:42:52 when the target is Text that is. 03:44:41 hi all 03:45:01 adu: How do you ado? 03:45:18 hppavilion[1]: pretty fantastic, my cat is calm 03:45:41 adu: Yay for cats! 03:46:00 normally, he's one of those bounce-off-the-walls cats 03:47:50 adu: Also known as a "grep" 03:48:08 I thought grep was a verb? 03:48:23 like, "oh, I'll just grep my project dir" 03:49:09 adu: Yes, but any verb can be made a noun 03:49:13 unless it's a synonym for "ack", which I totally understand 03:49:24 (I was tempted to say "nouned", but that doesn't complement "verbing" very well) 03:49:31 lolol 03:49:46 <\oren\> oh I should post a picture of the thing I've been playing on all night 03:52:39 What would be a good memory model for a processor that is rarely used? 03:53:05 stone tablets hth 03:54:15 oerjan: What would be a good ABSTRACT memory model for a processor that is rarely used (the "that is rarely used" associates with "a...memory model") 03:56:09 <\oren\> https://imgur.com/a/plfGn 03:56:35 you should normally not put "that" right after a noun phrase it doesn't associate with hth 03:56:40 <\oren\> it has 470 NES games built in 03:57:31 if it's rarely used, you can probably drop caching? so just have a flat memory... 03:58:08 <\oren\> what do you think of the style of the casing? 04:03:26 Nicely Famicom. 04:09:30 <\oren\> i know right? my dad said it was "like made in the 1970's" 04:11:25 Strictly speaking, the Famicom was the early 80s, but still. :) 04:12:17 <\oren\> It also has lassi games like ikari warriors, rockman, angry birds 04:12:36 <\oren\> yes angry birds. they ported it to the NES 04:13:34 <\oren\> they also ported sonic to the NES 04:14:01 Yep, sounds like pirate Chinese equipment alright. 04:15:44 -!- Sprocklem has joined. 04:16:24 <\oren\> the menu has language options 中文 and English 04:18:21 <\oren\> I also like the fact it can be played on its own, or plugged into a TV 04:20:59 Are anonymous sum types ever useful? 04:21:09 Becuase I'm writing anonymous sum type code in Rust right now 04:22:27 <\oren\> in what sense anonymous? isn't that the same as a tuple? 04:23:11 <\oren\> oh wait, that's a product type 04:23:33 <\oren\> a sum type is a union, so... 04:26:33 <\oren\> well, an anonymous sum type as a function parameter would allow you to write one function for flot, double, int and long? 04:26:50 <\oren\> maybe? 04:29:58 <\oren\> or am I understanding this wrongly? 04:30:38 I don't think you are 04:33:04 -!- contrapumpkin has joined. 04:33:51 C11 has _Generic 04:35:35 -!- copumpkin has quit (Ping timeout: 240 seconds). 04:42:24 oerjan: I'm going for esoteric models of memory- models that aren't used often, but are still powerful 04:42:30 And possibly even useful in some scenarios 04:46:48 ok 04:47:37 oerjan: Basically, some alternative to big-array-of-registers-and-a-call-stack 04:50:12 -!- bb010g has joined. 04:51:13 \oren\: Has to be a tagged union for that to work 04:51:17 Which luckily, a sum type is 04:52:21 hppavilion[1]: my day-job research doesn't use a callstack; rather, each function knows which other functions can call it 04:52:35 ais523: Ooooh 04:52:37 and has a variable recording where the call came from, so it knows where to return 04:52:38 That sounds cool 04:52:52 But not eso enough 04:52:53 in the case of recursive functions you need an array instead, one for each recursion depth 04:53:04 and the reason we do things like this is for /really/ fine-grained NUMA 04:53:14 each function has its own independent RAM, they all work in parallel with each other 04:53:15 ais523: The calling convention in MIX uses self-modifying code to implement function calls. 04:53:22 <\oren\> hmm that sounds much easier to debug 04:53:23 thus no memory bandwidth issues 04:54:35 ais523: That sounds like a really irritating compilation target. 04:54:48 I'm going for something completely foreign to the way computers work. A graph, like my earlier GraphVM, perhaps? 04:55:10 pikhq_: we certainly have to use some unusual techniques 04:55:30 but the entire goal of the research was intended to take advantage of the capabilities of hardware 04:55:38 "little RAMs everywhere" is one of those 04:56:45 <\oren\> o reilly said if america feels the bern he'll move to ireland 04:56:55 LOL. 04:58:12 Good. 05:02:47 Perhaps I'll make multiple designs for multiple data models... 05:14:10 \oren\: Imagine his reaction when Obama gets reelected 05:15:48 -!- adu has quit (Quit: adu). 05:16:15 In 2017 05:16:22 Will it be as incredulous as mine? 05:16:48 hppavilion[1]: that can't happen without a constitutional change (or everyone relevant agreeing to just ignore the constutition, which is even more unlikely) 05:17:16 (I'll be stunned if the current Congress passes a nontrivial bill, much less an *amendment* getting rid of term limits.) 05:17:38 ais523: Yes, yes, I know. I'm FROM the US, and our school systems aren't failing THAT badly on the topic of ourselves 05:17:51 Are you sure? 05:18:02 pikhq_: Yes, I was making a joke 05:18:25 ais523: Also, I'm pretty sure if he got somehow voted into office by a write-in campaign or something like that, they'd let him in 05:18:40 Of course, he'd probably say "Nope, not doing this shit for four more years" 05:18:42 I don't think they would 05:19:11 ais523: Constitutions are to protect the people. If the people ALL agree that we want to override it, then let them. 05:19:35 "all" != "51%" 05:19:48 and ofc you can have plurality with less than 50% of the vote 05:20:08 ais523: Well yeah, of course 05:20:34 But in this case, "all" == 51%, because THERE CAN ONLY BE ONE 05:21:19 And 51%, when you consider the sheer number of people who'd have to vote against what they would normally think they should, is a LOT 05:22:54 <\oren\> bah, obama is right wing. 05:23:53 Is a brainfuck derivative still a stupid brainfuck derivative if it (a) more than doubles the number of symbols (a.a) has all of these symbols be useful for its purpose and (b) Doesn't explicitly state "is a brainfuck derivative" 05:24:00 So, I think the most interesting thing I can do with an anon sum type is make pattern matching something for it 05:24:06 (A DSL brainfuck derivative) 05:25:01 I'm trying to make a sort of cross between BF, C, and Rust that can be used for low-level programming 05:25:15 Sort of my OSFuck, but there were too many issues with it so I'm redesigning 05:25:38 \oren\: basically all americans are right wing, by European standards 05:25:39 -!- adu has joined. 05:26:10 Sgeo: OCaml has the ` syntax that basically lets you make up polymorphic sum types on the fly 05:26:23 Ooh 05:26:25 If you're not right wing by European standards, in the US you're practically a dirty pinko communist. 05:26:43 ais523: I'm a bit of a socialist. 05:26:45 e.g., `A 3 has the type [> `A of int] 05:26:52 Does Bernie count as right-wing? 05:26:58 Or is he too far left for Europeans? 05:27:00 and `B 4 has the type [> `B of int] 05:27:10 Or is he just off the right/left design completely? 05:27:18 I don't think he'd count as "too far left" for European politics. 05:27:20 and if you write a function that takes either and returns an integer, it has type [< `A of int | `B of int] -> int 05:27:40 the thing about Bernie is that it's hard to see how far he'd go, given where he's starting 05:28:05 most of his policies are no further left than centre-left by European standards even if taken to their logical conclusions, thouh 05:28:06 *though 05:28:09 ais523, so they're both ints, just labeled differently? 05:28:22 and has a variable recording where the call came from, so it knows where to return <-- istr reading that's what original FORTRAN did 05:28:25 Sgeo: right, but you can pattern match on the label 05:28:43 the function might look something like «function `A x -> x + 1 | `B x -> x - 1» 05:29:02 oerjan: original FORTRAN didn't have higher order functions though :-) 05:29:12 <\oren\> i remeber fox news was horrified over Trudeau 05:29:56 -!- adu has quit (Ping timeout: 245 seconds). 05:30:25 <\oren\> so probably canada is somewhat left of america as well 05:30:41 -!- adu has joined. 05:30:41 -!- adu has quit (Client Quit). 05:31:12 \oren\: Basically: In the developed world, America is pretty far right by most other people's standards 05:31:17 From their vantage point 05:31:30 In reality, it's pretty spread out, and everyone thinks it's too far in the other direction 05:31:40 Because of the persecution complex 05:33:10 hmm, thinking about it, Sanders' policies probably wouldn't go over too well in the UK because he wouldn't be trusted to balance the economy, but apart from that they wouldn't look out of place 05:33:14 that said, we have many of them already 05:33:27 (such as government-provided healthcare) 05:33:44 -!- b_jonas has quit (Ping timeout: 256 seconds). 05:34:02 I don't think I have an obvious way to do anonymous labels in Rust 05:34:09 Although I guess struct Foo; is close enough 05:38:17 hppavilion[1]: Well, there's `tomfoolery now. With no actual information in it. It searches tmflry/ for lies. It defaults to wisdom if it can't find anything. 05:38:53