2014-01-01: 00:00:52 ^celebrate UTC 00:00:52 \o| c.c \o/ ಠ_ಠ \m/ \m/ \o_ c.c _o/ \m/ \m/ ಠ_ಠ \o/ c.c |o/ 00:00:52 | c.c.c | ¯|¯⌠ `\o/´ | c.c.c | `\o/´ ¯|¯⌠ | c.c.c | 00:00:53 |\ c.c >\ /< | | /`\ c.c /^\ | |\|/< c.c |\ 00:00:53 (_|¯`\ /´\ 00:00:53 |_) (_| |_) 00:00:53 -!- Sgeo has joined. 00:04:50 Mousepad decided to scroll the opposite direction for a brief period of time 00:04:52 How bizarre 00:08:56 it's that timey-wimey new year stuff. 00:23:03 -!- olsner has joined. 00:23:15 -!- Phantom_Hoover has joined. 00:23:17 -!- Phantom_Hoover has quit (Changing host). 00:23:17 -!- Phantom_Hoover has joined. 00:23:34 ooh. colors explained ... http://www.girlgeniusonline.com/comic.php?date=20031121 00:29:10 -!- Jafet has quit (Changing host). 00:29:10 -!- Jafet has joined. 00:29:19 -!- Jafet has left. 00:30:04 hapy new yere 00:30:47 happy new year 00:32:04 happy new year! 00:32:57 oh, 2013 was BBB in base 13. 00:32:58 it's not year for you kmc stop pretending 00:50:51 -!- Bike has quit (Ping timeout: 272 seconds). 00:52:33 -!- Bike has joined. 00:55:48 -!- nucular has joined. 01:07:13 Even if the Worlds servers go offline forever, it will always be possible to visit the official Worlds.com worlds 01:07:49 thank god 01:08:14 Thank Nar'Quilak, god of the Worlds and all who inhabit them 01:10:56 Sgeo: why 01:11:54 -!- zzo38 has joined. 01:12:36 hi zzo38 01:12:44 what are you doing for new years eve 01:13:19 kmc: the built-in Worlds are stored locally 01:13:26 And there's an easy to use offline mode 01:17:06 Should I be using Mozart/Oz 1.4 or Mozart 2? 01:17:23 use at least 1.7 01:17:40 how's 2014 guys? 01:17:43 [Mozart 2] adds an extension interface to the virtual machine to allow language extensions defined within Oz." 01:17:50 ....suddenly I want Mozart 2 01:17:59 But the main documentation site is all 1 01:18:12 quintopia: so far it's pretty similar to late 2013 01:31:10 quintopia: apart from all the eldrich abominations, it's quite similar. 01:31:17 hth. 01:31:24 -!- Bike has quit (Ping timeout: 240 seconds). 01:31:26 oerjan: sorry we never killed the abomination 01:32:03 sorry, *eldritch 01:33:25 -!- Bike has joined. 01:34:26 -!- tromp_ has joined. 01:37:23 -!- Phantom_Hoover has quit (Read error: Connection reset by peer). 01:39:56 > (18/11, 5/3) 01:39:57 (1.6363636363636365,1.6666666666666667) 01:40:37 -!- Bike has quit (Ping timeout: 272 seconds). 01:41:44 -!- Bike has joined. 01:45:43 -!- oerjan has quit (Quit: Good night, don't let the shoggoths bite). 01:48:23 quintopia: I am not doing anything for new year's eve, yet 02:19:19 -!- Frooxius has quit (Quit: *bubbles away*). 02:19:32 -!- Frooxius has joined. 02:23:05 -!- olsner has quit (Quit: Leaving). 02:23:57 Psy vs. Linkin Park https://www.youtube.com/watch?v=ycHluR67jiY&list=PLgcoT7-W0fP258nmxEy-2pkFJftUKjdRi 02:24:38 seen. amazing 02:28:10 -!- zzo38 has quit (Quit: Leaving. Now I will let the shoggoths bite. (Sorry, oerjan)). 02:29:27 http://www.ytj.fi/english/yritystiedot.aspx?yavain=2486686&kielikoodi=3&tarkiste=DA735DFD038226CA09DA2531FAFD93B8303B1F73&path=1704;1736;2052 03:09:21 -!- yorick has quit (Read error: Connection reset by peer). 03:09:42 happy year! 03:12:06 same to you! 03:15:11 happy new year #esoteric~ 03:15:27 -!- oklopol has quit (Ping timeout: 260 seconds). 03:26:20 -!- LinearInterpol has changed nick to NewYearInterpol. 03:33:38 -!- conehead has joined. 03:35:15 -!- Bike has quit (Ping timeout: 272 seconds). 03:36:45 -!- Bike has joined. 03:38:20 -!- nucular has quit (Quit: I'm off. Happy new year.). 03:40:04 Oz's or construct... doesn't do this statically, it's more a deadlock if it fails, but still cool: All branches except 1 must ..fail.. So you do have to write conditionals in each branch to exclude the other branches 03:40:09 Which I think might be more readable 03:40:27 The 'conditionals' will run simultaneously 03:46:10 -!- zzo38 has joined. 03:48:59 -!- conehead has quit (Quit: Computer has gone to sleep.). 03:49:13 I made up a program in TI-92 calculator to select the puzzle chips for Puzzle Strike game at random. 04:04:25 -!- conehead has joined. 04:41:36 -!- mauke has quit (Disconnected by services). 04:41:46 -!- mauke has joined. 04:44:09 -!- preflex_ has joined. 04:44:27 -!- preflex has quit (Ping timeout: 252 seconds). 04:44:34 -!- preflex_ has changed nick to preflex. 05:21:57 -!- mrhmouse has joined. 05:46:41 zzo38: you should build a drinking game i bet you'd be rich 05:57:43 -!- mrhmouse has quit (Quit: Konversation terminated!). 06:00:21 -!- conehead has quit (Quit: Computer has gone to sleep.). 06:02:11 -!- NewYearInterpol has quit (Ping timeout: 272 seconds). 06:36:16 quintopia: I don't intend to do such a thing. 06:36:38 yes of course you don't you're zzo38 06:36:40 merry hristmasc 06:40:59 Given some pairs of starting and ending vertices on a graph, is the problem of finding a set of paths such that every vertex is hit as np-complete as the version with just one pair? 06:41:09 hit once 06:41:13 and only once, i guess 06:42:56 I don't know. 06:48:48 i guess you can probably turn that into normal hamiltonian path by adding edges between the starts and finishes. 06:48:58 directed, though 07:30:21 -!- nooodl has quit (Quit: Ik ga weg). 07:54:28 I think Oz's WaitNeeded is pretty cool 07:54:38 {WaitNeeded X} blocks until something else forces X 08:46:08 "Tune in next year for the exciting beginning!" 08:58:46 -!- carado has quit (Ping timeout: 246 seconds). 09:35:17 Now I added the year category 09:56:04 -!- nisstyre has quit (Quit: Leaving). 09:58:53 Did you know that some conditions can be implemented in TeX without using the \if... conditional commands? 10:00:37 For example: \def\equalcond#1#2#3{\begingroup\expandafter\def\csname\number#2\endcsname{False}\expandafter\def\csname\number#3\endcsname{True}\edef\next{\endgroup\noexpand\csname#1\csname\number#2\endcsname\noexpand\endcsname}\next} 10:01:18 I also have \nonzerocond, \lesscond, \oddcond, \hmodecond, \vmodecond, \voidcond, and \vboxcond. 10:14:32 } No, still looks like a blank. Ah, I've got it! It's that Unicode character that looks like a blank, is rendered as a blank, but is actually described as "a ghost in an invisibility cloak, juggling ferrets". 10:22:47 Sgeo, really? What code point is that? 10:23:26 U+THATWASJUSMEQUOTINGTHEINTERNETORACLENOTAREALOBSERVATION 10:25:05 Ah 10:51:09 -!- nisstyre has joined. 10:52:01 -!- oerjan has joined. 11:19:45 Can this 142-byte program be shortened even more? \newcount\-\let~\advance\day0\loop~\-1~\day1~\mit\ifnum\-=3\-0Fizz\fi\ifnum\fam=5Buzz\rm\fi\ifvmode\the\day\fi\endgraf\ifnum\day<`d\repeat\bye 11:26:27 -!- copumpkin has quit (Ping timeout: 260 seconds). 11:28:20 -!- nisstyre has quit (Quit: Leaving). 11:28:48 -!- copumpkin has joined. 11:58:08 -!- AnotherTest has joined. 11:59:58 -!- MindlessDrone has joined. 12:30:12 -!- Phantom_Hoover has joined. 12:46:56 zzo38: What does it do? 12:47:05 -!- olsner has joined. 12:56:03 -!- Sorella has quit (Remote host closed the connection). 12:56:23 -!- Sorella has joined. 13:10:14 -!- nooodl has joined. 13:19:56 -!- oklopol has joined. 13:22:24 -!- HaikuUser has joined. 13:22:53 -!- HaikuUser has quit (Client Quit). 13:31:54 FreeFull: It makes the "FizzBuzz" output 13:33:26 Ah 13:33:33 Didn't look at it carefully enough 13:34:50 I tried to shorten it with "code golf", without any error messages 13:37:46 I don't know if you can make it any shorter without switching to a different language 13:38:38 Yes, it can be shorter in other programming languages, but clearly that isn't what I am doing here. 13:39:11 I am writing it using TeX. 13:39:31 It does do a few strange things but maybe you can see if you can understand or not, these things. 13:42:29 For example, the use of \mit without math mode 13:44:07 \mit and \rm are both commands for changing the font, but this program never changes the font. \day is the register to store the current date, but this program doesn't care about the date and time. The \fam register is only for math mode, and this program doesn't use math mode. 13:47:05 Can you program in TeX at all? 13:58:29 -!- ais523 has joined. 13:59:31 -!- yorick has joined. 14:16:00 -!- NewYearInterpol has joined. 14:17:06 I can't 14:28:14 -!- tertu3 has quit (Ping timeout: 272 seconds). 14:28:36 Do you understand a bit so far what I explain? 14:29:55 -!- tertu has joined. 14:36:23 -!- tertu has quit (Ping timeout: 245 seconds). 14:55:23 Yeah 14:58:37 Note that \mit is defined something like \def\mit{\fam1 } so if ~ means \advance then ~\mit will increment the \fam register (which does nothing outside of math mode). The \rm command, in addition to selecting the roman font (which is already selected, so it won't change it), has the effect of setting \fam to zero. 15:00:44 So it can shorten by using existing macros in unusual ways. 15:09:09 -!- olsner has quit (Quit: Leaving). 15:26:08 Fun with side effects 15:30:05 FreeFull: you don't prefer your fun to be pure? 15:30:37 That's much more boring because you know what will happen 15:37:58 -!- nucular has joined. 15:52:27 -!- conehead has joined. 15:56:51 -!- Jafet has joined. 16:07:50 “Theoretically, certain types of sleep could be possible while flying, but technical difficulties preclude the recording of brain activity in birds while they are flying.” 16:09:30 > (\(Sorted xs) -> xs) $ foldMap (Sorted . (:[])) [1,5,3,6,7,2] :: [Integer] 16:09:32 [1,2,3,5,6,7] 16:13:02 -!- oerjan has quit (Quit: leaving). 16:17:11 -!- nucular has quit (Ping timeout: 252 seconds). 16:35:20 -!- nucular has joined. 16:35:20 -!- nucular has quit (Changing host). 16:35:20 -!- nucular has joined. 16:39:31 -!- nucular has quit (Ping timeout: 240 seconds). 16:42:10 -!- carado has joined. 16:46:28 I've been trying to find out more about SURFIT, an ancestor of Core War. 16:48:50 > (\(Sorted xs) -> xs) $ foldMap (Sorted . (:[])) ['z','x'..] 16:48:51 "\NUL\STX\EOT\ACK\b\n\f\SO\DLE\DC2\DC4\SYN\CAN\SUB\FS\RS \"$&(*,.02468:<>@BD... 16:48:57 -!- Phantom_Hoover has quit (Read error: Connection reset by peer). 16:49:02 > (\(Sorted xs) -> xs) $ foldMap (Sorted . (:[])) ['z','x'..'a'] 16:49:04 "bdfhjlnprtvxz" 16:49:46 I bet there is some way to combine compression with programming 16:49:57 There doesn't appear to be anything online apart from what I just posted https://plus.google.com/102212268901593257476/posts/YQs8bnXAdsc 16:50:20 @localtime Taneb 16:50:20 Local time for Taneb is Wed Jan 1 16:50:20 16:50:26 I need a clock 16:51:07 FreeFull: there are compression quines 16:51:09 those are fun 16:53:49 * impomatic wonders if anyone has written a threaded Forth with dictionary compression. 16:54:24 ais523: I was thinking of a language where meaning changes as you go through the source code, in a similar way to compression sort of 16:54:52 Where future code would refer to slices of past code, but more complex than that 16:55:15 Eventually, FreeFull invents FORTRAN. 16:56:07 You know that's not how I meant it =P 16:56:42 Now I want to make zperl 16:56:56 -!- nucular has joined. 16:57:01 That'd be a good name for it 16:57:30 you could use compression-like rules for flow control 16:57:40 like, have no loops or conditionals, all you can do is repeat commands that ran earlier 17:01:44 So boring, why not design around actual compression. A program that retains meaning when reduced in the frequency domain. 17:02:24 (cf. http://www.ioccc.org/2011/akari/akari.c) 17:04:01 what about a language with the restriction that the compiler rejects source files that become smaller when compressed? 17:04:13 i.e. it aggressively rejects code duplication 17:04:32 preferably using a compression algorithm that isn't fooled by adding large random comments 17:12:43 -!- conehead has quit (Quit: Computer has gone to sleep.). 17:13:05 You don't get comments, you just get code that you skip over 17:13:16 I'm not sure if such a language would be turing complete 17:20:43 If the language is defined such that a program's output is interpreted as a program in another language, then any (second-stage) program can be written in its Kolmogorov length. 17:21:57 FreeFull: no, I don't mean skipped code / comments in particular 17:22:10 I mean a compression algorithm that still compresses the compressible bits even if there are incompressible bits too 17:22:12 like azip 17:23:44 -!- Phantom_Hoover has joined. 17:29:30 -!- conehead has joined. 17:31:10 -!- nucular has quit (Ping timeout: 246 seconds). 17:32:15 -!- nucular has joined. 17:40:05 -!- tertu has joined. 18:11:35 -!- nucular has quit (Ping timeout: 252 seconds). 18:12:18 -!- nucular has joined. 18:12:19 -!- nucular has quit (Excess Flood). 18:13:01 -!- nucular has joined. 18:13:03 -!- nucular has quit (Excess Flood). 18:14:52 -!- olsner has joined. 18:18:53 FreeFull: check out my language ETAS. it kind of does what you're talking about 18:19:21 `? ETAS 18:19:26 ETAS? ¯\(°​_o)/¯ 18:19:31 http://esolangs.org/wiki/ETAS 18:19:32 http://esolangs.org/wiki/ETAS 18:19:33 perhaps 18:19:46 quintopia: You made it =P 18:20:58 FreeFull: except that it does have that jump command which may not be required for turing-completeness. i should probably remove it. 18:28:24 http://www.reddit.com/r/science/comments/1u5odz/dogs_poop_in_alignment_with_earths_magnetic_field/ fascinating. 18:31:26 -!- impomatic has quit (Quit: impomatic). 18:33:42 quintopia: if zzo asked me for reading frames I would just point to x86 18:36:13 Jafet: do you know of any programs for x86 that predictably perform different useful tasks depending upon your starting offset into the program (no cheating by putting programs in as data or jumping past them) 18:37:00 Why is that cheating 18:37:14 i believe that is the basic idea behind "functions" 18:37:26 (Try writing a nontrivial "etas" program without doing that) 18:37:57 Jafet: it would be hard, but, i would hope, at least possible. 18:41:27 http://www.ioccc.org/2011/akari/akari.c may be relevant (resampling a program to get another program) 18:42:08 quintopia: someone linked a paper about finding unintended code sequences to use for exploits a while ago 18:42:11 To achieve this, the original program has to be very redundant. 18:42:46 ROP uses a large amount of jumping, so it is "cheating" in the above sense 18:42:53 Jafet: yeah i really like that submission 18:43:07 More importantly, it is cheating because the actual program is the prepared stack 18:44:42 Jafet: but the goal with etas was to have something that was "the middle bits of an instruction" later be parsed as "the beginning of an instruction". it's not something i had ever seen in another language. 18:45:46 The only reasonable way to multiprogram in etas, I think, is to cheat 18:46:54 The difficulty probably depends highly on the instruction encoding. 18:47:40 yeah probably 18:48:20 still, it didn't seem possible to program in malbolge either at one point... 18:48:57 Jafet: but the goal with etas was to have something that was "the middle bits of an instruction" later be parsed as "the beginning of an instruction". it's not something i had ever seen in another language. ← see MiniMAX, http://esolangs.org/wiki/MiniMAX 18:49:15 it's the only way to do any sort of flow control, arithmetic, or well anything 18:49:46 ais523: yeah i think i saw that well after i made etas 18:50:01 each instruction is three bytes long, one is a value to write, one is overwritten by the value-to-write of the next command, and one tells you which command to run next (unconditionally) 18:50:12 you're not going to get anywhere without command-punning in that language 18:50:42 -!- conehead has quit (Quit: Textual IRC Client: www.textualapp.com). 18:56:08 i should read the smallfuck interpreter code. it's not clear to me how it would work 19:09:16 "We're just going through our records and -- even though you're one of our best supporters -- it looks like you're not a 2013 founding member." ... pretty sure I donated money between 0 and 1 times. I pretty much ignore these emails... is "best supporter" just supposed to make me feel good, it's just a lie? 19:10:08 Sgeo: I suspect so, mail order catalogues do that all the time 19:49:45 -!- typeclassy_ has joined. 19:51:43 -!- augur_ has joined. 19:52:28 -!- ski_ has joined. 19:52:47 -!- jix_ has joined. 19:53:50 -!- CADD_ has joined. 19:55:41 -!- fizzie` has joined. 19:56:04 -!- nycs has joined. 19:58:18 -!- augur has quit (*.net *.split). 19:58:18 -!- CADD has quit (*.net *.split). 19:58:18 -!- typeclassy has quit (*.net *.split). 19:58:18 -!- Deewiant has quit (*.net *.split). 19:58:18 -!- `^_^v has quit (*.net *.split). 19:58:19 -!- ski has quit (*.net *.split). 19:58:19 -!- jix has quit (*.net *.split). 19:58:20 -!- fizzie has quit (*.net *.split). 19:58:24 -!- typeclassy_ has changed nick to typeclassy. 19:58:32 -!- CADD_ has changed nick to CADD. 20:00:24 -!- Deewiant has joined. 20:00:39 -!- olsner has quit (Quit: Leaving). 20:04:29 -!- FreeFull_ has joined. 20:09:04 -!- FreeFull has quit (*.net *.split). 20:09:05 -!- fungot has quit (*.net *.split). 20:21:37 -!- nooodl has quit (Ping timeout: 246 seconds). 20:21:46 -!- nooodl has joined. 20:46:10 -!- rodgort has quit (Ping timeout: 245 seconds). 20:47:02 -!- fizzie` has changed nick to fizzie. 20:47:18 I had acquired some kind of an extra bit. 20:48:18 -!- impomatic has joined. 20:49:58 -!- rodgort has joined. 20:54:15 -!- rodgort has quit (Excess Flood). 20:58:43 -!- rodgort has joined. 21:03:08 -!- LavaLevel has joined. 21:03:12 -!- MindlessDrone has quit (Quit: MindlessDrone). 21:03:37 -!- LavaLevel has left. 21:04:28 -!- FreeFull_ has changed nick to FreeFull. 21:18:21 Wow, the sale for Just Cause 2 has some fucked up pricing. The cheapest option is not to buy the "Collection" with the game + the DLC, nor is it to buy the game then the DLC pack. No it is to buy the game and then the DLC individually it appears! 21:18:35 Steam... 21:20:12 -!- conehead has joined. 21:20:25 -!- conehead has quit (Remote host closed the connection). 21:20:53 -!- conehead has joined. 21:23:10 Basically Just Cause 2 is 80% off. Most of the individual DLC are 81% off(!!!). Except one that is 80% off. The collections are only 50% off each. 21:25:19 -!- nisstyre has joined. 21:26:14 ah but I can save even more money by not buying the game at all. 21:26:38 int-e: not as much as me! 21:28:59 int-e, well yeah, but in what other game can you go out on the wing of a aircraft you are flying and *grapple hook* over to another aircraft and then throw the pilot out through the window 21:29:27 Just Cause 2 is one hell of an awesome sandbox game for just doing crazy stuff in 21:29:51 Such as using your two point grapple hook to tow a tank with a Boeing 747 21:30:20 Vorpal: "Price of individual games: 6,11€" "Bundle cost: 14,99€" yes, it looks like a good deal. 21:30:46 fizzie, eh? What? 21:30:55 fizzie, the game costs 2.99 discounted here 21:31:06 and the DLC add up to 1.73 EUR 21:31:14 fizzie, I can't get that to 6.11 21:31:18 apparently they've started making USB drives show up as internal disks in windows 21:31:19 Vorpal: That was for the collection including also the first game. 21:31:37 -!- oerjan has joined. 21:31:38 fizzie, ah right, well the first game is meh from what I heard 21:32:16 fizzie, also the multi player mod for Just Cause 2 recently released 21:32:31 elliott: who "they"? 21:33:00 elliott, that happened in windows 7 didn't it? At least external rotational USB HDDs had to be removed by "safe removal" thingy in the area next to the clock which I forgot the name of 21:33:15 Unlike USB flash sticks which you can just right click and select eject on 21:34:09 Vorpal: It's the "notification area" these days. 21:34:31 Ah 21:34:36 "When referring to the notification area: Refer to the notification area as the notification area, not the system tray." (MSDN) 21:34:59 Also: "Do not taunt the notification area." (Not MSDN, sadly.) 21:35:40 so why is the notification area full of stuff that's not notifications? 21:35:55 because people think it's a good place to put advertising 21:36:02 Because everyone still treats it as the system tray 21:36:09 Because people can't follow directions, perhaps. 21:36:12 "Well-designed programs use the notification area appropriately, without being annoying or distracting." 21:36:24 these rules exist because they're so often violated 21:36:25 oh. 21:36:31 (It doesn't say what programs that are not well-designed do.) 21:36:46 The only static icons there that has ever been of any use to me have been the network status and on non-multimedia keyboards, the volume setting 21:36:46 if it's not supposed to distract it should be invisible at all times. 21:37:25 I assume the fact everyone puts an always-visible icon there is what made them implement the notification area icon hiding thing. 21:37:29 I have no idea why steam on windows minimizes into that area also 21:37:35 fizzie, probably 21:37:42 That thing is really useful 21:38:04 Oh yeah at work I also have the Incredibuild icon there. That is like a distcc for windows 21:38:44 Actually more like a distributed make, since it is a bit smarter about it than distcc 21:38:48 Linux Steam pops up a tray (it's really a tray, the freedesktop.org specification says so) icon too. 21:39:42 fizzie, yes but it *also* stays in the normal task bar as well when minimized 21:39:47 Unlike on Windows 21:40:34 XChat and VLC manages to properly minimize to that tray if you want to at least 21:40:41 Not that I see the point of that 21:40:50 I don't know if Linux Steam knows how to put up an Ayatana "indicator" if running under a Gnomey thing. 21:41:05 what is "Ayatana"? 21:41:27 Sorry, I guess Ayatana indicators are maybe Ubuntu-specific? I don't really know how it goes. 21:41:36 Also yeah MATE would definitely count as Gnomey 21:41:52 Debian with MATE here, mate 21:41:59 fizzie: Ayatana's Ubuntu-specific, indeed 21:42:08 It's part of the Ubuntu "user experience" project, I don't know if regular Gnome got the indicators. 21:42:20 Uh 21:42:25 VLC on Ubuntu should be hiding in the launcher with a context menu, rather than the tray with a context area 21:42:27 but it isn't 21:42:48 ais523, it only uses the tray if you click on the tray icon to minimize it 21:43:00 Otherwise it simply minimizes to the normal task bar 21:43:03 same with xchat 21:43:10 Vorpal: what annoys me is that it has a tray icon at all 21:43:13 although you can turn that off 21:43:30 it doesn't have nice controls on the right-click menu on the launcher like Totem does, though, because it's not Unity-aware 21:44:02 Eh, someone who is computer savy and uses Unity? 21:44:05 There's at least a GNOME Shell extension to integrate "indicators" there. Though as far as I can tell, it's not part of Gnome proper, perhaps. 21:44:06 Didn't expect that 21:44:19 Vorpal: I /like/ Unity :-( 21:44:23 but it is rather slow and buggy 21:44:29 actually most of the slowness is Zeitgeist's fault 21:44:33 Last I tried unity, which was admittedly in the first ubuntu version it was included, it was terrible 21:44:44 What is Zeitgeist now again? 21:44:49 until recently I used it just for the launcher 21:45:08 (Fun fact: Ayatana also includes "windicators".) 21:45:11 although more recently the lenses/scopes have been useful too 21:45:27 Vorpal: Zeitgeist's purpose is basically recording which files you've opened 21:45:29 fizzie, you say gnome shell, are you talking about the abomination that is Gnome 3? 21:45:32 in order to get useful "recently used" output 21:45:39 except it is mindbogglingly overengineered for that purpose 21:45:39 Ah 21:45:46 Vorpal: Sure, that's what Gnome is. 21:46:02 ais523: I wanted to ask you. Do you know of any good let's plays that do weird things and pretend they're entirely normal. I watched an absolutely brilliant Link's Awakening one 21:46:24 ais523, hm Spotlight on OS X and even more so the Windows 7 start menu search/run field works fine. How hard could it be to replicate that 21:46:29 coppro: I don't like that style of play, really 21:46:32 which btw I have been looking for under linux 21:46:34 if people are being weird I like them to acknowledge it 21:46:35 not yet found it 21:46:48 ais523: I find ig hilarious 21:46:51 *it 21:46:57 so no, although there was a Link's Awakening speedrun like that at one of the SDA marathons 21:47:01 it's a good game to act like that 21:47:04 "watch out for the old grandmas here, sometimes they shoot octoroks at you" 21:47:05 coppro, lparchive? Or some youtube thing? 21:47:15 I played Dungeons&Dragons game this morning. My plan wasn't necessary; I was hoping it wouldn't be necessary, since it would be complicated to set up. 21:47:20 My favourite LP is the Planescape Torment one on lparchive 21:47:22 I guess the problem with pretending it's normal is that you don't get an explanation of the technical details 21:47:47 It wasn't very good to eat, but, that's OK 21:48:31 "watch out for the old grandmas here, sometimes they shoot octoroks at you" <-- he glitched the game? 21:48:37 Or e I guess 21:49:00 Vorpal: very very heavily 21:49:23 watch out for the birdphone 21:49:25 When speed running gets to that level I find it detracts from the experience 21:49:31 ais523, birdphone? 21:49:52 Vorpal: it's a character that acts like a shopkeeper (up to the instakill effect) 21:49:57 but looks like a bird or a telephone 21:49:57 I just get google hits for someone's twitter account 21:50:02 changing between them repeatedly 21:50:22 ais523, in what game? 21:50:29 Link's Awakening 21:50:51 Vorpal: "Welcome to the first dungeon. I don't know why they call it level 8, the developers can't count or something. Now we're about to get the fire rod... it's really strange that they put the strongest item in the first dungeon." 21:50:54 it's probably the most memorable effect of the major glitching 21:51:01 http://www.youtube.com/watch?v=EZP63oRVcgg fantastic 21:51:31 will watch in a second, just going through the latest ocremixes. They decided to post 10 today. 21:51:55 -!- pikhq_ has quit (Ping timeout: 246 seconds). 21:52:15 -!- augur_ has changed nick to augur. 21:52:47 Somehow I think I've been getting less of the HTML5 player in YouTube lately. :/ 21:53:07 Ah found the LP in question 21:53:16 Yeah this might be run to look at 21:53:24 Given that I know how the game is *supposed* to go 22:00:17 nooodl: that reminds me of messing around with that bug with the dog house 22:03:08 coppro: what Link's Awakening let's play was this? 22:03:20 I don't have a link on hand, but vorpal found it apparently 22:03:36 Oh, ah 22:03:44 Vorpal: mind passing a link to it? 22:07:33 FireFly, http://lparchive.org/Legend-of-Zelda-Links-Awakening/ 22:07:41 I assume that is what he meant, it fits the bill perfectly 22:07:51 Also yes it is super-funny if you know how the game is supposed to go 22:07:57 It makes NO bloody sense if you don't 22:09:47 Thanks 22:15:47 coppro, this is bloody amazing 22:16:15 -!- nisstyre has quit (Ping timeout: 272 seconds). 22:17:57 I'd love to see, e.g. a Metroid Prime any% run done like that 22:18:22 coppro, are there suitable glitches in that game? 22:18:45 yes 22:19:13 in terms of sheer absurdity, MP2 would probably be better, because it involves way more out of bounds 22:21:14 the start of the Metroid Prime 2 run at AGDQ2013 was done like that 22:21:19 but they couldn't really keep it up 22:24:31 haha 22:25:04 I guess they might actually do that for miles' run next week 22:25:16 it'll only be an hour long and there are plenty of glitches throughout 22:25:24 -!- AnotherTest has quit (Ping timeout: 252 seconds). 22:25:27 it's MP1 any%, isn't it? 22:25:44 that's not particularly glitchy, in the sense that most of the things it does, it's believable that they're intended 22:25:52 apart from the out of bounds segment, but there's only one short one 22:25:52 no, not at all 22:26:04 it is any%, but there's so much breakage 22:26:06 they aren't intended, but they don't look so massively unintended 22:26:21 most of it's just "jump further than expected" or "jump higher than expected" 22:26:34 not in terms of actual glitches, but the sequence breaks 22:26:44 yeah, the sequence is completely different 22:26:46 but it's a Metroid game 22:26:51 you're meant to be able to do that 22:26:56 not at all 22:27:01 Space Jump first? sure, why not 22:28:09 you're meant to be able to do that <-- to some extent 22:28:18 I only played about half of Super Metroid 22:28:34 And some stuff was definitely gated by needing something else to reach it 22:28:39 most of the MP sequence breaks are glitches and were corrected in later editions; fusion, prime 3, and other M are all linear games built with triggers so you can't really break them 22:29:35 Vorpal: hardly anything, because Super Metroid has a bunch of special moves you're not meant to realise exist the first time through 22:29:43 ais523, oh? 22:29:46 coppro: actually, Prime 3 has already been broken 22:29:55 super metroid and zero mission were built with more stuff 22:30:01 Fusion and Other M have been attempted to break, but Fusion softlocks if you go out of sequence 22:30:09 and Other M is full of invisible walls 22:30:21 ais523: yeah, prime 3 can only really be broken with OOB though 22:30:44 Vorpal: the main ones are the walljump and six varieties of shinespark (the game only tells you about one of them, and even then only in an optional area) 22:30:50 so it's really a different class of glitch 22:30:59 coppro: Hazard Shield skip 22:30:59 ais523, shinespark? 22:31:09 ais523: yeah, that one wokrs 22:31:10 *works 22:31:20 Vorpal: if you don't know what a shinespark is, then it's safe to say that you don't understand what intended breaks are built into Super Metroid 22:31:28 the easy way to do one, a ground-based vertical one 22:31:34 is to get up to speed boost speed, crouch, then jump 22:31:35 ais523: it's hard to know if they're all intended 22:31:40 then you keep going upwards 22:31:41 ais523, yeah as I said I only got about 1/4 to 1/2 into it 22:31:51 it's entirely possible that the devs just didn't think about the consequences of the shinespark 22:32:03 and there are definitely dumb physics glitches like the gravity glitch 22:32:14 coppro: in my opinion, it's most likely that they explicitly didn't want to think about the consequences 22:32:23 yeah, that's possible 22:32:26 ais523: you also forgot the ridiculous things you can do with bomb jumps 22:32:30 anyway, Super Metroid has a definite intended sequence 22:32:36 yeah 22:32:37 coppro: no, I didn't mention the infinite bomb jump, because it's possible it's a glitch 22:32:40 rather than intended 22:32:51 ais523: not even the infinite one, but the sideways ones 22:32:52 whereas the shinespark is most definitely intended, as is walljump, as is crystal flash 22:33:04 gravity suit physics is definitely a glitch too 22:33:09 that glitch is in lots of games 22:33:11 but yeah, I agree that the philosophy of SM is very different 22:33:16 it works in many Zelda games, for instance 22:33:41 ais523: I believe it 22:33:57 I have on my hard-drive an unfinished guide to glitches that appear all the time in games 22:34:12 some even work in NetHack :-) 22:34:26 ais523, I just googled shinespark. I do believe I activated some variant of it by mistake at some point but never figured out how to do it again. But it was years ago I played any metroid, didn't really like the game, so I never went back to it. 22:34:34 So I could misremember 22:34:47 ais523: What glitches are some of them? 22:34:50 Vorpal: anyway, the point is that most of the areas that appear to require specific items 22:34:57 And in what kind of games? 22:35:01 are actually accessible via a combination of walljumps, infinite bomb jumps, and shinesparks 22:35:01 the big difference between SM and MP I think is that SM has a bunch of features, and doesn't work in all the details of how they might affect the sequence. MP breaks almost exclusively require physics glitches 22:35:18 SJF is unusual in that it *doesn't*, but the devs attempted to squash it in future versions anyways 22:35:22 coppro: well they're mostly numerical glitches 22:35:39 SJF is a numerical glitch in that you get it via dashing further than you should be able to 22:35:56 yeah, actually, I guess the exact dash effect could be seen as a glitch too 22:35:58 actually you can get it by bombjumping too, but that needs you to actually get bombs first 22:36:02 but there's other things, like early Wild 22:36:08 which is just a poorly placed trigger 22:36:10 coppro: well they tried to fix it in Metroid Prime 2, and in Metroid Prime PAL 22:36:21 in Metroid Prime 2, you have to let go of L (as in MP1) but also hold R, which is diffrent from MP1 22:36:36 in the PAL version, you have to do it off an enemy, which means luring an enemy out of one of the nearby corridors, so it's much slower 22:36:45 yeah 22:36:53 also, early Wild isn't a poorly placed trigger 22:36:58 that's like the only place in the game where an infinite bomb jump works 22:37:06 I'd say the trigger's in the right place but the walls are weird 22:37:19 making the infinite bomb jump possible 22:37:55 but then, early Wild is awesome and the game's better for it existing 22:37:59 and it doesn't hurt anything 22:38:01 other great ones: cargo ship skip, every thing about skipping Thardus 22:38:08 it's not like the Artifact of Wild actually does anything until after you'd normally need it 22:38:12 TBJ breaks a lot and you can do worse 22:39:21 also triple bomb jumps are pretty rarely useful 22:39:51 cargo ship skip is the only one I can think of offhand, now that the rune door leading to the Charge Beam (?) turns out to be faster in in-game time to do the intended way 22:40:09 I think you're thinking the one to flaaghra 22:40:57 could be 22:41:01 I was trying to remember which was which 22:41:07 they are so similar-looking :-( 22:41:23 nah, the charge beam one is a big round one 22:42:35 right 22:42:46 I thought the big round one went to Flaahgra 22:42:50 also, something that I've been wondering about 22:42:57 what do you actually need the charge beam for? 22:43:12 even low%s get it, and I don't think they need super missiles 22:43:23 and the only point I can think of that might potentially need it is the entrance to Phendrana 22:44:57 coppro, wow the logistics of making that glitch Zelda LA LP 22:45:35 ais523: ugh, I was reading this discussion on m2k2 the other day and now I can't remember 22:45:38 hmm 22:45:52 I was thinking of looking on m2k2 22:45:56 are the forums still alive? 22:46:01 very 22:46:13 I'll find it 22:46:14 I know the main website wasn't, last I looked 22:46:19 I'll race you :-) 22:47:04 charge beam has been skipped 22:47:32 current min% is missiles, morph ball, bombs, varia, wave, ice, plasma, pbs, xray, and artifacts 22:48:32 ah right 22:48:48 hmm, now I'm wondering which missiles that is 22:49:05 could be the intended ones, I guess, there's no reason not to except it's a long fight 22:49:22 also that min% doesn't add up 22:49:35 12 artifacts + 9 items 22:49:47 12 artifacts, + {missiles, morph ball, bombs, varia, wave, ice, plasma, power bombs, x-ray scope} 22:49:51 that skips phazon suit 22:49:55 which is required for the final boss 22:50:20 phazon suit isn't a % unless it's the last one 22:50:41 oh, it doesn't count towards percentage if you don't have gravity? 22:50:42 that's weird 22:50:49 I thought it counted for 2% 22:50:50 no, it doesn't count unless you have all other items 22:51:36 err, OK :-) 22:51:46 or maybe it doesn't count at all and the game just has no 99%; I don't know if anyone's gotten the energy tank afterward without it to be able to test this 22:51:47 MP1's percentage counter is weird 22:52:08 did you know that collecting all the power bomb expansions but not the main power bombs gives you the same percentage as collecting the main power bombs? 22:52:17 nope 22:52:23 I guess it just counts by number of PBs? 22:52:26 yeah 22:52:37 in Metroid Prime 2, they just add 1% whenever you collect an item 22:52:47 so you can get 101% because there's one missile expansion you can pick up twice 22:53:04 the MP1 counter sounds like every bug ever in NetHack 22:53:45 the infinite boost item loss skip is so stupid 22:54:08 that one makes no sense 22:54:16 I know the technical details are that it triggers every cutscene in the room at the same time 22:54:28 and the one where you land triggers before the one where you start falling so you end up at the wrong position 22:54:31 is that it? wow 22:54:45 but I have no idea /why/ it triggers every cutscene in the room at the same time 22:54:50 maybe Samus ends up infinitely large or something 22:54:55 hitting all the triggers at once 22:54:59 yeah 22:55:27 the 20% MP1 thread on m2k2 is fun to read 22:56:19 yes 22:56:32 morph ball, missiles, bombs, pbs, xray, and artifacts all seem entirely unskipabble, barring some insane break that lets you into the impact crater without the artifacts 22:57:46 missiles aren't actually required for anything but doors, right? 22:57:50 I put them in the same category as beams 22:58:01 possibly slightly easier because you don't have to hit the final boss with them 22:58:11 getting the artifact of nature from the stalagmite 22:58:22 can't you do that with the Charge Beam? 22:58:48 maybe, but then you go up a % anyway 22:58:52 so it's irrelevant 22:58:59 oh right, ofc 22:59:08 or, hmm 22:59:17 yeah 22:59:35 one suggestion in the 20% thread was to get SJ and try and lose varia (assuming that SJ will help crossing magmoor) and something else like wave 22:59:38 bombs are required for bomb jumps, in addition to many obstacles 22:59:40 wave seems like a popular target 22:59:57 yeah but how do you beat the final boss without it? 23:00:04 just wait for him to change naturally 23:00:04 there aren't that many places you need it otherwise 23:00:12 I don't think he does in the first wave phase 23:00:14 doors are the problem; they need to be SWed around 23:00:20 or she 23:00:36 actually I prefer the "Dark Samus is male" theory but it's not very popular 23:00:55 I ascribe Dark Samus as female, but Metroid Prime as genderless 23:01:08 and I tend to run with the French convention of using the masculine for neutral/unknown 23:01:21 -!- bagulhex has joined. 23:01:28 due to having been in French immersion 23:07:11 -!- nooodl_ has joined. 23:08:15 -!- nooodl has quit (Ping timeout: 245 seconds). 23:32:38 coppro: btw, looking up the beam use on the final boss itself, it forces you to use power/ice/wave but you can get away without plasma 23:32:46 because it's reached the spontaneous-change phase before plasma is required 23:38:15 -!- conehead has quit (Quit: Computer has gone to sleep.). 23:42:13 -!- bagulhex has quit (Ping timeout: 245 seconds). 23:58:17 -!- pikhq has joined. 2014-01-02: 00:00:33 ais523: ah ok. I think what they're trying to do with wave is wallcrawl to plasma without it 00:00:41 and then pick it up later 00:01:03 they're trying to get into Phendrana without Varia 00:01:15 which requires Wave (obviously impossible), or Plasma + a bunch of tricks that haven't been found yet 00:01:17 but they're looking for them 00:01:45 oh, I get it 00:01:52 they're trying to go through the back door 00:02:04 yes 00:02:15 and they're down to needing only 2 more tricks 00:02:58 do you know offhand if you can wallcrawl out of the magmoor damage, like you can in dark aether? 00:03:22 no 00:11:41 -!- bagulhex has joined. 00:14:56 -!- nucular has joined. 00:20:58 coppro, ais523, did any of you play other m by any chance 00:21:06 Phantom_Hoover: hahahahahahahaha 00:22:17 Phantom_Hoover: I've beaten it 00:22:28 I'm not sure why the question is *that* funny to ais523 00:22:32 "The discovery of this room was a complete accident – much like this entire project – and to top it off, it is in a default world." 00:22:33 awww yiss, you guys are talking metroid? 00:22:40 So WHY did you categorize it as a "custom" world? 00:22:55 love me some Prime. 00:22:58 coppro, the joke is other m 00:23:21 -!- conehead has joined. 00:23:52 NewYearInterpol: it's highly on topic here 00:24:27 well, not /really/, unless someone proves Metroid TC 00:24:38 it's probably PSPACE_complete the same way Mario is, actually 00:24:42 this channel is not actually about esoteric programming languages 00:24:51 yeah, I keep leaving because of that 00:25:21 why do you come back? 00:25:40 http://arxiv.org/pdf/1203.1895v1.pdf 00:25:49 this channel is actually about metroid. 00:26:13 And... this person misunderstands how Worlds actually works 00:28:04 Worlds? 00:28:11 Sgeo: wat u play. 00:28:50 WorldsPlayer 00:29:04 What is that? 00:29:44 coppro: hope that it's got better 00:29:50 or occasionally to test out a BF Joust program 00:29:52 hmm 00:30:10 in zero mission you can grab a ledge and morph from it, right? 00:30:17 NewYearInterpol: really, really old 3d chat program 00:30:17 that would break the constructions for Zero Mission 00:30:24 Sgeo: hahhaha. 00:30:25 with the Power Grip, yes, I think 00:30:36 coppro: yep. 00:30:42 you can use crumble blocks, though 00:30:47 in order to create one-way corridors 00:30:48 I hope this note I left isn't too rude http://gradualdime.wikia.com/wiki/Animal_House_Control_Room 00:30:55 wait a minute. 00:30:58 the hard part is creating switches that have effects down the line 00:31:06 are you guys doing metroid ROM hacking? 00:31:30 we're discussing the computational class of Metroid games 00:31:43 so metroid ROM hacking. 00:31:56 not really, just level editing 00:31:59 well, more like theoretical ROM hacking 00:32:03 we're not planning to hack any ROMs 00:32:06 along the lines of the mario and dkcountry NP proofs 00:32:06 just to discuss how it might work 00:32:13 (i love that that paper had figures) 00:32:16 I suspect that the proof still holds, you just need more complicated gadgets 00:32:31 discuss the turing completeness of super metroid. 00:32:47 -!- JZTech101 has joined. 00:32:53 well for Mario and Donkey Kong Country, you can use shells/barrels 00:32:55 can you just not provide spacejump and use gravity for diodes? 00:33:02 i guess i don't remember how the mechanisms worked anyway. 00:33:05 Bike: infinite wall jump can be done with no items 00:33:06 I'm just talking metroid games with power trip 00:33:08 *grip 00:33:09 but you can use crumble blocks for diodes 00:33:11 that's what they're for 00:33:20 completely undefeatable 00:33:23 man, i could never walljump for ass. 00:33:30 could you walljump in the original? 00:33:30 Bike: it's intentionally difficult 00:33:33 so that you won't find it by mistake 00:33:37 super metroid cheats and has a crossover built in 00:33:39 and in the original probably not 00:33:50 i've never played super metroid >_> 00:33:54 coppro: that really long pipe thing in Maridia? 00:33:57 yeah 00:34:05 got the rom but it turns out phone touchpads are not good enough for snes controls 00:34:09 filling a game of /those/ would be tedious 00:34:26 Bike: especially not Super Metroid, which has famously convoluted controls 00:34:36 they had to simplify them for Fusion because of fewer buttons 00:34:54 geez. 00:35:07 well, no way you could do fusion's trigger for missiles thing 00:36:07 I think you might be able to do a crossover simply using momentum 00:36:54 hmm 00:37:09 ais523: actually, yeah, you could do it with regenerating speed boost blocks 00:37:26 oh, clever 00:37:35 is there a way to stop people shinesparking back the way they came, though? 00:37:41 you don't need to care about that 00:37:49 what're you guys trying to simulate? diodes? 00:37:52 you just need to ensure they can't change directions 00:37:52 I guess if you have some curved, crossing paths 00:37:54 NewYearInterpol: crossover 00:38:02 crossover? 00:38:16 coppro: I'm thinking, you charge the speed boost, crouch on the way, then set it off in the middle 00:38:21 a way ffor two paths to cross. 00:38:22 instantly refilling your momentum 00:38:31 Bike: lol. 00:38:33 ais523: use speed boost vertically, morph ball tunnel horizontally 00:38:44 lol/ 00:38:48 ?* 00:38:48 Maybe you meant: v @ ? . 00:38:50 coppro: you can't speed boost downwards, but I guess that doesn't matter? 00:38:54 no i fucking didn't 00:38:58 ais523: you only need one direction 00:39:01 yep 00:39:27 in Super Metroid, what if you get down to low HP so that it stops halfway through, just when you're level with the tunnel 00:39:33 (say using failed shinesparks) 00:39:43 then mid-air morph and roll into the tunnel 00:39:51 seriously, the hell is crossover. 00:39:57 it's what i said! 00:39:58 super metroid doesn't have the power glove, so it's not a concern 00:40:08 they're talking about making a horizontal route and a vertical route go through the same tiles 00:40:15 and other m is 3d so you can just implement it by having them go round 00:40:19 ..lol. 00:40:22 I see. 00:40:24 coppro: it is, you can get into a morph tunnel in mid-air in Super Metroid 00:40:28 so mzm and fusion are the only ones you need to worry about 00:40:30 speedrunners do it all the time on the way back from getting bombs 00:40:33 Why? 00:40:38 ais523: oh, good point 00:40:39 hrm 00:40:40 it's ridiculously precise but it's possible 00:41:06 but super metroid already has a crossover so all's good 00:41:12 oh wait, hmm 00:41:18 this breaks the Clause gadget too 00:41:27 actually, it's totally broken in any game with power bombs 00:41:44 can't you use super missile blocks instead, which are immune to power bombs? 00:41:55 oh. logic. 00:41:59 that's what you guys are doing. 00:42:09 lol. I was lost. 00:42:13 ais523: how do you make it implement a 3-sat clause though? 00:42:22 coppro: I'm not sure yet 00:46:30 just do planar 3-coloring, no crossover needed. 00:46:38 hth 00:49:15 how does the Clause gadget work again? 00:49:29 ais523: lots of zoomers 00:49:31 see the PDF 00:49:36 it has a picture 00:49:56 do you have a link to the PDF handy? 00:50:11 also I didn't realise there was a Metroid version already 00:51:21 I linked it above 00:51:24 it's all the same paper 00:51:33 ah, there we go 00:51:36 I missed the link the first time 01:02:00 -!- nisstyre has joined. 01:16:19 -!- oerjan has quit (Quit: leaving). 01:26:07 there are quite a few issues in this paper 01:26:18 we've already discussed the Power Grip issue with the given crossover in Metroid 01:26:28 (and more worryingly, the Clause construction) 01:27:09 the Pokémon construction's also "wrong", in that Alakazam could keep missing with Psychic (it has a 255/256 hit chance), but that's easily fixable via PP abuses 01:29:20 ais523: Clause is vulnerable to power bomb 01:29:31 ais523: afaict the construction works for the original metroid though 01:29:45 although it might actually be possible to get through with some bombs 01:30:23 if you can infinite bomb jump in the original metroid 01:30:28 ais523: do you have any good let's play recommendations? 01:30:30 you could just get into it from below 01:30:36 ais523: in original metroid? 01:30:54 via infinite bomb jump into the tunnel after killing the zoomers 01:31:03 although I think their constructions are designed to just not give you the power bomb 01:33:09 -!- ais523 has quit. 01:47:24 -!- yorick has quit (Remote host closed the connection). 02:45:40 -!- nucular has quit (Read error: Connection reset by peer). 02:45:52 -!- nucular has joined. 02:45:52 -!- nucular has quit (Changing host). 02:45:52 -!- nucular has joined. 02:45:57 -!- nucular has quit (Excess Flood). 02:46:04 -!- Zuu has changed nick to Zen. 02:46:20 -!- Guest36982 has joined. 02:46:22 -!- Guest36982 has quit (Excess Flood). 02:46:24 -!- Zen has changed nick to Zuu. 02:48:00 -!- nuculear has joined. 02:49:19 -!- nuculear has changed nick to nucular. 02:49:30 -!- nucular has quit (Changing host). 02:49:31 -!- nucular has joined. 02:56:42 -!- nucular has quit (Read error: Connection reset by peer). 02:56:55 -!- nucular has joined. 02:56:57 -!- nucular has quit (Excess Flood). 02:57:25 -!- nucular has joined. 02:57:26 -!- nucular has quit (Changing host). 02:57:26 -!- nucular has joined. 02:57:27 -!- nucular has quit (Excess Flood). 02:58:10 -!- nucular has joined. 02:58:11 -!- nucular has quit (Changing host). 02:58:11 -!- nucular has joined. 03:06:33 -!- nucular has quit (Read error: Connection reset by peer). 03:06:40 -!- nutty has joined. 03:06:42 -!- nutty has quit (Excess Flood). 03:07:27 -!- nucular has joined. 03:07:30 -!- nucular has quit (Excess Flood). 03:14:38 -!- Cacophony has joined. 03:20:17 -!- bagulhex has quit (Quit: CyberScript - O ministrio da sade adverte: usar CyberScript causa dependncia! (www.cyberscript.org)). 03:24:43 -!- Bike_ has joined. 03:26:02 -!- Phantom_Hoover has quit (Read error: Connection reset by peer). 03:26:25 -!- Bike__ has joined. 03:26:28 -!- tertu has quit (Read error: Connection reset by peer). 03:27:13 -!- Bike has quit (Ping timeout: 272 seconds). 03:28:06 -!- tertu has joined. 03:29:23 -!- Bike_ has quit (Ping timeout: 272 seconds). 03:36:54 -!- Bike__ has changed nick to Bike. 03:39:20 Do you know how to make the graphics for the Famicom version of my "Attribute Zone" game? 03:41:54 -!- Cacophony has quit (Quit: ChatZilla 0.9.90.1 [Firefox 26.0/20131205075310]). 03:47:54 i've never heard of this game 03:48:22 I made it up. 03:49:06 Currently only PC version exists, and it just uses PC text mode graphics. 03:50:55 (Despite this, the game rules are designed around the Famicom.) 03:50:58 what is the game like? 03:51:18 can i play it? 03:51:20 can i play on linux 03:51:53 if you advertise software as for "PC" but no OS then I'm going to assume it's bootable and will run it in QEmu :) 03:52:26 :D 03:53:00 kmc: That is a good idea, but I have included no bootloader; it needs some DOS functions. It is a DOS program. However maybe it can be fixed to support a plain PC. 03:53:08 kmc: Yes, you can play it, you need the file http://zzo38computer.org/GAMES/CGACOLL.ZIP which contains ATTRZONE.* 03:53:28 -!- NewYearInterpol has quit (Ping timeout: 245 seconds). 03:53:43 then I can play it in DOSBox probably 03:53:47 yeah 03:53:50 i bet it would 03:55:01 And then you need a way to run DOS programs, or some way to compile it to work in other systems (although it uses PC hardware registers, so you need to convert those too unless you only want to remove the OS requirement and still have it run in a PC or PC emulator). 03:55:10 So, yes probably DOSBox will work. 03:57:18 can you briefly describe the goal and idea of the game 03:57:54 It is described in the relevant section of CGACOLL.DOC (search it for "ATTRZONE"), but I can also explain more if you have other questions. 03:58:24 you need to hire a PR person. 03:58:47 Bike: If I intend to sell any of these things sometimes, then maybe I will. But for now I don't. 04:00:55 * quintopia installs an android x86 emu for DOSing 04:02:47 The main idea of this game is that you cannot have two different non-white colors of pieces in a single 2x2 block. Another rule is no more than eight sprites per row. 04:03:01 Currently there is only two levels but you can make your own if you want to. 04:03:09 maybe you could start with "it's a puzzle game" 04:03:20 O, yes, it is that. 04:03:34 This ZIP archive is full of many other games too! 04:21:16 damn the dos emu for android doesn't let you add new files to its filesystem. it emulates a fixed hard drive 04:36:57 -!- nooodl_ has quit (Quit: Ik ga weg). 04:40:27 -!- mauke has quit (Disconnected by services). 04:40:37 -!- mauke has joined. 04:42:28 -!- preflex has quit (Ping timeout: 246 seconds). 04:44:08 -!- preflex has joined. 05:46:15 -!- nisstyre has quit (Quit: Leaving). 05:47:25 -!- Rho1st has joined. 05:54:07 So there's the idea of a "free object" on a set where you take an equivalence class of ASTs, more or less. 05:55:09 E.g. you start with all the elements in a set, you add a 1 element and you make every tree that you can using (*), and then you consider trees equal if the monoid laws force them to be equal. 05:55:56 But there's also e.g. the idea of a free category on a graph, where you take paths through the graph (and if your graph has one object and a set of loops, you end up with the same free monoid). 05:56:11 Can you think of a construction like that in a similar way? 05:56:54 -!- Rho1st has left. 05:58:50 I don't have much intuition for the general sense of "free object" other than the definition (a left adjoint). 06:07:01 -!- conehead has quit (Quit: Computer has gone to sleep.). 06:50:10 $ evince downloads/541.pdf 06:50:10 (evince:9676): GLib-ERROR **: creating thread 'EvJobScheduler': Error creating thread: Resource temporarily unavailable 06:50:13 Trace/breakpoint trap 06:50:18 o_O 06:50:45 it worked the second time because chromium crashed in the meantime? 07:08:23 "Unlike Bitcoin, Namecoin, and Litecoin, Peercoin does not have a hard limit on the number of possible coins, but is designed to eventually attain an annual inflation rate of 1 percent. This feature, along with increased energy efficiency, aim to allow for greater long-term scalability." 07:08:36 Is that.. actually more sensible, or is that just guessing that that's more sensible? 07:09:16 the fed controls inflation thrugh controlling interest rates, i think? i don't know how an intrinsic inflation efects things 07:15:45 Oh neat, proof of stake basically makes sure that transaction fees aren't sole incentive for miners 07:16:08 I think 07:34:40 Sgeo: a hard limit gives you deflation, which encourages hoarding rather than spending 07:34:49 so it seems to me like a good change 07:34:54 but i know next to nothing about economics 07:36:06 you can say that cryptocurrencies have mortmain monetary policy but really they have monetary policy set by a hashrate-weighted direct democracy 07:36:39 it would be interesting to have a decentralized currency with a one-vote-per-person direct democracy 07:37:35 you probably need some central authority to decide what a "person" is, though 07:37:35 mortmain? 07:37:39 dead hand 07:37:42 fancy word 07:37:54 beyond a poor peasant like me, sir 07:38:06 central authority e.g. a national identity smartcard system like taiwan has (only without the fatally broken random number generators lolololol) 07:39:32 here i thought it was some hipness for "mortal [dying] main authority" 07:39:39 heh 07:39:41 and you could do anonymous e-voting (the usual way is additively homeomorphic encryption, I believe) 07:40:12 * kmc tries to remember how that works 07:40:23 whoa whoa whoa, homeomorphic encryption? 07:40:28 homeomorphic encrytion is dark magic and nothing less 07:40:29 is that a thing 07:40:37 guess it's spellt homomorphic 07:40:45 but other fields use the two words interchangeably don't they? 07:40:46 are there actual implementations, i forget 07:40:50 like, good ones. 07:40:51 Bike: yes 07:40:55 dag 07:40:57 kmc: do they? 07:41:07 I think I like parpolity but not parecon, but parpolity seems to rely on parecon 07:41:10 well even RSA is homomorphic for multiplication 07:41:20 kmc: the only meaning of "homeomorphism" i've ever heard is "isomorphism of topological spaces" 07:41:27 ok 07:41:42 homeomorphic encryption sounds like it would be exciting 07:41:49 Bike: but there are actual implementations for schemes that can compute any circuit, too 07:41:53 https://github.com/shaih/HElib 07:41:56 i don't know about "good ones" 07:41:59 gosh 07:42:10 bootstrapped homomorphic encryption is p. cool 07:42:14 well, i just mean, like, usable to run a country or whatever. 07:42:28 "Bike, nothing is good by that standard." 07:42:30 Homeopathic encryption: add 9 parts NULs to 1 part of data, shake well into three directions, repeat the process 30 to 100 times. 07:43:09 yummy! 07:43:15 Take a part of the result, it will contain the essence of the original data. 07:45:48 Bike: with a HE primitive, you can only do a certain amount of computation on each encrypted value, and bootstrapping solves this awesomely with self-reference 07:45:50 "However, security against adaptive chosen ciphertext attacks (CCA2) is equivalent to non-malleability." 07:46:00 kmc: cool. 07:46:25 http://crypto.stanford.edu/craig/easy-fhe.pdf is the shit 07:46:27 i tried to understand hom(e)omorphic encryption once but couldn't get past the consequences. incidentally this is about as far as i understand any encyryption 07:46:50 that's not really incidental so much as my entire point, hm. 07:47:31 consequences? 07:47:53 the whole computation on encrypted data thingie 07:51:19 -!- glogbackup has quit (Ping timeout: 240 seconds). 08:01:00 what do you mean by "get past" i guess 08:01:43 -!- glogbackup has joined. 08:02:45 that i don't unerstand shit 08:06:49 -!- glogbackup has quit (Remote host closed the connection). 08:11:46 -!- glogbackup has quit (Ping timeout: 246 seconds). 08:20:06 -!- nisstyre has joined. 08:20:20 -!- glogbackup has joined. 08:32:13 -!- glogbackup has quit (Ping timeout: 245 seconds). 08:36:52 -!- tertu has quit (Read error: Connection reset by peer). 08:37:18 -!- tertu has joined. 08:40:19 -!- glogbackup has joined. 08:54:06 -!- glogbackup has quit (Remote host closed the connection). 09:03:27 -!- glogbackup has quit (Ping timeout: 240 seconds). 09:05:19 -!- glogbackup has joined. 09:19:55 -!- FreeFull has quit (Ping timeout: 245 seconds). 09:42:30 -!- FreeFull has joined. 09:44:18 -!- AnotherTest has joined. 09:55:07 -!- tertu has quit (Ping timeout: 260 seconds). 10:26:34 Apparently floating eyes that hunt you down and chomp at you and put you in a secret part of the attic are "weird" 10:34:42 Does that happen to you often? 10:35:31 It happens in WorldsPlayer when someone in AnimalHouse gets past a fence they shouldn't be able to 10:35:41 I don't know why people keep calling WorldsPlayer creepy 10:36:17 Does it bother you that people keep calling WorldsPlayer creepy? [Responses from this point on provided by M-x doctor.] 10:42:21 "Woah... that's just a mirror, but it freaked me out, because this game is weird" 10:42:53 When did you first know that this game is weird? 10:43:17 Aw, I have to go to the shop now. (That was no longer from Emacs.) 11:26:09 -!- olsner has joined. 11:39:32 -!- MindlessDrone has joined. 11:41:53 -!- NewYearInterpol has joined. 11:44:07 -!- NewYearInterpol has changed nick to LinearInterpol. 11:48:07 -!- olsner has quit (Quit: Leaving). 12:01:19 -!- oerjan has joined. 12:15:56 -!- yorick has joined. 12:16:10 -!- FreeFull has quit (Ping timeout: 245 seconds). 12:16:41 -!- LinearInterpol has quit (Ping timeout: 272 seconds). 12:17:37 -!- FreeFull has joined. 12:20:10 -!- Sgeo has quit (Read error: Connection reset by peer). 12:48:21 -!- nooodl has joined. 12:49:51 -!- Membiio has joined. 12:49:55 Derp 12:50:17 `relcome Membiio 12:50:22 ​Membiio: 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.) 12:51:03 ... 12:51:26 >+++++++++++++[->++++++++++++++<]>+++++++++++++++++. 12:51:38 ^bf >+++++++++++++[->++++++++++++++<]>+++++++++++++++++. 12:51:45 eek 12:51:53 Eek? 12:52:05 fizzie: BOT RUN AWAY 12:52:36 !bf >+++++++++++++[->++++++++++++++<]>+++++++++++++++++. 12:52:37 Ç 12:52:38 ​ 12:52:39 What... Bot... 12:52:51 I'm just confused now. 12:52:56 it's name is fungot 12:52:59 *its 12:53:14 fortunately EgoBot also has a bf command. 12:53:25 Okay... 12:54:04 FiM++ is hard. 12:54:05 D: 12:54:11 Eek. 12:55:08 pratchett.freenode.net seems to have gone away. 12:55:58 Me needz halp 12:56:33 -!- fungot has joined. 12:56:34 i doubt we have any FiM++ experts here. 12:57:51 maybe Gregor, since he's a brony 12:58:07 but he doesn't look present 12:58:12 D: 12:58:17 Oh well. 12:59:02 Got anything simple? 13:00:34 ... 13:02:05 Membiio: i'm afraid the reason we don't talk about FiM++ and languages like that (e.g. LOLCODE) much is that they're really just a heap of fluff around an underlying very _normal_ language. 13:02:34 Ah 13:02:40 so the things we _do_ like to talk about here are even worse to program in. 13:02:55 (you've already noticed bf) 13:03:15 Hm... 13:04:20 WE NEED A LANGUAGE BASED ON BACON AND BAGELS. 13:04:42 well you can try Chef, that's at least food :P 13:06:03 0_0 13:06:27 I don't understand Chef. 13:07:32 How does it work? 13:09:14 well chef is a lot of fluff _and_ a more awkward underlying language. i cannot exactly read it on the spot either. 13:10:04 Aw... 13:11:26 for a language _without_ fluff and very simply basic commands, you can try Underload. alas it's still not easy to do anything advanced with. 13:12:00 bf also doesn't have fluff. 13:20:07 -!- Membiio has quit (Ping timeout: 272 seconds). 13:29:09 -!- impomatic has quit (Ping timeout: 272 seconds). 13:32:22 No food either. 13:32:34 Except maybe FOOD FOR THOUGHT. 13:40:46 -!- LinearInterpol has joined. 13:46:52 SKI calculus! 13:47:26 BCKW calculus is totally underrated 13:48:20 -!- Frooxius has quit (Quit: *bubbles away*). 13:52:00 -!- carado has quit (Quit: Leaving). 13:54:30 `addquote Homeopathic encryption: add 9 parts NULs to 1 part of data, shake well into three directions, repeat the process 30 to 100 times. 13:54:34 1153) Homeopathic encryption: add 9 parts NULs to 1 part of data, shake well into three directions, repeat the process 30 to 100 times. 13:55:50 effective. 13:57:28 -!- boily has joined. 14:01:54 good anne morning! 14:02:00 ~metar CYQB 14:02:23 -!- metasepia has joined. 14:02:34 ~metar CYQB 14:02:37 CYQB 021300Z 02004KT 30SM FEW015 SCT180 M31/M36 A3055 RMK SC1AC2 SLP355 14:05:15 who's anne 14:07:39 that would be me. I've been shifted to a different table because my mom and aunt are going to do scrapbooking today. I'm sitting at a green one in the basement. 14:07:47 so that makes me Anne of Green Tables. 14:12:43 boily: "I predict that a century hence the Canadian people will be the noblest specimens of humanity on the face of the Earth", rev. John Bredin, 1863, via xkcd. Do you feel this was an accurate prediction? 14:14:33 fizzie: not to sound sycophantic this morning, but I thing Scandinavian people are in a better pool position than us. 14:14:44 s/g\b/k/ 14:16:40 good mornink! 14:17:19 boily: Does "better pool position" translate to "more likely to go down a hole"? 14:19:31 fizzie: I'm drinking coffee. I can't be pessimistic. 14:20:08 kmc: good topic ... nothing sounds stranger than the truth. 14:20:34 what happened to the poor /topic? 14:20:44 -!- carado has joined. 14:35:21 -!- nycs has changed nick to `^_^v. 14:50:18 -!- conehead has joined. 15:09:37 -!- tertu has joined. 15:11:32 -!- Chillectual has joined. 15:12:39 -!- LinearInterpol has quit (Disconnected by services). 15:12:43 -!- Chillectual has changed nick to LinearInterpol. 15:14:09 -!- Chillectual has joined. 15:14:39 -!- LinearInterpol has quit (Disconnected by services). 15:14:44 -!- Chillectual has changed nick to LinearInterpol. 15:26:49 -!- carado has quit (Ping timeout: 252 seconds). 15:35:26 -!- oerjan has quit (Quit: leaving). 15:37:38 -!- LinearInterpol has quit (Ping timeout: 245 seconds). 15:40:18 -!- FreeFull has quit (Remote host closed the connection). 15:43:55 -!- FreeFull has joined. 16:01:23 -!- LinearInterpol has joined. 16:02:39 mornin boilyface 16:05:04 bon matintopia. 16:05:08 boily face? 16:08:24 Catface, he's got a big cat's face, he's got the body of a cat, and the face of a cat, and he flies through the air cos' he's got a catface, catface! 16:08:41 (It's a song.) 16:09:48 what do this day? 16:11:59 work. 16:13:50 but, I have unlimited coffee and there's a fire in the hearth. 16:19:02 how's life on your end? not too cold today? 16:19:40 -!- Frooxius has joined. 16:25:56 -!- copumpkin has quit (Quit: My MacBook Pro has gone to sleep. ZZZzzz…). 16:34:18 nah, nothing like where you are 16:35:00 ~metar KATL 16:35:01 KATL 021618Z 22005KT 1 1/2SM BR OVC005 09/08 A2987 RMK AO2 SFC VIS 5 RAE04 P0001 16:35:10 indeed. 16:37:44 but i will have to work today 16:37:55 i should eat 16:56:17 ~metar ESSA 16:56:18 ESSA 021650Z 15009KT 9999 BKN020 04/00 Q1009 R01L/29//95 R08/25//95 R01R/29//95 NOSIG 16:57:05 how dare you all having over-zero temperatures? 16:59:13 ~metar LOWI 16:59:14 LOWI 021650Z VRB02KT 9999 FEW060 BKN070 OVC100 03/M01 Q1012 R08/19//95 NOSIG 16:59:24 -!- monotone_ has joined. 16:59:32 I don't know. 16:59:48 -!- monotone has quit (Ping timeout: 260 seconds). 17:00:07 -!- monotone_ has changed nick to monotone. 17:03:26 is it just my browser rendering wrong, or does the funciton page contain a smaller second copy of the entire page embedded near the end of it 17:09:55 on the wiki? the page looks normal here. 17:11:33 ok 17:12:16 it rendered right when i closed the tab and reopened it 17:14:35 quintopia's being haunted by poltertabs. 17:15:01 boily: 17:15:05 * quintopia shivers 17:20:41 -!- Sorella has quit (Quit: It is tiem!). 17:38:28 -!- Phantom_Hoover has joined. 17:38:35 -!- Phantom_Hoover has quit (Changing host). 17:38:36 -!- Phantom_Hoover has joined. 17:39:13 ~metar EFHK 17:39:14 EFHK 021720Z 12011KT 9999 BKN017 00/M03 Q1017 NOSIG 17:39:30 Yay, barely made it to the over-zero club. 17:39:38 meanwhile, THE AUNTS ARE COMING! 17:42:04 are they joining the green table? 17:43:00 no. the Green Table is Mine. 17:43:57 sounds lonely 17:44:29 'tis the season for aunts, I guess. 17:44:39 can i be a knight of the green table? 17:45:20 Sir Quintopia de la Vertable, serving under Fizzie, King of the Flying Wizard Dogs. 17:46:57 I still love that name. 17:52:24 int-e: thanks 18:19:28 https://defuse.ca/bochs-hacking-guide.htm guide to hacking Bochs, including adding new instructions and registers 18:20:07 -!- Chillectual has joined. 18:20:36 rnsa 18:21:40 -!- LinearInterpol has quit (Disconnected by services). 18:21:46 -!- Chillectual has changed nick to LinearInterpol. 18:26:06 ~duck rnsa 18:26:07 The Royal Naval Sailing Association is the governing body that oversees all aspects of sailing, both racing and recreational sailing cruises, throughout the British Royal Navy. 18:39:38 -!- tertu has quit (Ping timeout: 265 seconds). 18:39:54 -!- ter2 has joined. 18:43:39 -!- Bike_ has joined. 18:43:58 -!- ter2 has quit (Ping timeout: 240 seconds). 18:44:38 -!- LinearInterpol has quit (Ping timeout: 240 seconds). 18:45:10 -!- Sorella has joined. 18:45:10 -!- Sorella has quit (Changing host). 18:45:10 -!- Sorella has joined. 18:45:33 -!- Bike has quit (Ping timeout: 272 seconds). 18:52:50 Sorella, your autoident is fucked, hth 18:53:41 iirc on xchat you fix this by entering your password in the 'server password' form rather than 'nickserv password' 18:54:21 -!- Bike_ has changed nick to Bike. 18:54:34 Phantom_Hoover, ah, yeah. I moved from ERC to XChat yesterday and didn't configure it yet 18:55:38 make sure you set the encoding to utf-8 as well then 18:56:07 -!- copumpkin has joined. 18:56:08 don't be ridiculous, phǟntom 18:56:39 Are there programs that don't do that automatically these days? 18:57:31 yes, i.e. xchat 18:57:45 it uses a braindead iso-whatever/utf-8 hybrid 18:59:25 Bike: that's one nice diacrḯtic stack. 18:59:35 -!- CADD has quit (*.net *.split). 18:59:35 -!- typeclassy has quit (*.net *.split). 19:01:04 ǡǟ 19:03:00 TIL you can have above-dot and macron on a letter. we live in a Good Universe. 19:03:28 http://arxiv.org/abs/1312.7128 adventures in tenure 19:05:08 -!- CADD has joined. 19:05:09 -!- typeclassy has joined. 19:06:43 -!- AnotherTest has quit (Ping timeout: 260 seconds). 19:07:52 -!- copumpkin has quit (Quit: My MacBook Pro has gone to sleep. ZZZzzz…). 19:07:56 -!- ^v has joined. 19:29:51 "No time travelers were discovered." Sad. 19:31:21 “Hungarumlaut... [citation needed” ← also sad. that words need to be officially homologated. 19:31:31 "Requests for Time Travelers to Issue a Prescient Internet Communication" ha, nobody's going to answer that one, they'd be nabbed by the Time Cops for sure. 19:31:34 -!- conehead has quit (Quit: Computer has gone to sleep.). 19:34:37 -!- FreeFull has quit (Read error: Connection reset by peer). 19:37:20 boily: to answer your earlier question about the topic, I would say that it is in TURMOIL. 19:37:35 "Hashtagging -- labeling Internet content with terms beginning with a "#" -- originated on the Internet in the Internet Relay Chat (IRC) channels, --" weeeel. 19:37:49 int-e: but why so much TROUBLE? I mean, such a PEACEFUL topic... 19:38:07 -!- LinearInterpol has joined. 19:39:50 boily: http://cryptome.org/2014/01/nsa-codenames.htm HTH 19:40:23 http://upload.wikimedia.org/wikipedia/commons/f/fc/NSA_SURLYSPAWN.jpg 19:40:39 uh don't click that link if you work for the US government or ever intend to get a security clearance 19:41:18 ...is that a real one or is it from the generator 19:41:23 stupid future. 19:41:24 real i think 19:41:30 one of the scarier things about this spy gadget catalog is that the stuff in it is at least 7 years old 19:41:41 ...oh. 19:42:40 they put an ARM processor, 100 MB of storage, and an FPGA in a package the size of a penny... at the same time the original iPhone was being developed 19:42:50 http://www.nytimes.com/books/97/03/23/lifetimes/asi-v-fair.html Happy 2014, also 19:43:03 -!- nisstyre has quit (Ping timeout: 240 seconds). 19:43:53 developing this stuff must be such a fun job if you ignore all the parts that aren't 19:44:30 I like this sentence. "Windows need be no more than an archaic touch." 19:44:40 kmc: I'm not surprised. FPGAs have been around for a looooooong time, and building a low-cost, low-power, small-as-fuck one wasn't hard years ago. 19:45:05 all comes down to how many logic elements it has, and you can do a lot with a few of them. 19:45:11 indeed they used a commercially available one 19:45:35 what was it, altera, xilinx? 19:45:38 kmc: http://www.washingtonpost.com/national/health-science/nasa-gets-two-military-spy-telescopes-for-astronomy/2012/06/04/gJQAsT6UDV_print.html 19:45:41 some other obscure brand? 19:45:51 xilinx i think, but i'd have to look it up 19:46:01 xilinx does good work. 19:46:03 Jafet: yeah that was pretty cool 19:46:15 fuck xilinx tools grr grr grr 19:46:23 hey, better than altera's shitty linux support. 19:46:32 and the fact that they dumped the waveform simulator in like quartus 9. 19:46:35 or 10. 19:46:43 "The appliances of 2014 will have no electric cords, of course, for they will be powered by long- lived batteries running on radioisotopes." 19:47:01 sure they will. and I'm a fucking fairy. 19:47:54 that's good, astonishingly close. 19:48:23 (the asimov thing) 19:48:45 asimov thing? 19:48:49 oh. 19:48:50 quote. 19:48:50 -!- nisstyre has joined. 19:48:51 futurolgy is always fun like this. predicts self-driving cars in development, but also flying cars 19:49:15 also moving sidewalks. why would anyone want moving sidewalks? 19:49:20 there was a story I remember that asimov wrote that was friggin' awesome. 19:49:24 'murica 19:49:48 Bike: see airports. but they are too high maintenance for outdoor areas. 19:49:48 "The Last Question" 19:50:29 "In 2014, there is every likelihood that the world population will be 6,500,000,000 and the population of the United States will be 350,000,000. Boston-to-Washington, the most crowded area of its size on the earth, will have become a single city with a population of over 40,000,000." hey, slick. 19:50:45 int-e: are those really sidewalks? i mean, you don't stop at storefronts on the way. 19:51:26 Bike: scarily accurate. 19:51:35 Bike: they are not, but the idea is the same, speeding up walking by steping on some moving strip 19:51:44 *stepping 19:51:57 «The 2014 fair will feature an Algae Bar at which "mock-turkey" and "pseudosteak" will be served.» hell yeah motherfucers 19:52:32 pfft, I read a story with algae farms that took place in 1992 19:52:41 pseudosteak 19:52:45 tofusteak? 19:52:47 psteak. 19:52:50 obviously. 19:53:18 PSTEAK 19:53:26 it's deliciously solvable. 19:53:34 "Not all the world's population will enjoy the gadgety world of the future to the full. A larger portion than today will be deprived and although they may be better off, materially, than today, they will be further behind when compared with the advanced portions of the world. They will have moved backward, relatively." 19:54:37 -!- FreeFull has joined. 19:59:16 on the other hand, communication is satellite based rather than cell based. 19:59:41 delicious Jacobs Orange Club, Penguin, and Jaffa Cake 20:00:18 attn. hexhamites 20:01:25 how many hexhamites are left? 20:07:01 http://www.youtube.com/watch?v=V3tVUJPIhaI 20:20:27 -!- AnotherTest has joined. 20:22:47 -!- MindlessDrone has quit (Quit: MindlessDrone). 20:29:55 -!- impomatic has joined. 20:38:58 -!- ais523 has joined. 20:40:20 http://www.youtube.com/watch?v=xg29TuWo0Yo 20:40:20 good god this is terrifying. 20:43:14 “hot young tech wizard”. he he he. 20:43:34 pinball wizard 20:43:43 Wizard dog. 20:44:53 DirectX 11 saved my marriage. 20:45:45 Huh, there's an Epic Pinball remake on the iThings (called "Retro Pinball"). 20:55:48 http://youtu.be/XvdpjZYLumw 20:57:59 yeeessssssssssss. 20:58:53 -!- callforjudgement has joined. 20:59:08 Based on their name, I was expecting more ukulele. 20:59:09 -!- ais523 has quit (Disconnected by services). 20:59:11 -!- callforjudgement has changed nick to ais523. 20:59:15 -!- mauke has quit (Remote host closed the connection). 20:59:30 -!- mauke has joined. 20:59:34 shadappayoface. 21:10:01 -!- carado has joined. 21:10:50 boily: oh, missed that it's asimov 21:12:12 shachaf, what am I attending to? 21:12:18 kmc: eh? 21:12:35 shachaf: what are you tanebbing again? 21:12:52 http://www.nytimes.com/books/97/03/23/lifetimes/asi-v-fair.html 21:13:05 sorry, that was meant to be "Bike:" 21:13:36 * boily is now known as a Bike-proxy 21:15:42 boily: is that when you ride on an exercise bike, and it's remotely connected to the handlebars and pedals of a real bike somewhere out there in, say, the streets of London 21:16:16 with a camera that keeps track of where it's going, so you get a view from the bike 21:16:36 I'm not sure what this technology is useful yet, but it sounds like an intereting idea 21:18:13 I believe there are things for rendering a virtual environment you can exercise-bike through. 21:18:17 being a courier is a dangerous job. with remote-controlled bikes, this removes almost all possibilities of grievous bodily harm. 21:18:22 It sounds like a high-fidelity version of that. 21:18:44 besides, because it's made of bikes, it's eco-friendly and keeps you in shape! 21:18:44 I like boily's idea better 21:18:50 amazon to begin deliveries by bike drone 21:19:02 but I doubt it's that eco-friendly 21:19:10 Phantom_Hoover: They could offer a feature where the customer gets to drive the bike. 21:19:17 you won't generate much electricity on the exercise bike, not really enough to offset the needs of the bike drone 21:19:19 Would be far better than reloading the package status tracking page. 21:19:25 that sounds like something from Black Mirror 21:19:40 * boily raps on Bike with a maple stick 21:19:43 Actually, they could do that for their quadcopter delivery things, I think that'd be enormously popular. 21:19:59 (Plus no need to build fancy software to fly.) 21:20:25 fizzie: they'd almost certainly be flown into buildings and each other and the like 21:20:27 or used to spy on people 21:20:30 I wanted to build a bike drone 21:20:34 that is, a robot bike 21:21:26 ais523: Perhaps they'd offer it only when their heuristics say the object being ordered is so desirable, the person controlling it will be extra careful. 21:21:43 (And also fly it straight home without dallying around.) 21:22:05 Taneb: help 21:22:10 Are there many autonomous two-wheeled devices? 21:22:28 Or autonomous unicycles, for that matter. 21:22:32 shachaf, something relevant for Hexhamites 21:22:55 Taneb: oh, jaffa cakes and things 21:23:11 Oh 21:23:15 I don't really like jaffa cakes 21:23:20 the Taneb/shachaf conversation looks weird even if you read scrollback 21:23:50 ais523, this is #esoteric, it's practically weird by definition 21:23:54 autonomous unicycle might be easier 21:24:09 kmc: something I wanted to invent was a self-balancing unicycle 21:24:13 that didn't require any skill from the rider 21:24:19 There was a "100 unicycle collision avoidance 2" video in youtube, but I can't tell what I'm looking at. It's just a bunch of wireframe circles. 21:24:21 you could just sit on it motionless and it would stay upright 21:24:26 I still need to learn to ride the unicycle 21:24:48 (Also some actual unicycle robots.) 21:24:51 http://youtu.be/LdjY6oy4Y2c 21:25:24 ais523: So... you wanted to invent a *boring* unicycle? 21:25:44 mroman: well, the unicycle itself would be interesting; riding it would be boring, though 21:25:53 ais523: There was a video of that, actually. 21:26:08 ais523: http://www.youtube.com/watch?v=DT8F7fRV5fc I don't know if it's a real thing or not. 21:26:32 I guess you might have wanted something you still pedal. 21:26:45 That one's just basically a unicycle segway. 21:27:21 nah, I think I prefer a unicycle segway 21:27:31 btw, some engineers at Google tried to show me a Segway once but it wasn't working 21:27:59 that one isn't nearly as tall as I wanted, though 21:28:29 There's also the http://en.wikipedia.org/wiki/U3-X but that's pretty similar. 21:30:29 "An error has occurred while searching: Pool queue is full" I don't think Wikipedia search has given me that before. 21:31:12 "EcoBoomer Co., Ltd. Is A Leading Manufacturer Of Self-Balancing Electric Human Transporters, E-Bikes, & Electric Unicycles" fancy, a leading electric unicycle manufacturer. 21:31:39 "Joining the likes of the eniCycle, Solowheel and SBU, we now have the LED-light-strip-adorned EcoBoomer iGo." 21:31:44 There's like a whole pile of them. 21:31:46 Taneb: I can't tell whether I like jaffa cakes. 21:31:54 There's so much mystique surrounding them that it's difficult to tell. 21:32:27 I'd want a self-balancing bike 21:32:37 like a regular bike 21:32:41 with two wheels and all 21:33:28 although I'm not sure if you can steer with it then 21:33:55 but it would be cool for like front breaks 21:34:02 sort of like an ABS system for bikes 21:34:20 inverse pendulums are quite something. 21:34:52 There was a self-balancing electric bike in the search results when I was looking for the unicycles. 21:36:31 -!- ^v has quit (Remote host closed the connection). 21:36:51 -!- lala has joined. 21:37:14 -!- lala has changed nick to Guest83766. 21:37:50 i've wanted a solowheel for so long 21:37:55 fizzie: Why do they think that a self balancing bike is useful? 21:38:00 "Some people would just say this is magic, but it's really gyroscopes." 21:38:19 http://www.marriedtothesea.com/033107/gyroscopes.gif 21:38:25 It practically really balances itself without any actual self-balancing stuff 21:38:28 ecoboomer looks pretty stupid 21:38:42 it looks like a rideable toilet 21:39:00 mroman: Well, it's not really a "bike", it's got thing you sit in and all. Basically, it's like taking a tiny car and trying to make it even smaller. 21:39:09 kmc: Perhaps they could integrate that functionality in. 21:39:16 could even be a power source 21:40:06 -!- Guest83766 has quit (Client Quit). 21:40:16 "self-balancing electric transporters" i see i'm getting sidelined here :< 21:40:33 http://www.thegreenhead.com/imgs/ecoboomer-igo-self-balancing-electric-unicycle-7.jpg wow, it /does/ look like a toilet. 21:40:45 Bike: did you see the video of swarm quadcopters throwing inverted pendulums? 21:40:52 yeah, fun 21:41:04 "does it look like a toilet" should be on every consumer product design checklist 21:41:24 but yeah those quadcopters were so cute 21:41:34 the way they do a little dance to stabilize when they catch the pole 21:41:41 ooookay this is bad. 21:41:47 and a 360° flip after they toss it 21:42:26 http://nsnbc.me/2013/12/30/tepco-quietly-admits-reactor-3-melting-now/ 21:43:36 fuuuuuuck 21:43:46 google "nsnbc" and tell me that's a legit news organisation 21:44:02 okay the sources might be right 21:44:05 kmc: They also sounded like angry bees in at least the one video I saw. 21:44:07 “Persons residing on the west coast of North America should IMMEDIATELY begin preparing for another possible onslaught of dangerous atmospheric radiation from the Fukushima nuclear disaster site in Japan.” 21:44:07 What's .me? 21:44:11 Is that a real domain 21:44:18 yeah the steam is reported by other news orgs 21:44:20 or one of those funky new domains? 21:44:33 mroman: it's intended for personal websites, I think 21:44:37 It's Montenegro. 21:44:39 Apparently. 21:45:06 All those countries with "good" ccTLDs must be p. happy they can repurpose them for whatever. 21:45:16 apparently i'm supposed to cover every part of my house with plastic 21:45:21 and "Wash obsessively" 21:45:25 Tonga, the country of URL shorteners (.to) and so on. 21:45:31 https://en.wikipedia.org/wiki/File:Domainme.png 21:45:41 can someone link me a non-stupid report on this :/ 21:45:45 ^ 21:45:51 this article is really bad. 21:45:54 http://www.tepco.co.jp/nu-news/2013/1233248_5304.html 21:46:06 http://gizmodo.com/radioactive-mystery-steam-over-fukushima-could-mean-ano-1492280971 21:46:25 I got a 50% off Crusader Kings II Steam coupon thingy for some reason. Just showed up in my steam inventory just now if anyone is interested. I already own the game from some bundle or other. 21:46:53 "[Tepco via The Ecologist via Fark]" i hate the future 21:47:00 hm, i see "93 Bq/L" in here 21:48:20 TEPCO will probably be stupid on the other end of the scale :V 21:48:21 Vorpal: They sometimes do a "give a X% off coupon for game A to everyone who owns game B"; I got a "random" 20% off Velocity Ultra for owning Stealth Bastard Deluxe. 21:48:23 I also have two 20% off "Velocity Ultra", and two 10% off "Toki Tori 2". Not interested in either. Again, if anyone is interested in that or the Crusaders King II one... 21:48:32 "widely apologize for the great inconvenience and worry Regarding that you have, I would like apologize from the bottom of my heart. " 21:48:38 fizzie, just one? 21:48:53 Vorpal: Yes. I guess you might've owned Hotline Miami too? 21:49:03 (They gave another 20% off coupon for people owning that.) 21:50:23 Ah 21:50:43 fizzie, so you are not interested in any of those? 21:51:13 Not really. I can't seem to manage to really play even the games I have. (Though I have been catching up over the holiday season.) 21:51:53 fizzie, I can strongly recommend Brothers: A Tale of Two Sons if you haven't played it. My game of the year easily. 21:52:03 fizzie, you do need a game pad though 21:52:50 fizzie, would be nice if you could trade those coupons, like those silly trading cards and what not... 21:53:01 You can trade them, you just can't market them. 21:53:08 Err, yeah that is what I meant 21:53:12 confusing terminology 21:53:41 How does one trade stuff btw? I see no button here for it 21:53:45 I think Steam forums have quite a lot of threads about people looking to trade their X% off coupons for something they actually want. 21:53:57 There's a "trade offers" button at top of the inventory. 21:54:05 You can make offers from there. 21:54:05 Ah yeah 21:54:11 Thing is, I currently don't want to buy anything 21:54:39 -!- LinearInterpol has quit (Ping timeout: 260 seconds). 21:54:46 I have way too many unplayed games, plus I have some issues with my wrists (possibly carpal tunnel), meaning I keep gaming to a minimum 21:54:57 I traded one (1) Holiday Coal coal to one (1) Holiday Coal back when they were doing the coal thing, because you got something for having a trade. 21:55:07 heh 21:55:22 I never use the social features of steam really 21:55:34 -!- Bike has quit (Ping timeout: 272 seconds). 21:55:56 Also sold all the snow globe cards from community choice voting, because they'd evaporate soon, and I don't think I would've gotten the full set of 10 anyway. 21:56:21 I have been "offline" in the friends menu since day one. Never played a multiplayer game through steam that actually used steam for it. (Unlike, say, Terraria, which afair did it like minecraft, just input the server IP) 21:56:33 fizzie, same 21:57:01 I kind of like seeing the "X is now playing Y" notices from one of my many (5) Steam Friends. For no particular reason. 21:57:07 -!- Bike has joined. 21:57:16 They're all IRL friends, though. I guess it's some kind of stalking instinct. 21:58:00 I don't have IRL friends who I play *computer* games with. 21:58:28 Oh, I don't play games with these people, as a general rule. I just like to see what they're up to. 21:58:33 Heh 21:58:43 (With a single exception of playing through the Portal 2 co-op thing with one of them.) 21:58:45 Yeah, my friends list on steam is empty 21:59:00 I don't even use Steam 21:59:27 Everyone on my friend list has more Steam XP than I do, I think. 21:59:52 fizzie, I don't really play much multiplayer at all... Minecraft, Terraria and FlightGear are the only ones I ever play(ed) multiplayer regularly in. A few other ones I tried a few times, but "meh" 22:00:01 Steam have implemented an arbitrary number that you need to pay them money to increase? 22:00:01 steam xp? 22:00:17 what the hell is steam xp 22:00:32 ais523: You don't need to pay money. Though I think some ways to increment the number involve money. 22:00:42 ais523: Mostly it's about using the community features, I think. 22:00:47 fizzie: well you presumably need to play Steam games for most methods of increasing it 22:00:48 Vorpal: It's what determines your Steam Level. 22:00:56 fizzie, steam level? 22:01:00 what the hell is that 22:01:13 Vorpal: It's a number. See, it's like a RPG. You collect some exp, you gain levels. 22:01:26 Community choice voting requires a minimum Steam level, too. 22:01:30 gamify gaming 22:01:35 fizzie, I completely missed that 22:01:37 world aghast as for-profit gaming service implements for-profit games 22:01:43 fizzie, does it? Oh well 22:01:46 Seems I am level 8 22:01:53 I don't give a shit though 22:02:30 Huh there are achievements for steam itself? "Pillar of community, 13/26" 22:02:33 ais523: That's probably true, admittedly. But I don't think people buy games for the purpose of playing them because of the Steam XP, I guess. 22:02:36 Or what the hell is this 22:02:43 Vorpal: They're for crafting "badges". 22:02:48 fizzie: /someone/ probably does 22:02:55 I believe that's the main way of getting XP. 22:03:01 there are people who buy xbox games just for easy achievements 22:03:10 The card drops are tied into that, too. 22:03:14 and people who make games specifically so that those people will buy them 22:03:19 consumers gonna consume 22:03:23 (When you get a full set, you can craft a badge, and that nets some XP.) 22:03:29 fizzie, seems I have some of those. Oh well, don't really care 22:04:12 I seem to have 16/26 of the Pillar of Community tasks done. 22:04:17 I hate achievements. Usually it is either just "got to point x in story" or it is like "did stupid thing that doesn't make sense in the plot of the game" 22:04:45 I think the latter sort of achievement makes sense, so long as you view it as an optional goal to aim for when you're aware of what it is 22:04:55 rather than as something you're meant to get in normal play 22:05:08 I'm sure there are exceptions, but I can't think of any. Possibly with the exception of The Stanley Parable. Where the achievements pokes fun at achievements 22:05:44 -!- boily has quit (Quit: Poulet!). 22:05:48 hm 22:05:54 -!- metasepia has quit (Remote host closed the connection). 22:06:03 I think I could do most of these missing tasks, there's things like "set a profile background". 22:06:15 "Use a Steam Emoticon in chat" I'd do that, but I don't know how. 22:06:20 fizzie, would you do it just for a badge? 22:06:33 http://esolang-book.route477.net/ https://github.com/yhara/esolang-book-website 22:07:08 Vorpal: I don't know. I guess I might? I do have a mild case of "can't help myself" when it comes to achievement-y things. 22:07:44 Though I think it might make more sense to make those badges tie to e.g. completing all achievements in the game; then they'd at least have something to do with the game in question. 22:07:45 elliott: what 22:08:19 ais523, I think doing a silly thing like riding a horse up a near vertical cliff in skyrim is a reward in and of itself, due to the induced laughing from the glitching horse (also that specific one has no achivement afaik, it was just an example of a silly thing) 22:08:24 fizzie: many games are near-impossible to get all the achievements in 22:08:33 Bike: I thought the existence of a physical esolangs book might interest. 22:08:39 -!- oerjan has joined. 22:08:57 elliott: is it just one of those books that's autogenerated from Wikipedia in the hope that someone buys it? 22:09:04 or did someone actually write it? 22:09:08 ais523, I guess I could see the point of things like "ghosted the entire Deux Ex" or some achievement like that, awarded at the end of the game 22:09:17 ais523: Yes, well, that's why they could make some kind of a reward for it. Currently Steam just says something like "good job", and that's it. 22:09:25 no. translation services exist that can answer such questions equally well but more efficiently than I can 22:09:32 I would say "Google Translate" but I suspect you have a moral objection to using it.. 22:09:43 ais523, that is genuine bragging rights to some degree. Most achivements are not. 22:10:05 the new edition is coming out on the 7th, seemingly 22:10:09 -!- Bike_ has joined. 22:10:10 watching #esoteric complain about a formalization of doing weird things in games is amusing 22:10:13 elliott: I asked the question before I followed the link 22:10:15 Ohhh! "Steam Emoticons" are not the regular emoticons you can use. 22:10:34 fizzie, oh? 22:10:35 "Emoticons are dropped when crafting trading cards and are tradable." 22:10:41 fucking hell 22:10:42 -!- Bike has quit (Disconnected by services). 22:10:48 -!- Bike_ has changed nick to Bike. 22:10:48 Apparently you have to get an emoticon drop before you can use it in a conversation. 22:10:50 sorry for the language... but... 22:10:58 I don't know if it's a one-time-use or if you "unlock" it for all time. 22:11:07 `addquote "Emoticons are dropped when crafting trading cards and are tradable." 22:11:10 It is kind of hilarious. 22:11:11 1154) "Emoticons are dropped when crafting trading cards and are tradable." 22:11:26 fizzie, this is like a bad TCG 22:11:38 I don't know of a TCG where the cards are craftable 22:11:41 It doesn't have any gameplay *except* from getting the card 22:11:44 ais523, Hearthstone 22:11:45 "Emoticons are little symbols or pictures given to a user once they have crafted a badge. Emoticons are used in Steam Chat, either by typing the shortcut to that emoticon (which is surrounded by colons - for example, :crate: for the Team Fortress 2 crate emoticon), or by selecting the image from the selection box of emoticons. 22:11:50 A few basic emoticons are included in Steam that everyone can access, but most are only available if you own the emoticon (which is an item stored in your Steam inventory.) Anyone can see an emoticon that you've used in a message to them even if they don't own the emoticon themselves. 22:11:55 Emoticons come in 3 rarities: common, uncommon and rare. You can receive an emoticon of any rarity when you craft a badge, but the higher the level of badge that you craft, the greater the chances that you'll receive an uncommon or rare badge." 22:11:58 ais523, you can craft by destroying enough other cards to get dust or something like that 22:11:59 There's even three levels of rarities. 22:12:08 ais523, wouldn't work in a non-digital TCG of course 22:12:39 fizzie, very much TCG mechanics 22:13:03 -!- monotone has quit (Quit: restarting). 22:13:23 -!- AwfulProgrammer has quit (Ping timeout: 245 seconds). 22:13:24 -!- monotone has joined. 22:14:00 I don't have the "make a trade" task marked as done, I must've done that coal-for-coal thing before the badges were a thing. 22:14:17 -!- _46bit has quit (Ping timeout: 272 seconds). 22:14:43 -!- conehead_ has quit (Ping timeout: 260 seconds). 22:14:55 -!- ggherdov has quit (Ping timeout: 272 seconds). 22:14:57 fizzie, seems I got some cards from playing garry's mod at some point. 22:14:58 -!- AwfulProgrammer_ has joined. 22:14:59 -!- _46bit has joined. 22:15:08 Is that separate from crafting? 22:15:21 How *do* you craft on steam 22:15:23 -!- _46bit has changed nick to Guest7487. 22:15:32 Vorpal: You get a couple (three, four?) for pretty much any card-enabled game just by playing it. 22:15:54 fizzie, also it says I have the pillar of community thing but it also says it isn't completed on another page 22:15:57 Or, rather, you're eligible for that many initially, and they drop pretty quickly; if you spend a couple of hours in-game, you'll probably get all those. 22:15:57 not sure how that works 22:16:05 Vorpal: There's different levels of Pillar of Community. 22:16:41 X out of 26 for level 1 (I've got that too); 22 of 26 for level 2; presumably 26/26 for level 3 or something. 22:16:45 fizzie, nah it says "Complete 14 of 26 Steam Community tasks to earn the Level 1 badge." and I have 13 22:16:50 Oh. 22:16:59 fizzie, maybe they added more stuff in later? 22:17:17 Are you sure you have it? Incomplete ones are also listed on the "badges" page. 22:17:18 And I had enough earlier 22:17:31 I went to Badges and clicked "completed" 22:17:32 That could also be the case. 22:17:36 Oh, okay. 22:17:41 Surely that would only list completed ones 22:17:44 -!- iamcal has quit (Ping timeout: 246 seconds). 22:18:01 I guess they might've been adding more tasks. 22:18:05 fizzie, it doesn't say when I unlocked it, or what level it is at 22:18:18 Hmm. 22:18:35 It says "Unlocked: 14 Nov, 2013 @ 12:25am" for my level 1 in the "completed" list. 22:18:52 Well, it doesn't explicitly say "level 1" anywhere, just that I need to do 22/26 for level 2. 22:18:58 fizzie, well I would have gotten it way earlier than this year if I unlocked it 22:19:05 haven't done much on steam the last year or so 22:19:58 Anyway, I don't really know how you get more cards than the ones you're initially eligible for. AIUI, you'll get "booster packs" (another TCG term there) randomly, as soon as you keep logging in to Steam, but I don't think I've ever gotten one. 22:20:27 I think in general to actually craft badges you're supposed to trade cards you don't want, or something. 22:20:37 ugh 22:20:40 Or perhaps (more likely) buy them on the market, because Valve gets a cut. 22:20:41 -!- iamcal has joined. 22:21:03 They're all selling for something like 0.04-0.10€/card. 22:21:25 fizzie, it is pretty terrible. Yet people seem to want to do it, since I sold the stuff I got when voting on the sale this time around, and most got sold within half an hour 22:21:32 Same here. 22:21:42 the fact that this business model is even viable hurts my head 22:21:50 The number of random booster packs generated depends on the number of badges crafted, and I guess I don't really pay "popular" games. 22:22:15 ais523, well I doubt it would stand on it's own. They sell the games too. That is probably a much larger income source than people trading cards. 22:22:18 ais523: I don't think they've released any statistics, but I suppose it's all just extra icing on top of their "actual business" of selling games. 22:23:06 -!- upgrayeddd has quit (Ping timeout: 252 seconds). 22:23:08 "Summing up all the sales data resulted in stunning numbers that I want to share with you: In the past year (since dec'12) there was a trade volume of ~$38.9 million shared on ~58.0 million transactions. Valve gets 15% of each market sale, so nearly $6 million for doing nothing but letting steam users sell millions of items." 22:23:10 -!- HaliteTablet has quit (Ping timeout: 272 seconds). 22:23:28 Holy crap, there are 19 DLC for Saints Row 4 already. That game isn't all that old 22:23:29 Well, I guess that's a reasonably large number. 22:23:30 -!- typeclassy has quit (Ping timeout: 246 seconds). 22:23:50 Totalling, *when on 60% sale* 31.02 EUR 22:24:02 That is insane 22:24:15 Vorpal: Hey, that's nothing compared to TS2014 DLC or something. 22:24:28 TrainSimulator I *expect* that sort of thing from 22:24:43 Not from Saints Row 22:24:50 2379.53 EUR for all TS2014 DLC. 22:24:58 (Wonder how many people have bought all of it.) 22:25:02 -!- typeclassy_ has joined. 22:25:05 I much preferred the model of base game followed half a year or more down the line with a big expansion pack 22:25:07 -!- HaliteTablet has joined. 22:25:15 fizzie, very few I hope 22:25:26 -!- iamcal has quit (Ping timeout: 264 seconds). 22:25:33 -!- upgrayeddd has joined. 22:25:55 fizzie, I would guess that most people just get the couple of trains they are really interested in and so on 22:26:20 Vorpal: There's a "Not Recommended | 1,423.0 hrs on record" review on the TS2014 store page; most comments are to the tune of "didn't like but played over a thousand hours???". (It's from someone who dislikes the new upgrade; Steam counts playtime of older versions in there.) 22:26:40 fizzie, heh 22:27:09 fizzie, well normally I would say that person is well qualified to give an opinion 22:27:19 Unlike the guy who played 5 minutes 22:27:25 -!- iamcal has joined. 22:27:42 Probably over-qualified even 22:29:00 This game (got from some recent indie bundle) has a terrible name in my steam game list: "AaaaaAAaaaAAAaaAAAAaAAAAA!!! for the Awesome" 22:29:02 I guess two kiloeuros isn't very much money to put in a hobby in the end, anyway; people sure waste a lot more than that. 22:29:34 I've got Aaaa[...] too; it was in the most recent "PC and Android" bundle I bought mostly for Gemini Rue, Little Inferno and maybe Bard's Tale. 22:29:50 fizzie, well yeah, if you get into photography you can easily top that 22:30:27 -!- AnotherTest has quit (Ping timeout: 246 seconds). 22:30:36 fizzie, I got Bard's Tale from some earlier bundle iirc. Kind of funny I guess, but that humor doesn't really click with me. Too childish a lot of the time 22:30:59 welp, http://esolangs.org/wiki/Ruby%E3%81%A7%E4%BD%9C%E3%82%8B%E5%A5%87%E5%A6%99%E3%81%AA%E3%83%97%E3%83%AD%E3%82%B0%E3%83%A9%E3%83%9F%E3%83%B3%E3%82%B0%E8%A8%80%E8%AA%9E 22:31:05 Also pretty ugly 22:31:14 come on Chrome, did you really have to escape that whole thing? :/ 22:31:18 nice! 22:31:34 elliott, heh my font fails at that on the page. Works in the title bar though 22:31:51 -!- AwfulProgrammer_ has quit (Ping timeout: 240 seconds). 22:31:54 I thought it was supposed to fall back to another font if it failed to find the glyph?? 22:32:13 Vorpal: Yes, it didn't really impress very much so far. 22:32:15 -!- CADD has quit (Ping timeout: 246 seconds). 22:32:27 the book is only $27 if you preorder it, by the way! 22:32:37 ...plus shipping from Japan 22:32:46 you can also buy a PDF if you are boring 22:32:58 elliott, not free shipping? 22:33:19 from Japan? I kind of doubt it. 22:33:22 but I haven't tried. 22:33:30 i ordered something from japan once 22:33:34 it was in japanese 22:33:44 shachaf, were you expecting that? 22:33:49 yes 22:33:53 but i still couldn't read it 22:33:56 Oh well 22:34:08 Vorpal: Incidentally, apparently a 10% of all Steam market trading card sales goes to the game developer, and only 5% to Valve (forming the 15% cut that doesn't go to the seller). 22:34:14 -!- ggherdov has joined. 22:34:20 shachaf, IIRC google translate has some sort of OCR mode in the android app for it 22:34:24 -!- AwfulProgrammer_ has joined. 22:34:25 Never tried it 22:34:29 Probably terrible 22:34:54 fizzie, except for the sale cards, which go all to steam I expect? 22:34:58 Google Translate's performance on Japanese itself isn't that great to begin with... 22:35:24 Vorpal: Well, I guess Valve counts as the "developer" of the holiday sale. 22:35:50 -!- CADD has joined. 22:36:07 monotone, Norwegian -> Swedish (which should be fairly easily you think, since the languages are quite closely related) was pretty bad. It kept inserting negations in random sentences, changing the meaning completely of the text. 22:36:08 Vorpal: But at least the developers get something out of it too. (Though maybe that's just an incentive to put trading card support in their game. Though I guess Valve might give them other incentives too.) 22:36:27 Vorpal: It probably goes Norwegian -> English -> Swedish for that. 22:36:37 Possibly 22:37:11 Chinese-to-English tends to be quite bad too. 22:37:27 fizzie, the support consists of creating some cards and dropping them when a play time counter reached a certain value? 22:37:29 Doesn't it? 22:37:30 Anything -> Latin is awful 22:37:38 Yeah, a lot of machine translation systems use English as an intermediate language. 22:38:09 Vorpal: Possibly only the former; the latter might well be a built-in feature of the Steam overlay. 22:38:26 fizzie, But I have the overlay turned off, and I still got some cards 22:38:46 Well, the Steam client, then. It knows when you're in-game, anyway. 22:39:11 The card images probably come from the game developers, at least. 22:39:14 -!- AwfulProgrammer_ has quit (Ping timeout: 264 seconds). 22:39:16 fizzie, hm that would be interesting for skyrim. I usually launch that with the script extended thingy instead, SKSE 22:39:23 Don't think steam is 100% aware of that 22:39:40 I really do not like the overlay. I do not want to see achivements pop up in the corner and breaking my immersion in games where immersion is a key factor 22:39:42 I get the Steam overlay even when launching via NMM + SKSE. 22:39:55 hm 22:40:00 -!- HaliteTablet has quit (Ping timeout: 245 seconds). 22:40:04 (I don't really know how it all works.) 22:40:18 -!- Guest7487 has quit (Ping timeout: 240 seconds). 22:40:20 yeah I guess steam *does* need to be running for it to work so yeah 22:40:32 Part of that DRM and all. 22:40:35 -!- AwfulProgrammer_ has joined. 22:40:51 fizzie, I preferred the oblivion way: Have the CD mounted. 22:41:08 Of course for convenience you just use an image file and mount it as a CD 22:41:23 So that is easily bypassed 22:41:45 Wonder if I should sell my Skyrim trading cards, it's not like I'll ever be completing any of these sets. 22:42:28 Yeah I try to buy games on gog.com instead. Much better customer service, DRM free, and usually include at least some extras such as extra printed materials or sound track as well 22:42:50 fizzie, I should probably sell all my trading cards. All 5. 22:42:52 -!- _46bit_ has joined. 22:43:03 Some of them sell for really little. 22:43:09 (Incidentally, do you happen to know if you can use Steam Wallet money to deduct from the price of a regular Steam purchase?) 22:43:19 0.05 EUR for one of the garry's mod ones 22:43:29 fizzie, yeah it happens automatically 22:43:42 at least for me 22:43:57 Good. Though I guess it might take quite a while before I buy something again in Steam. 22:44:31 Wow, 0.04 EUR for one of the cards from the summer holiday sale. Seems those are still valid though unlike the cards for this sale, which will soon be invalid. Hm 22:44:46 -!- ggherdov has quit (Ping timeout: 240 seconds). 22:44:55 I seem to have 19 trading cards (4x Deponia, 4x McPixel, 4x Scribblenauts, 3x Super Meat Boy, 4x Skyrim). 22:45:00 -!- AwfulProgrammer_ has quit (Ping timeout: 245 seconds). 22:45:14 Assuming an average of 0.05 EUR, that'd mean... almost a whole euro! 22:45:19 Such fortune. 22:45:31 I have 5 from playing games, and 7 from the summer sale 22:45:44 fizzie, the game ones I have are worth a bit more 22:46:00 The portal 2 one 0.1 EUR 22:46:14 -!- AwfulProgrammer_ has joined. 22:46:15 -!- typeclassy_ has quit (Ping timeout: 245 seconds). 22:46:43 fizzie, The "missing textures" one from GM looks pretty nice though. Pink and black chess board pattern 22:46:59 It sticks out like a sore thumb in the steam inventory 22:47:38 -!- _46bit_ has quit (Ping timeout: 264 seconds). 22:48:07 Well, Deponia cards sell for 0.10 EUR, McPixel for 0.03-0.05 EUR, Scribblenauts for 0.05-0.06 EUR, Super Meat Boy for... ooh, 0.13 EUR (!), and Skyrim for 0.11-0.12 EUR or so. 22:48:21 -!- typeclassy_ has joined. 22:48:53 fizzie, do you have to trade something in both directions for a trade? 22:48:54 So I might get up to 1.5 EUR from selling all of them. Even better. I'll be swimming in virtual money soon. 22:48:59 If I want to get rid of the coupons 22:49:07 I just want to give them away really 22:49:13 I think you can do a unidirectional trade, but not sure. 22:49:27 Good 22:49:33 when I try to use Google Translate to find out what the Japanese cat cafés are saying, it's always nonsense 22:49:35 -!- upgrayeddd has quit (Ping timeout: 245 seconds). 22:49:42 maybe they use too many cat puns though 22:50:18 Vorpal: Though I don't know, because giftability is a separately tracked thing, and a unidirectional trade is pretty close to a gift. (Without the gift-y trappings, though.) 22:50:29 fizzie, what trappings? 22:50:34 kmc: are they meowing 22:50:39 or nyaning or something 22:50:42 gif-ability 22:50:45 i think that is not japanese but cat 22:50:47 they're nya-ing at least 22:50:48 Vorpal: I think you can send it as a fancy email message or something? 22:50:53 Vorpal: I don't know, I've never gotten a Steam gift. 22:51:03 that works 22:51:07 Ah 22:51:32 kmc: When I try to use GT to find out what my (Finnish) friend is saying (in Chinese, at his Weibo microblog), it's quite often nonsense too. 22:51:51 kmc: have you considered being a cat when you grow up 22:51:51 fizzie, heh, the price for the summer sale trading cards all went up marginally around the start of the current sale. 22:51:55 I wonder why 22:51:58 shachaf: yes 22:52:02 imo do it 22:52:09 shachaf: i tried the Necomimi mind-reading motorized cat ears 22:52:10 A couple of cents mostly 22:53:59 Huh, my Deponia card sold immediately. 22:54:12 It's all very bizarre. 22:54:16 -!- upgrayeddd has joined. 22:54:23 fizzie, wow that was quick. I put up those 5 game cards for sale like 4 minutes ago. They are all sold already 22:54:32 I don't get it 22:54:39 -!- typeclassy_ has quit (Ping timeout: 246 seconds). 22:54:42 I guess people are buying them? 22:54:48 I guess so 22:55:16 Maybe I should put them up for a bit more than the market value next time and see if I get lucky with it being the cheapest at the point of sale by chance 22:55:41 I don't know what kind of benefits you get from a high Steam Level. 22:56:00 fizzie, you said voting on community thingy before? 22:56:09 -!- typeclassy_ has joined. 22:56:15 There's that, but there's probably something else too. 22:56:23 I know you can "pimp" your profile more, the higher your level is. 22:56:33 Vorpal: weren't you just mocking the idea of doing this kinda thing before 22:56:46 Showcase (more) badges, make a custom info box, that kind of stuff. 22:57:32 elliott, I'm mocking the idea of buying this stuff. But if I get cards for just playing games I want to play, of course I'm going to sell them, since I do not say no to money 22:57:41 Well, legal money that is 22:57:48 "What are the direct benefits of my Steam Level? You get more options to customize your profile, and the maximum number of friends you can have on your friends list increases." 22:57:55 -!- ggherdov has joined. 22:58:00 I don't think you would do anything that gives you money just because it's legal 22:58:01 "Once you reach Steam Level 10 you can pick and customize a showcase from the profile edit page. Each 10 Steam Levels earns you an extra showcase, i.e. two showcases at Level 20, three showcases at Level 30, etc." 22:58:09 if you would then you're dangerous 22:58:16 elliott, well no, but this require no effort at all. 22:58:23 And doesn't hurt anyone 22:58:36 Except possibly those stupid enough to spend money on this stuff 22:58:44 arguable, it hurts people sucked into buying these things for various psychological reasons 22:59:28 if you ascribe addiction to gambling type things to stupidity then you have a rather shallow understanding :/ 23:00:06 I'm not sure these people are addicted to gambling, since they can clearly see which card and what it costs. 23:00:07 Vorpal: Also, turns out you can't do the "set profile background" task of the Pillar of Community by just, you know, uploading a background image. No, you have to get a background image drop from crafting a badge. Then you can set it as your background profile, or trade/sell it away. 23:00:14 "If you gather another complete set of trading cards for the same game you can upgrade that game badge. You can craft a set for the same game at most five times. Each time you upgrade the game badge you'll get an extra 100XP, as well as upgrading the image and title of the badge." <-- jesus crist 23:00:46 fizzie, well I guess they want to avoid penises and such 23:00:48 I think you're also likelier to get rare drops from higher-level badges. 23:00:50 Vorpal: "gambling type things" 23:00:50 -!- typeclassy_ has quit (Ping timeout: 264 seconds). 23:00:52 am i going to have to manually set prices for every card i own 23:00:53 -!- Guest7487 has joined. 23:00:54 -!- Guest7487 has changed nick to _46bit. 23:01:00 if you think a lot of these trading type systems aren't designed to exploit people then ... 23:01:18 -!- AwfulProgrammer_ has quit (Ping timeout: 246 seconds). 23:01:22 Phantom_Hoover, yes you need to sell them one by one from what I can tell 23:01:23 -!- _46bit has changed nick to Guest65919. 23:01:30 if you own a lot that would be annoying yes 23:01:37 elliott, oh yes they are 23:01:44 Vorpal: You can probably already get penises in via screenshot upload feature and versatile-enough games, but I guess there's that. 23:02:05 fizzie, well as long as garry's mod exists yes 23:02:12 -!- LinearInterpol has joined. 23:02:27 Or any moddable game for that matter 23:02:38 Vorpal: and you see nothing unethical about exploitation? 23:02:40 or any source engine game with sprays 23:02:45 w0t. 23:02:48 because you decided they're stupider than you...? 23:03:09 elliott, steam doing it. Me just clearing out my inventory of 5 cards for a total of 0.26 EUR, not so much. 23:03:23 elliott, except he's not exploiting anyone; steam are, he's just mildly complicit (and you're already complicit by using steam at all) 23:03:34 Phantom_Hoover, good summary yes 23:03:45 -!- ggherdov has quit (Ping timeout: 246 seconds). 23:04:38 Yes in a sense I guess I'm allowing this to happen to a very slightly larger degree by selling my selling my cards. On the other hand, the price will be lowered by people flooding the market, meaning these addicted people will have to spend less money 23:04:51 s/selling my// 23:04:53 -!- AwfulProgrammer_ has joined. 23:05:06 elliott, is that second point not valid? 23:05:24 If very few people sold cards the price would rise instead. 23:05:47 Phantom_Hoover: sure, there are degrees of complicitness though. anyway, I wasn't actually trying to say what he did was immoral 23:05:52 just that the justification "I don't say no to money" is nonsense 23:06:22 elliott, yes I realized right after I said that, that it was badly worded 23:07:05 Also they do *foiled* trading cards? For digital only cards? Really? 23:07:44 Yes. 23:07:55 I guess they have a shinier graphic? 23:07:58 I haven't seen one ever. 23:08:05 Why couldn't steam let you play a game with the trading cards, like MTG or Hearthstone does. Instead of just trading the cards... 23:08:12 fizzie, nor me 23:08:20 (Also I hadn't realized the maximum number of friends is based on Steam Level.) 23:08:57 fizzie, are you anywhere near the limit though? 23:09:46 it's not just maximum number of steam friends 23:09:54 it's the maximum number of actual friends you can have 23:09:59 Vorpal: I don't know, I'm not sure where the limit is listed. 23:09:59 this steam business is important 23:10:06 AH 23:10:08 Ah* 23:10:11 Vorpal: I doubt it's "5", though. 23:10:28 Ah, "Friends: 5 / 330". 23:10:38 Seems I'm not quite in danger of running out of slots, then. 23:11:02 > 5 / 330 23:11:04 1.5151515151515152e-2 23:11:41 Hm I have a badge called "Power Player". Seems it is based on how many games I own since it says "248 games owned" in the description. It also has the icon of the text "100+". I think I bought around 15-20 games directly on steam though. The rest is all indie bundles. 23:12:04 has as the icon* 23:12:18 That is a hell of a lot of games... 23:12:30 Most of them are probably bad too 23:12:47 Or I'm at least no interested in most of them 23:12:53 I have the "Collection Agent" (same, but 50+) badge. 23:12:59 Ah 23:13:21 fizzie, interestingly I get 497 XP from that badge. What a weird number 23:13:44 > 497 / 248 23:13:45 2.004032258064516 23:13:49 games*2+1? Kind of curious. 23:13:51 Nope, didn't think so 23:13:53 Ah yes 23:13:55 of course 23:14:13 Wow, a friend of mine has a Snow Globe 2013 *foil* badge. 23:14:25 fizzie, what is the difference? 23:14:43 Also there is quite a lot of linux games on steam these days 23:14:43 The icon is all silvery. 23:14:51 not gold? Oh well 23:15:33 Vorpal: Incidentally, you only need two more games for the Game Mechanic (250+) badge. 23:15:56 fizzie, well, I guess the next indie bundle which I want like 1-2 games from will provide that 23:16:15 speaking of indie bundle, wasn't there a new humble weekly one now? 23:16:43 Ah point and clicks. And I own all but one 23:16:45 -!- LinearInterpol has quit (Read error: Connection reset by peer). 23:16:58 And I don't care about Shelter 23:17:07 Skipping that one 23:17:11 -!- LinearInterpol has joined. 23:17:31 Wait, I don't own Lume either. Hm *checks out the video* 23:18:39 I quite liked Botanicula and Machinarium. 23:18:51 But I've already got both of those. 23:18:52 machinarium is great 23:20:09 Bike, if you liked machinarium, give Botanicula a try. Same developer. Same feeling to it. 23:20:25 But it's all bio and not robo. 23:20:43 Well yes 23:21:47 Also don't try to play Machinarium on a Nexus 10 tablet. It really isn't made for such a high DPI screen and it uses pixel based graphics. 23:21:54 Quite unplayable 23:22:12 Almost as bad as Avadon on the Nexus 10. 23:22:33 -!- ggherdov has joined. 23:22:34 does botanicula run on android? 23:22:38 seems not 23:22:49 according to the platform list on humble bundle 23:22:54 :( 23:23:08 As much as I like Spiderweb Software and as much as I love all the games they (well he, one guy iirc) made; the android port is unplayable 23:23:11 win / mac / linux / steam. nope. 23:23:15 on a 300 dpi monitor 23:23:24 s/monitor/screen/ ? 23:23:33 display. 23:23:40 I guess you can't say monitor about a tablet 23:23:48 display works yes 23:23:58 Also lume doesn't look that interesting 23:24:37 well machinarium is the only game on that list that I've already played ... 23:25:01 machinarium was good 23:25:17 Machinarium and Botanicula both don't have Linux support in their Steam editions, which is a bit of a shame. 23:25:24 int-e, Botanicula is well worth $6 alone. Samorost and Windowsill aren't really worth much IMO. Lume and Shelter I never played 23:26:09 I'd like for Botanicula to have some sort of a "have not yet collected all creature cards" indicator before progressing through points of no return. 23:26:18 fizzie, well I prefer to not use steam most of the time. I do redeem my bundled games on steam though as an insurance should humble bundle go under. 23:26:20 mmm i'll probably buy that later 23:26:56 fizzie, I would much prefer redeeming on gog or even desura though. You used to get desura codes in the early bundles, but it has been a while since I have seen that 23:27:25 Perhaps Valve made them an offer they couldn't refuse. 23:27:28 fizzie, the cards didn't have any functional use though did they? Looked nice yes, but no function iirc? 23:27:53 fizzie, desura also started their own bundle, indieroyale or something like that iirc 23:28:12 There's one to three "presents" you get at the end that depends on the number of cards you got. 23:28:14 Vorpal: I spent $10, too lazy to enter a custom amount ;) 23:28:25 I wandered around quite a lot, but still missed several. 23:28:26 Generally pretty crappy games on indieroyale the times I checked iirc 23:28:39 fizzie, ah 23:28:59 int-e, heh, well botanicula is worth that alone I would say 23:29:17 Of course the presents don't really have a "function" either, I believe; at least the one (or two? can't remember) I got was just nice little animation. 23:29:27 Then again, looking at nice things is pretty much what the whole game is all about. 23:29:44 Preferrably things that go "whee". 23:30:21 True 23:30:35 I don't remember how many cards I got 23:31:22 I started a new playthrough where I tried to click on absolutely everything, and got it to the ground, but I'm a bit afraid I missed something small this time around too. 23:31:52 Perhaps I should just look up the number of cards you're supposed to have at the end of each "chapter" from the web. 23:31:59 (I'm sure someone's counted.) 23:32:07 fizzie, I think I got a fair amount of them, since I do tend to click on everything in that type of game 23:33:03 Well, I do too, but I still managed to miss some, somehow. 23:33:39 The bit where you drop waters and set the "cups" to determine where it goes, did you do all the possible sprouty things? 23:33:46 I don't remember if I got all 23:34:24 -!- Phantom__Hoover has joined. 23:34:25 (You only need to make the middle bit sprout, but there's a special scene and an associated creature card if you do all.) 23:34:27 Everything is deeply intertwingled... 23:34:41 fizzie, I played it around launch, haven't played it since. Don't even remember that part 23:35:16 Honestly, I probably wouldn't remember either, except for that quasi-recent replay. 23:35:21 Ah 23:37:15 fizzie, btw, that "Jack Lumber" game in the some recent humble bundle. Has some quite funny humor, better than Bard's Tale humor at least. Not a fan of the game play though 23:37:40 Pretty absurd game, with a really absurd back story 23:37:51 -!- Phantom_Hoover has quit (Ping timeout: 260 seconds). 23:37:56 i forgot to play zzo38's game :( 23:37:59 maybe i will remember later 23:38:52 which game 23:38:58 Professional Octopus of the World? 23:39:09 kmc, Or do it now. Or you could do it later. If you want to. But you don't have to, if you don't want to. 23:39:40 Vorpal: I seem to have it. 23:39:44 Do you mean Attribute Zone? 23:39:58 fizzie, yeah worth playing for a bit on the tablet I guess. 23:40:00 Currently it has only two levels, so it isn't good enough yet, but there are many other games in the same package. 23:40:15 fizzie, definitely a mobile game level of game play in that 23:43:10 Vorpal: Oh, somewhat amusing: I recently(ish) Steam-activated all my bundle games, then installed Thomas Was Alone on Linux via Steam. I had been playing the directly-downloaded Linux version before, so it managed to dug up my existing (near-the-ending) save from somewhere (presumably $HOME), but then also "achievified" all the achievements (something like 30) I had unknowingly gotten so far, ... 23:43:16 ... all at the same time. 23:43:18 Quite the flood of pop-ups. 23:44:00 (It's one of those games where you get a lot of Steam achievements simply by playing it normally.) 23:44:27 fizzie, haha 23:44:33 And yes I know 23:44:42 A brilliant game 23:45:16 After Super Meat Boy, the controls felt decidedly clunky, though. 23:46:05 (Might have been partially a gamepad/keyboard difference too.) 23:46:59 I'm not generally a fan of platformers, but the story in Thomas was alone is brilliant 23:56:23 Slightly more on-topically, they could put more esolangs in games. (Certain to have mass-market appeal, I'm sure.) SpaceChem is the only thing I can think of offhand that kind of is one. 23:56:51 spacechem meets spaceteam 23:57:22 kmc: Is this some kind of #spascedrugz reference? 23:57:33 (can't spell) 23:57:39 probably not? 23:57:57 we did use "space drugs" as a term for experimental psychedelics 23:58:18 Yes, make up a chess variant involving INTERCAL somehow 23:58:49 what the actual fuck 2014-01-03: 00:00:02 fizzie, I seem to remember that open source game where you guide a black ball around a maze having a level based on brainfuck 00:00:58 Can't remember the name of the game 00:00:58 Robozzle is also kind of like an esolang, but it's not exactly a "mainstream" game. 00:01:00 e-something 00:01:41 robozzle <3 00:01:48 which actual fuck myname? 00:01:53 i especially like that there is an android port 00:02:10 kmc: i'm just not used to zzo yet 00:02:29 zzoh 00:02:54 Vorpal: Enigma 00:02:59 http://enigma-game.org 00:03:01 I have made up a similar game to Robozzle too but there isn't enough levels yet 00:03:17 I've developed levels for it, that are actually in the official released versions (not just modding) 00:03:22 zzo38: define "similar" 00:03:24 perhaps the most infamous one is a backwards Sokoban 00:03:34 where you're given an empty room where you can build walls and place boxes 00:03:39 and the level solves it and then tells you it was too easy 00:03:50 -!- Bike has quit (Ping timeout: 264 seconds). 00:03:54 or alternatively, if it's impossible, makes you go solve it yourself (you can't) 00:03:55 ais523, ah yes 00:04:25 There's an Android port of SpaceChem too, sadly not automatically available if you have the computer version. (Didn't really do the "post-game" content, might on the tablet.) 00:04:53 I wasn't much good at SpaceChem 00:05:30 I was barely good enough to get through it. 00:05:49 myname: You have set of commands available (which can differ per level), and rows of programming you can fill in, and have to catch all of the diamonds before the program stops. There can be diamonds in places where there is no floor; you can step there safely but then cannot step there a second time unless the hole is filled in. If there is a "$" then you must catch that one last, otherwise you lose. 00:05:55 I found it pretty boring, so I didn't play more than maybe two worlds of it 00:06:07 At that point at least it wasn't really hard. 00:06:14 It quite resembles an arbitrarily constrained Befunge, though. 00:06:19 I just found it monotonous 00:06:37 fizzie: i stumbled upon a game based on an esolang recently 00:06:42 fizzie, yes, and I suspect it isn't TC? 00:06:48 myname: Does this description explain it? 00:06:55 zzo38: kind of 00:07:16 zzo38: sounds like a slightly modified robozzle 00:07:32 there should be more interesting commands available! 00:07:39 programming games in general are a bit awkward 00:07:47 myname: Yes, although the engine is entirely rewritten, in QBASIC. 00:07:53 Phantom__Hoover: tbh, i don't like most of them 00:07:59 And more commands can be added if you have an idea what to add! 00:08:01 i really like the idea 00:08:01 Vorpal: I'm pretty sure it has finite state, yes. 00:08:03 but... 00:08:11 fizzie, right 00:08:36 fizzie, you have those production line things though, you could extend them to be infinite queus 00:08:40 *queueus 00:08:45 *queues? 00:08:53 zzo38: why qbasic? i used that when i was like 12 years old 00:08:57 Quuus. 00:09:13 Qs 00:09:16 i should figure out how to wrap up my "x86 is turing complete with no registers" post 00:09:37 And that's true. They have a finite maximum capacity as implemented, though. 00:09:43 kmc, huh? It is? 00:09:45 how 00:09:52 well wait and read the article 00:09:52 i'd love something like an ncurses game engine for android 00:09:54 myname: I write in a computer that is the only compiler, the QBASIC compiler. Also, QBASIC is not bad for writing these kind of computer games actually. 00:10:00 it has finite storage though, but so does x86 itself, or C 00:10:04 kmc, With infinite ram I assume, but there is not an infinite address space 00:10:25 kmc, then it really isn't TC. And nor is C indeed 00:10:29 yeah 00:10:39 justifying this is the last part of the article I need to write 00:10:57 Justifying a false claim? 00:11:12 kmc: Just call it something else, perhaps. 00:11:14 did you know that comonads are just cofree comonad comonad comonad coalgebras 00:11:16 just because something is false doesn't make it unjustifiable 00:11:21 justifying that a brainfuck implementation with a fixed sized tape meets the informal definition of "turing complete" that programmers use 00:11:28 kmc, Anyway, I would say that proving it is a bounded storage machine without registers is pretty cool too 00:11:35 you can come up with plenty of plausible reasons why something was likely to happen, even if it didn't 00:11:39 -!- FreeFull_ has joined. 00:11:51 i mean e.g. there's a famous paper titled "mov is Turing-complete" about x86 with the mov instruction, and this would seem to have the same issue 00:11:56 with only the mov instruction, i mean :) 00:12:09 and a jump!! 00:12:13 that's right 00:12:18 they have one unconditional jump 00:12:21 mov and jmp heh 00:12:25 can't you just cycle round the entirety of memory? 00:12:29 mov, really? 00:12:31 actually, if you keep going long enough 00:12:39 cmov yes, but mov? Wow 00:12:43 you'll end up activating the A20 line trying to decode the next address 00:12:47 yeah, read the paper 00:12:48 and I guess you could activate it with mov too 00:12:48 well, x86 mov is quite versatile 00:12:52 so you could reboot the system 00:12:55 ais523, only in real mode surely? 00:13:04 -!- AwfulProgrammer_ has quit (Read error: Connection reset by peer). 00:13:10 ais523, shouldn't happen in protected or long mode 00:13:12 I guess the next question is, is lea Turing complete? 00:13:13 I didn't like how the mov+jmp one "halts" with an invalid memory access. 00:13:17 -!- iamcal has quit (Read error: Connection reset by peer). 00:13:24 Vorpal: I learned from 8086 manuals 00:13:33 lea can't access memory can it? 00:13:36 Wasn't there one that uses page-fault errors? 00:13:38 ais523, kiiind of outdated these days 00:13:44 -!- FreeFull has quit (Ping timeout: 260 seconds). 00:13:44 literally, I got a book out of the library that covered mostly DOS 1 and DOS 2 00:13:46 why would that reboot the system? 00:13:47 with some mentiones of DOS 3 00:13:52 Taneb: yes, computing using only the MMU as it handles a never-ending double fault 00:14:06 http://events.ccc.de/congress/2012/Fahrplan/events/5265.en.html 00:14:09 int-e: it was an awful hack, basically they needed a way to restart the processor to be able to get back into real mode 00:14:28 Anyway, goodnight 00:14:30 so they connected one of the address lines to the keyboard controller, which was connected in turn to the reset input of the processor 00:14:53 ais523: the keyboard controller did that. the a20 line is a hack to make the system actually wrap around memory above 1MB, to be 8086 compatible. 00:15:04 -!- iamcal has joined. 00:15:05 right, it's not for rebooting 00:15:16 ais523, I remember looking in an old computer book, that said that the newly released Pentium series was mostly for high end workstations and would never have a mass market appeal 00:15:19 int-e: I suddenly realised I was muddling two things together 00:15:20 -!- AwfulProgrammer_ has joined. 00:15:36 Or it might have been a magazine, not 100% sure 00:16:01 there was a thing where Windows would trigger a triple fault to reset the CPU because it was the fastest way to get back to real mode 00:16:13 kmc: right :) 00:16:18 kmc: because it less insane than asking the keyboard controller, also a lot faster 00:16:20 you can reset the CPU without clearing memory or other platform state 00:16:43 Linux still uses triple faults as a last-ditch attempt to reboot 00:16:46 nice 00:16:50 which it causes via setting the interrupt vector size to 0 00:16:58 nice 00:17:00 it only does that if the CPU's still running after all other attempts have failed 00:17:03 -!- FreeFull_ has quit (Ping timeout: 240 seconds). 00:17:07 related: https://twitter.com/horse_unix/status/407426257010163712 00:17:16 it's like that awkward bit of a program that comes just after you tried to run exec 00:17:20 fizzie: http://kevan.org/rubicon/ 00:17:27 ais523, heh 00:17:31 kmc: still waiting for zzo38_ebooks :'( 00:17:31 A20 line enable/disable did go through the keyboard controller too, though. 00:17:46 fizzie: right, maybe that's what confused me 00:18:00 also, one of the platforms I'm used to is PIC microcontrollers 00:18:07 ais523, which series? 00:18:09 and people do things like connecting GPIO pins to the reset line all the time on that platform 00:18:09 zzo38: is that backwards sokoban a real thing? google turns up people playing sokoban in reverse (pulling boxes), so it seems hard to find. 00:18:16 ais523: heh, yeah 00:18:24 Vorpal: I learned on the 16F series, but I used others too 00:18:24 myname: I don't know why I didn't think of Rubicon. 00:18:26 int-e: I don't know. 00:18:30 ais523, I coded a bit for PIC12F. It was terribly limited 00:18:32 "Holy frick, I woke up again! Ha ha looks like those fuckers owe me five bucks" 00:18:38 yeah, 12F is mindbogglingly limited 00:18:47 but still fun 00:18:52 fizzie: i would really appreciate an android port of it 00:18:57 ais523, If I have to do that level of embedded programming I prefer a decent AVR instead 00:19:05 I liked the hack where you use a microcontroller to run the boost converter for its own power supply 00:19:11 ais523: Oh, I should be asking you that question. 00:19:16 But really I avoid that low level coding these days. ARM with some GPIO yay 00:19:17 sometimes you have eight pins on the controller, and you can gain control over six of them somehow 00:19:19 you have to press a button rapidly to get it to boot 00:19:22 like starting a lawnmower 00:19:32 int-e: yeah, download Enigma and search for "Nabokos" 00:19:36 ais523, I coded for one with 8 yes, two were for power, leaving 6 indeed 00:19:56 int-e: it is very difficult, though 00:20:11 there's an easy mode that's a little easier 00:20:25 interestingly, the easy mode has two fundamentally distinct solutions, but I've entirely forgotten one of them 00:20:26 ais523, which one is "Nabokos"? 00:20:37 Vorpal: there's a search button on the level pack screen 00:20:41 ais523, I don't even have enigma installed atm 00:20:42 you can search in there 00:20:51 or just search for "Alex Smith" for all of mine 00:21:02 ais523, and I'm on an android device with an external bluetooth keyboard 00:21:15 Vorpal: it's the reverse Sokoban level 00:21:23 where it makes you give it a Sokoban, then it solves it 00:21:25 Hm, don't think I played that 00:21:31 and you win the level if it's sufficiently difficult 00:21:35 Heh 00:21:40 That sounds painful 00:21:47 might be fun. 00:21:48 Not the kind of level I would enjoy 00:22:25 it's possibly the second hardest of mine 00:22:40 (the hardest is "Choices, choices ...", complete with spaces before sentence-ending punctuation marks) 00:22:50 why the spaces? 00:22:58 Is there a reason I'm missing out on 00:23:02 -!- Phantom__Hoover has quit (Ping timeout: 264 seconds). 00:23:23 ais523, also what is the choices one about 00:23:35 Vorpal: the spaces have become a #esoteric/Enigma in-joke 00:23:41 enigma has different floors ! 00:23:51 (note: that line never actually appeared in the original 00:23:52 ) 00:24:04 because whenever you end a sentence with any punctuation mark other than a full stop 00:24:10 some enterprising developer will go and add a space before it 00:24:14 Heh 00:24:27 I don't know why, but it's become quite the joke at this point 00:24:39 Ah, so you don't get the point of it either 00:24:40 Oh well 00:24:47 anyway, there are many levels in Enigma that contain loads and loads of different puzzles and are really long 00:24:56 I know 00:25:00 there is three points to it by my count. 00:25:01 and that tend to get really high ratings for no obvious reason, and are often #100 in a level pack 00:25:10 ais523, I found the quality of the levels varied considerably 00:25:11 The axiom schema of sokocan is when all cells (ignoring walls) are either a player, empty, or box-on-target. 00:25:27 I decided that even though I hate that style of level, I'd try to make one, and try to make it good 00:25:46 e.g. the puzzles that you can fail via dexterity mistakes are front-loaded, and there's an easy mode that lets you do them out of order 00:25:51 and there's a framing puzzle around them all 00:25:59 -!- Sgeo has joined. 00:26:07 in that each of the puzzles has two solutions, and only one of them will allow you to complete the level as a whole 00:26:11 but the level also has perfect information 00:26:19 at any time, you can switch to the white ball and use it to move the camera around 00:26:27 Ah 00:26:38 That sounds quite annoying 00:26:46 and if anything isn't obvious by looking at it, I left a document explaining 00:27:20 -!- FreeFull has joined. 00:27:50 anyway, I still don't like that style of level, I prefer the one-screeners 00:28:07 but it's my favourite of that style, because I designed it to appeal to me 00:28:20 it also has a bunch of features that are recognisably ais523, most of which would be spoilers 00:31:02 Eh okay 00:31:08 I haven't played enigma in years 00:31:18 Probably 2-3 years? 00:31:26 Anyway, good night 00:32:07 night 00:35:50 -!- iamcal has quit (Ping timeout: 245 seconds). 00:36:30 -!- AwfulProgrammer_ has quit (Ping timeout: 246 seconds). 00:36:49 -!- CADD has quit (Ping timeout: 240 seconds). 00:37:01 hmm. what's the point of batteries? 00:37:39 -!- CADD has joined. 00:39:04 -!- Bike has joined. 00:39:17 int-e: a nice convenient method of storing electrical energy? 00:39:40 -!- iamcal has joined. 00:39:51 (sorry it took me a while to answer, I needed to make sure I picked the right physical quantity, I was about to say "power" but didn't want to be inaccurate) 00:40:55 An awful question, I know. Why do I get two batteries in the nabokoS level? 00:41:10 int-e: you get two batteries in every Enigma level 00:41:18 unless they're specifically removed to prevent shortcuts 00:41:23 this is because sometimes you're meant to use them in creative ways 00:41:44 and if they were included only in levels where they were actually useful, it'd spoil the secret of those levels 00:42:03 anyway, it's an Enigma level design rule to give two batteries without a really good reason not to 00:42:16 even though like half the levels have a flag set so that they don't actually do anything 00:42:25 (I requested that they be greyed out in that case, but nobody's implemented it yet) 00:42:37 btw, in some of the levels where they don't actually do anything, they're still useful 00:42:46 Enigma has a lot of corner cases like that 00:44:17 -!- FreeFull has quit (Read error: Operation timed out). 00:47:09 int-e: incidentally, one completely pointless but amusing thing you can do with the batteries in Nabokos is to give them to the white marble 00:52:26 How is it useful if it doesn't do anything? 00:54:25 zzo38: sometimes you can exploit the fact that it doesn't do anything 00:54:32 via using to occupy space that would otherwise be doing something 00:54:54 one item in Enigma, the cup of coffee, explicitly never does anything, but it is nonetheless very useful for that property sometimes 00:55:17 O, so it occupies space. 00:56:22 yeah, all items do 00:56:37 So it still does *that* thing. 00:56:38 but it doesn't have any use beyond being an item 00:56:49 like, it doesn't have any properties except those properties that are common to all items 00:57:11 Yes, that could be useful. 00:57:35 Enigma physics can get very crazy sometimes 00:57:40 each level has a "Knowledge" rating 00:57:57 if it's 5 (no more, no less), that means that you need to exploit some corner case of the engine in order to complete the level 00:58:02 (6 means it doesn't follow the normal game physics) 00:58:13 (like the brainfuck level, or the Tetris level) 01:07:44 -!- ^v has joined. 01:09:04 sometimes I try to design interesting levels with low knowledge ratings, it's hard 01:09:13 the joy of that game for me is trying to fit things into the game engine 01:09:16 sort-of like esoprogramming 01:11:59 I think I have played it but I prefer the kind of puzzle game like Hero Hearts with all kind of new pieces added; I have figured out everything about how the game engine works, but there are some limitations and some problems, and I could some time make up a clone of it which is Free software. 01:13:52 -!- FreeFull has joined. 01:14:24 https://bitbucket.org/GregorR/nibackup // Today's lesson: If at first you don't succeed, roll, roll your own. 01:15:39 I did make a level out of nothing but solid walls, destroyable walls, abyss, and dynamite once 01:15:43 that was interesting 01:15:51 especially because there's a lot you can do with it 01:16:11 but it was broken because someone found a better solution than the intended one, which throws off the rest of the level 01:19:07 and it's not in the release version, probably partly for that reason 01:21:17 * pikhq has fallen in love with this monitor 01:22:07 aww 01:22:08 what kind? 01:22:16 Dell U2713H. 01:23:07 dell makes a damn fine monitor 01:23:13 27", 2560x1440, has quite good color fidelity. 01:23:30 Also impressive, darned thing comes from the factory with a proper calibration done. 01:24:00 Just had to flip the thing over to sRGB, and voila. 01:24:06 oh neat, I know they did that for the older U3011 01:24:16 -!- Bike has quit (Ping timeout: 240 seconds). 01:24:21 * kmc owned one of those 01:24:47 (well, it actually has larger gamut than that, but I'm not going to try doing Adobe RGB out on X11) 01:25:13 sRGB gamut is pretty small :/ 01:25:33 -!- Bike has joined. 01:25:40 Yes, but it's a royal pain getting better output from your software. 01:26:04 I'd rather display sRGB right than display sRGB samples as Adobe RGB most of the time. 01:30:41 -!- Bike has quit (Ping timeout: 240 seconds). 01:31:49 -!- Bike has joined. 01:35:46 -!- oerjan has quit (Quit: ghint). 01:48:04 -!- esowiki has joined. 01:48:09 -!- esowiki has joined. 01:48:09 -!- esowiki has joined. 01:48:15 -!- glogbot has joined. 01:48:21 -!- SirCmpwn has quit (Ping timeout: 272 seconds). 01:48:54 -!- shachaf has quit (Ping timeout: 246 seconds). 01:49:51 -!- Frooxius has quit (Quit: *bubbles away*). 01:50:33 -!- Frooxius has joined. 01:52:50 -!- FreeFull has quit. 01:53:29 -!- Gregor has quit (Ping timeout: 252 seconds). 01:53:54 -!- SirCmpwn has joined. 01:54:23 -!- tertu has joined. 01:54:34 -!- Frooxius has quit (Read error: Connection reset by peer). 01:55:04 -!- Frooxius has joined. 01:55:27 -!- Gregor has joined. 01:57:23 ooh, Gregor got libdl.so after all 01:57:40 Yeah, I had libdl.so from the beginning. 01:58:01 Just not libc.so 01:59:25 :'( 02:00:38 right 02:01:04 to be fair, I'm not convinced libc.so was worth the amount it eventually went for 02:02:07 libc.so is worth ALL the money. 02:02:16 Also, the guy who bought it won't respond to my emails :'( 02:02:51 for a moment I wondered who it was 02:03:10 and then I realised that "webmaster@libc.so" works, if there's a web server there and they're following the standard 02:03:47 hmm, although it seems that the most common address for me to receive spams at my server is support@ 02:03:51 -!- conehead has joined. 02:03:53 -!- shachaf has joined. 02:04:11 oh, there's also the one email from sudo 02:04:22 .so has a working WHOIS service. 02:04:28 the "this incident will be reported" thing is even more surreal when you subsequently get the report 02:04:46 It actually IS reported? 02:05:00 -!- Sorella has quit (Quit: It is tiem!). 02:05:01 Maybe I should check root's spool... 02:05:24 I think I set nethack4.org up so that I get root's email 02:05:28 but yeah, I was shocked 02:06:01 I didn't really expect an email to actually arrive 02:08:34 It is reported but I think there is a command-line switch to tell sudo not to report it 02:16:54 oh, that reminds me 02:17:10 I had a vaguely silly problem today, with an even sillier solution 02:17:36 the problem: I have installed a setgid executable, and suspect it has a permissions problem (my suspicion eventually turned out correct) 02:17:57 I want to debug it, but I can't debug it as user:group me because I don't have the perms, and I can't debug it as root because then it works 02:18:10 thus, I need to keep the same user, but change my group to one that I'm not a member of 02:18:24 anyone realise why the solution is silly yet? 02:21:03 -!- LinearInterpol has quit (Read error: Connection timed out). 02:21:32 OK, so the problem is, as ais523, I don't have the perms to change my group to a group I'm not in 02:21:51 -!- LinearInterpol has joined. 02:21:55 as root, I can change my group to whatever I want, but most permissions-dropping commands (such as su) also reset my group as well 02:22:08 thus, I need a command than can set my user and group simultaneously 02:22:13 and the only one I had handy was sudo 02:22:31 but, if I attempt to use sudo to change to a user other than root, it complains that I'm not allowed to do that (because it's only configured to let me become root) 02:22:40 conclusion: run sudo /using sudo/ 02:23:04 this is the first time in my life I've had a legitimate reason to start a command "sudo sudo", although ofc you can stack it effectively indefinitely if you feel like it 02:23:22 -!- ^v has quit (Remote host closed the connection). 02:24:01 although I'd disabled the sudo reports on my local computer, so instead of "THIS INCIDENT WILL BE REPORTED" it just said "Sorry" 02:25:51 -!- carado has quit (Ping timeout: 240 seconds). 02:28:49 -!- LinearInterpol has quit (Read error: Connection reset by peer). 02:29:38 -!- Bike has quit (Ping timeout: 264 seconds). 02:30:57 -!- Bike has joined. 02:33:13 -!- LinearInterpol has joined. 02:37:16 -!- carado has joined. 02:37:50 -!- ter2 has joined. 02:40:42 -!- tertu has quit (Ping timeout: 246 seconds). 02:43:51 -!- copumpkin has joined. 02:54:33 -!- copumpkin has quit (Ping timeout: 240 seconds). 02:56:47 What's a Trusted Platform Model 03:02:27 -!- copumpkin has joined. 03:03:58 model? not module? hmm. 03:04:37 oops i meant module. 03:06:33 -!- LinearInterpol has quit (Ping timeout: 240 seconds). 03:12:34 it's a piece of hardware that does cryptography, stores keys, and may verify a boot sequence. "trusted" means that while it is running on your insecure PC, entities like Microsoft or Hollywood can still trust it. Wikipedia knows a bit more. 03:13:50 Well, whoever programmed it can trust it, I suppose. If you don't have the latest version of Windows on your computer, it might not be programmed at all, and do nothing. 03:14:12 If you do, then it is belonging to Microsoft and Hollywood, and so on. 03:14:18 huh. weird. i have also found out from my PC construction odyssey that there is a possiblity of attaching a chassis opening detection wire. 03:15:14 Yes, some computers have that, and will log it in the BIOS in such a case. 03:17:26 cf. https://en.wikipedia.org/wiki/Trusted_System 03:18:08 -!- yorick has quit (Remote host closed the connection). 03:22:56 -!- copumpkin has quit (Quit: My MacBook Pro has gone to sleep. ZZZzzz…). 03:25:02 Chassis intrusion sensors are standard for servers. 03:30:24 oh dear, people on c3 doesn't know befunge 03:32:08 -!- Froox has joined. 03:33:00 -!- Frooxius has quit (Read error: Connection reset by peer). 03:37:17 -!- copumpkin has joined. 03:41:42 -!- Sprocklem has joined. 03:47:55 -!- nooodl has quit (Ping timeout: 240 seconds). 04:00:42 Linux also supports TPMs. 04:01:09 It is at least *possible* to run a system wherein you yourself are doing the verification. 04:02:22 And there is TPM emulator, too. 04:03:01 -!- ^v has joined. 04:22:56 -!- LinearInterpol has joined. 04:24:41 -!- zzo38 has quit (Ping timeout: 272 seconds). 04:30:18 -!- copumpkin has quit (Quit: My MacBook Pro has gone to sleep. ZZZzzz…). 04:38:02 -!- LinearInterpol has quit (Read error: Connection reset by peer). 04:38:26 -!- LinearInterpol has joined. 04:39:54 -!- mauke has quit (Disconnected by services). 04:40:04 -!- mauke has joined. 04:41:31 -!- preflex has quit (Ping timeout: 272 seconds). 04:41:47 -!- preflex_ has joined. 04:41:51 -!- preflex_ has changed nick to preflex. 05:05:02 -!- nisstyre has quit (Ping timeout: 264 seconds). 05:06:14 -!- LinearInterpol has quit (Ping timeout: 264 seconds). 05:17:42 -!- zzo38 has joined. 05:17:54 My internet connection stopped working for some reason, but it works now. 05:22:41 -!- Sgeo_ has joined. 05:23:44 -!- Sgeo_ has quit (Read error: Connection reset by peer). 05:24:51 -!- Sgeo_ has joined. 05:24:58 -!- Sgeo has quit (Ping timeout: 240 seconds). 05:24:59 -!- douglass_ has quit (Ping timeout: 246 seconds). 05:25:00 -!- preflex has quit (Read error: Connection reset by peer). 05:25:37 -!- conehead has quit (Quit: Computer has gone to sleep.). 05:26:27 -!- preflex has joined. 05:30:19 I don't know if it's safe to take a cab in a blizzard 05:31:12 zzo38: do you know the reason? 05:32:06 int-e: the bits most useful for orwellian hollywood nonsense are not as widely implemented 05:32:10 namely remote attestation 05:35:18 -!- douglass_ has joined. 05:40:15 kmc: No, I don't know the reason, sorry. 05:40:22 oh well 05:40:58 -!- douglass_ has quit (Ping timeout: 240 seconds). 05:46:59 ais523: postmaster@example.com is *the* standard, if the domain has a SMTP service -- and if it doesn't, you obviously can't send email at all -- this webmaster@ is just some newfangled "HTTP" nonsense. 05:47:19 fizzie: yeah, I was thinking "or you could just contact the email admin if they have email" 05:47:26 and somehow didn't realise you couldn't send an email if they didn't 05:48:06 (PSOTMASTER, HOSTMASTER, USENET, NEWS (synonym for USENET), WEBMASTER, WWW (synonym for WEBMASTER), UUCP and FTP are the mailbox names RFC2142 defines.) 05:49:23 Not exactly PSOTMASTER, obviously. 05:50:20 It also defines info@, marketing@, sales@ and support@ for "business-related mailbox names", and abuse@, noc@ and security@ for "network operations mailbox names". 05:50:32 I think zem.fi gets most spam at the "webmaster" address. 05:50:46 nethack4.org gets pretty much all its spam at support@ 05:51:04 Possibly it the webmaster address was in some autogenerated Apache page and was crawled from there. 05:51:39 I have been asked on here about Sirlin's Chess 2 before. You can read a lot of comments (including my own) on: http://www.chessvariants.org/index/listcomments.php?itemid=Chess2 05:51:44 I also get some amount of spam for "rfk86", because that was on the page. 05:51:54 (I don't think I've ever gotten a legitimate email to that address.) 05:55:01 wishmaster@example.com 05:55:18 fishmaster@example.com 05:55:32 fizzie: is that an x86 version of robotfindskitten? 05:55:45 ais523: No, it's a TI-86 version. 05:55:57 right 05:57:56 ("Hamster / a dentist / hard porn / Steven Seagull / warrior / this rifle / in me / the fishmaster," go the lyrics of Fishmaster.) 05:59:50 fizzie: are there enough of them to feed them into fungot? 05:59:50 ais523: srbt yow! i'm unemployed! 06:02:05 Not really. (There aren't that many lyrics in Wishmaster, either.) 06:02:07 If you want fungot to make less sense, you should use the original lyrics 06:02:07 Jafet: because it's cool, isn't it? 06:02:17 Though it would be possible to make a song lyrics style, I guess. 06:02:43 -!- douglass1 has joined. 06:02:44 Despite the various chess variants (even Chess 2), even ordinary FIDE chess is a fine playable game. But so can others be! 06:03:11 I actually have somewhere a language model for song lyrics I got from Tampere University of Technology folks. Plus something I trained on a smallish-but-available database. 06:03:43 Chess: still playable 06:03:53 ^style lavigne 06:03:53 Not found. 06:03:54 `addquote Despite the various chess variants (even Chess 2), even ordinary FIDE chess is a fine playable game. But so can others be! 06:03:58 1155) Despite the various chess variants (even Chess 2), even ordinary FIDE chess is a fine playable game. But so can others be! 06:04:23 (Song lyric databases generally don't provide download options, presumably for copyright reasons. From what I recall, LyricWiki doesn't either. (Does any Wikia wiki, really?)) 06:04:36 wget 06:04:40 Chess variants are still very interesting though, so you can play those games too, please. 06:05:09 Wikia being evil doesn't help 06:05:24 Jafet: They're also all so horrible website-wise, I don't really want to crawl them. (Though I guess e.g. the mldb.org interface is not all that bad.) 06:06:30 Some music players implement this lyrics-grabbing protocol 06:07:17 However, my TeX chess program doesn't currently implement some of the features needed for Chess 2, but hopefully that can be fixed. 06:07:41 Well, by that I mean rhythmbox has this plugin that grabs lyrics from some unspecified online service 06:07:50 I don't think MusicBrainz does lyrics, sadly. 06:08:59 -!- douglass1 has quit (Ping timeout: 240 seconds). 06:10:16 LyricWiki has a SOAP/REST API, but "due to licensing restrictions, the API can only directly return a small portion of the lyrics directly - which is useful for determining if you have a correct match. All responses also contain a URL to a corresponding page with the full lyrics." 06:10:58 (It used to return the full lyrics, but they had to change that.) 06:11:10 "We can't get a license to distribute lyrics for free via an API, however we do have a license to display lyrics on a web-page as long as the web-page has javascript enabled so that we can track which songs are being viewed (for distributing royalties) and have an ad on them so that a percentage of the money can be paid as licensing fees." 06:12:28 "Have you ever wanted to run a lyric website or a lyrics app for a mobile device but wondered where you could get good quality lyric data from? Congratulations you have found one of the largest databases of lyrics available on the web! This database is in MySQL format and contains half a million songs that you can use on your own lyric site." For only $24.99! 06:12:40 Strange stuff. 06:13:13 "This is a brand new lyric database collated from a number of sources." Somehow I am not really sure all those sources make their stuff available for free for commercial use. 06:14:08 (What is a ᵀᴇˣ chess program?) 06:16:39 wow! unicode ᵀᴇˣ 06:16:52 Jafet++ 06:17:03 I have some CSS to do it but I hadn't seen it in "plain text" before 06:18:04 speaking of MySQL, https://twitter.com/alex_gaynor/status/418892674309967872 06:33:48 Can you build MySQL on musl? 06:33:50 (Just wondering.) 06:34:39 MuSQL 06:35:55 Something called "µSQL" probably exists. 06:36:09 Nigh-SQL 06:43:05 TeX chess program is a program to read algebraic chess notation and generate diagrams from them, as well as to format the moves, and to play many chess variants, too. 06:47:56 I don't know what SQL programs you prefer but I use SQLite 06:53:51 kmc: i'm on my phone. what are the unicode chars in front of chess above? 06:54:27 "tex" but with the heightshit 06:55:31 zzo38: oh you are adding Chess 2 to TeX chess? 06:56:04 are there any other chess variants with the bidding mechanic? 07:01:11 -!- ^v has quit (Quit: http://i.imgur.com/MHuW96t.gif). 07:02:24 -!- apott has joined. 07:02:38 Hello. 07:02:43 -!- apott has quit (Client Quit). 07:02:43 hi 07:02:52 I said hi before they left this time! 07:03:00 not on my screen! 07:05:08 I thought that might be the problem :-( 07:05:22 good effort though 07:07:27 https://dl.dropboxusercontent.com/u/19940612/Jackals2.jpg 07:07:30 All the jackals 07:07:38 I should take more jackal pix 07:08:03 The holidays went away too quickly 07:08:22 Between the family christmas and new year with friends, I barely had any time to do shit 07:11:03 -!- ter2 has quit (Read error: Connection reset by peer). 07:11:14 shachaf: http://xkcd.com/1312/ 07:11:29 -!- ter2 has joined. 07:11:44 `unidecode ᵀᴇˣ -- quintopia 07:11:45 ​[U+1D40 MODIFIER LETTER CAPITAL T] [U+1D07 LATIN LETTER SMALL CAPITAL E] [U+02E3 MODIFIER LETTER SMALL X] [U+0020 SPACE] [U+002D HYPHEN-MINUS] [U+002D HYPHEN-MINUS] [U+0020 SPACE] [U+0071 LATIN SMALL LETTER Q] [U+0075 LATIN SMALL LETTER U] [U+0069 LATIN SMALL LETTER I] [U+006E LATIN SMALL LETTER N] [U+0074 LATIN SMALL LETTER T] [U+006F LATIN SMA 07:11:51 -!- ter2 has quit (Read error: Connection reset by peer). 07:12:03 lol 07:12:36 "aatin smtal letter q" 07:13:11 quintopia: I don't know, but there are others involving hidden information in various ways. 07:13:45 zzo38: do you play regular normal deck card games? 07:14:41 quintopia: Yes, I do play that too. 07:14:53 zzo38: do you like "bullshit" 07:15:01 I know several card games using the standard 52-card deck or some subset. 07:15:32 Any good at Canasta? 07:15:40 Is that the game also known as "I Doubt It"? I do know how to play, and a few variants. I don't play often though. 07:15:59 ... 07:16:00 I know how to play Canasta too, but I don't play much; I don't think I am particularly good at it. 07:16:00 Woops 07:16:04 Wrong window 07:18:43 zzo38: i had an idea for a variant, but maybe it exists. the idea would be to deal some of the cards to no player face down, and let people optionally draw and discard at turn start, also optionally discard and draw 1/4 of the cards they pick up as penalties. 07:19:03 That is an idea, at least. 07:19:04 plus there's two decks with 4 wild jokers 07:19:15 so it's hard to keep track of who could have what 07:19:16 Slereah: why does your flat have a Big Red Button next to the door 07:19:22 @localtime Slereah 07:19:23 Local time for Slereah is Fri Jan 03 08:19:17 2014 07:19:43 I get that question a lot 07:20:09 Sirlin also invented the game Pandante (not yet for sale, although you can download the rules and perhaps make up your own), which is like poker but involving lying; you can accuse another player of lying, similar to how you can in I Doubt It. 07:20:15 * kmc tries to identify the country from the Europlug grounding variant in use 07:20:39 zzo38: poker involves a lot of lying too, isn't it? 07:20:51 kmc: it's bluffing, not lying 07:21:01 because nothing you say that has a game effect has a truth value 07:21:11 bluffing's when you bet a large amount despite having a bad hand 07:21:19 in the hope that other people will think you have a good hand and not take the bet 07:21:23 you can also just say you have a good hand 07:21:26 but i guess people don't 07:21:30 because it would be silly 07:21:59 "is betting a speech act" 07:22:11 perhaps after Citizens United 07:22:44 Yes, it is bluffing, not lying; it is different in that way. 07:23:14 In Pandante, if you claim to have a flush, and then nobody accuses you of lying, then it counts as a flush regardless of what cards you actually hold. 07:23:43 oh, cool 07:24:20 Slereah: do you have an answer to that question a lot, too? 07:25:08 also that is impressively many jackals 07:25:19 do you have a copy of The Day of the Jackal too 07:25:35 where does that book keep coming from 07:25:52 "You need a Day of the Jackal-type motherfucker, basically, to do some shit like that." 07:28:04 :| 07:28:06 where's thath quote from 07:29:23 The Wire 07:29:35 nice 07:30:22 niba rkcynvavat jul fyvz puneyrf vfa'g hc gb gur gnfx bs nffnffvangvat fgngr frangbe pynl qnivf 07:30:31 (spoilers) 07:31:04 :o 07:35:30 http://www.theverge.com/2014/1/2/5266258/kanye-west-themed-bitcoin-clone-said-to-launch-this-month-coinye 07:36:35 why are people linking that story 07:36:40 it isn't even interesting 07:36:44 it's absurd 07:41:55 http://coinmarketcap.com/ -__- 07:42:04 Sexcoin, Deutsche eMark, FedoraCoin, HoboNickels 07:42:40 can we be done with the internet now 07:43:09 i wonder how it feels to develop a cryptocurrency which is subsequently behind dogecoin 07:43:20 such shame, very failure 07:44:13 oh jesus "asiccoin" uses that shitty anarchy logo 07:46:28 Welcome to the international hub for esoteric currency design and deployment! 07:46:57 hey, that could actually be fun. what makes a currency esoteric? not in the "nobody uses it" sense, of course. 07:47:13 weird proof of work function based on an esolang? 07:47:15 changing values rapidly is too pedestrian... 07:47:32 also bitcoin already contains a mini language for describing transactions 07:47:36 could just make that more eso 07:48:06 actually, I had a bitcoin-related eso idea 07:48:17 which is to encode a non-bitcoin currency into the bitcoin blockchain 07:48:58 like, rule that only transactions less than 1mBTC count, and only if they have an even floating-point exponent (so you can easily split a transaction in two to toggle whether it counts) 07:57:07 The rule in Sirlin's Chess 2 where a defender bidding against an attacker with zero stones must bid one seems useless to me. He wouldn't ever *want* to bid any other amount. Ties go to the attacker, having stones isn't a disadvantage, turns aren't lost due to dueling, if 0-0 the attacker can make the defender lose a stone, and nothing changes! 08:06:10 zzo38: it isn't really a rule, just a pointing out of a consequence 08:06:50 it makes it easier to implement in software to have it explicitly stated like that 08:06:53 in tournament backgammon you can't use the doubling cube at 5-6 08:07:03 because otherwise the player on 5 always would 08:08:49 quintopia: Yes, it can be done automatically in a computer program. 08:09:20 zzo38: and is, in fact 08:11:29 ais523: You are correct about that, and I think that is called Crawford rule. Such rule can be used in other games too if you are including a doubling cube rule (I thought of using it in Pokemon, even). 08:12:29 -!- ais523 has quit. 08:30:31 Another variant of doubling cube, which I do not see mentioned in the article about backgammon (probably because it doesn't apply to backgammon, in which ties and draws aren't possible), would be in case of a tie or draw, the stakes are doubled (rather than reset), and then the cube is centered again. Such a rule can be used with or without the offering doubling cube. 08:41:13 I think the first time someone shown me how to play backgammon game, it was Turkish backgammon, although she didn't call it that, and she isn't Turkish anyways. 08:42:14 -!- Sprocklem has quit (Ping timeout: 264 seconds). 08:51:43 -!- Phantom__Hoover has joined. 08:53:49 -!- tromp_ has quit (Read error: Connection reset by peer). 08:56:24 -!- Phantom__Hoover has quit (Ping timeout: 240 seconds). 09:10:10 -!- impomatic has left. 09:22:44 -!- Phantom__Hoover has joined. 09:39:14 -!- carado has quit (Ping timeout: 264 seconds). 09:46:24 -!- copumpkin has joined. 10:35:18 -!- copumpkin has quit (Ping timeout: 246 seconds). 10:41:51 -!- copumpkin has joined. 10:43:23 -!- oklopol has quit (Ping timeout: 265 seconds). 10:47:33 http://xkcd.com/1312/ 10:47:37 yeah, right. 10:55:07 -!- copumpkin has quit (Ping timeout: 240 seconds). 11:05:14 -!- copumpkin has joined. 11:05:58 -!- MindlessDrone has joined. 11:11:49 -!- oklopol has joined. 11:13:36 -!- Sorella has joined. 11:26:36 -!- copumpkin has quit (Quit: My MacBook Pro has gone to sleep. ZZZzzz…). 11:49:15 -!- tromp_ has joined. 12:17:44 -!- oerjan has joined. 12:20:53 ``Why knock Haskell for being lazy? That was uncalled for! '' 12:20:54 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: `Why: not found 12:21:02 oh, right 12:28:05 http://me.veekun.com/blog/2013/01/09/cvs-and-file-extensions/ 12:30:38 -!- Sorella has quit (Quit: It is tiem!). 12:31:57 -!- Sorella has joined. 12:32:18 -!- yorick has joined. 12:45:03 Huh; first time I've seen a freenode channel on the wall in an art museum. https://dl.dropboxusercontent.com/u/113389132/Misc/20140103-irc1.jpg https://dl.dropboxusercontent.com/u/113389132/Misc/20140103-irc2.jpg 12:47:19 I saw something like that at the Science Museum in London 12:49:09 I've been in some sort of "science museum" in London once, wonder if it was the same place. 12:49:15 That was back in 2001 or so, though. 12:49:54 There might've been IRC-based chats elsewhere, but I don't recall seeing anything in freenode. 12:50:41 nortti: darn i assumed that was CVS 12:50:43 There's the Natural History museum, which is the big one 12:50:54 And then there's the Science Museum, which is smaller and right next door 12:57:33 I think this was in the general neighbourhood of Hyde Park. 12:57:58 I guess it's that Science Museum / Natural History Museum complex, then. 12:58:14 I recall it wasn't very big. 12:59:17 May have been the Science Museum 12:59:26 Natural History museum is muuuuuuuuch bigger 12:59:44 And the British museum (history and anthropology, iirc) is MUUUUUUUUCH bigger 12:59:54 We went there, too. 12:59:57 (It was big.) 13:00:09 Also it's kind of a de-facto standard stop, I guess. 13:00:24 In the science museum you went to, was there a blue whale attached to the ceiling 13:02:03 I can't remember, and I can't locate any photos either. (Maybe it was a pre-ubiquitous-digital-cameras thing.) 13:03:01 I'm sure the exhibitions have changed somewhat in the last decade or so. 13:03:14 fizzie: where exactly is the ##2048 displayed? 13:03:33 nortti: It's in Kiasma, there's an exhibition about Erkki Kurenniemi. 13:03:41 ah 13:04:24 I haven't seen anything especially interesting on-channel, just that bot stating out which track is playing on the radio. 13:04:53 The radio being the one at http://kurenniemi.activearchives.org/dataradio/ 13:05:05 I guess the chat sidebar there is what's connected to the channel. 13:05:29 -!- FreeFull has joined. 13:06:33 Built on Kiwi IRC, I see. 13:10:28 -!- FreeFull has quit (Read error: Operation timed out). 13:16:23 Also from the exhibition: there was a room with a dozen or so monitors displaying movies; each was driven by a Raspberry Pi: https://dl.dropboxusercontent.com/u/113389132/Misc/20140103-pi1.jpg https://dl.dropboxusercontent.com/u/113389132/Misc/20140103-pi2.jpg 13:16:31 Turns out they're not useless after all! 13:23:35 Finally, there was a robotic head-on-wheels that had a speech synthesizer that wandered around and randomly said "rauhaa, rauhaa, joulu on jo ovella" and "jumalauta, mulla on outo olo", plus "voi ihmisen pieru" on bumping into anything. (If you can't tell, it's a modern art museum.) 13:25:12 `unidecode ᵀᴇˣ 13:25:14 ​[U+1D40 MODIFIER LETTER CAPITAL T] [U+1D07 LATIN LETTER SMALL CAPITAL E] [U+02E3 MODIFIER LETTER SMALL X] 13:27:10 I'm guessing that should really be a MODIFIER LETTER CAPITAL X, except it doesn't exist. 13:27:37 i was guessing so too 13:27:41 Or perhaps even more optimally just regular T and X, and some kind of dropped E. 13:51:12 http://rationalwiki.org/w/images/d/de/ChickCthulhu.gif 13:51:29 `addquote i wonder how it feels to develop a cryptocurrency which is subsequently behind dogecoin such shame, very failure 13:51:34 1156) i wonder how it feels to develop a cryptocurrency which is subsequently behind dogecoin such shame, very failure 13:52:38 LᴬTᴇX 13:55:17 The baseline of the small capital E is kind of wrong. 13:56:22 I get to work from home today 13:56:34 I get to not work from home today 13:58:50 -!- Sgeo_ has quit (Read error: Connection reset by peer). 13:58:58 I get to not work today. 13:59:05 (More permutations?) 13:59:18 Perhaps someone gets home today. 13:59:23 -!- boily has joined. 13:59:36 -!- metasepia has joined. 13:59:46 I get not home on Sunday 14:00:03 good piñata tractor beam morning! 14:00:18 Taneb: I get partially home on Sunday. 14:00:37 Man, I'm looking forward to Sunday 14:01:03 York was the first place I've lived that wasn't Hexham this side of 2000 14:01:10 * oerjan is starting to wonder where boily's mornings are coming from, anyway. 14:01:53 maybe from the same place as nortti's link. 14:05:18 `danddreclist 48 14:05:19 danddreclist 48: shachaf nooodl boily \ http://zzo38computer.org/dnd/recording/level20.tex 14:05:49 oerjan: we were playing Ghost Stories yesterday night and discussing some strategies. 14:06:41 zzo38: ! I can't find file `dungeonsrecording'. 14:06:55 boily: Download it from the same directory. 14:07:01 nortti: you have nice links. 14:08:12 A precompiled DVI is also available, in case you want to use that (no unusual fonts are needed). 14:08:43 good points: you specify the number of eyes. 14:08:48 bad points: no unusual fonts. 14:09:08 That's because I have had no use for any unusual fonts (yet). 14:09:37 In my first D&D session, my character ended up with a magical tattoo on his chest 14:09:46 Taneb: What kind of magical tattoo? 14:09:59 zzo38, it's an eye, and I can't tell you more than that yet 14:10:03 Because I don't know more than that 14:10:06 Ah, OK 14:10:22 But there's a nasty crow lady after me because of it 14:13:03 -!- AnotherTest has joined. 14:24:20 oerjan: I doubt it, because that is from my todo list 14:24:26 *was 14:33:18 -!- LinearInterpol has joined. 14:43:23 -!- Phantom_Hoover has joined. 14:45:34 -!- Phantom__Hoover has quit (Ping timeout: 240 seconds). 14:47:05 -!- nooodl has joined. 14:49:40 http://me.veekun.com/blog/2013/03/03/the-controller-pattern-is-awful-and-other-oo-heresy/ 15:00:03 -!- tertu has joined. 15:00:38 I say, all patterns are evil. 15:00:54 all language is patterns 15:00:55 -!- tertu has quit (Read error: Connection reset by peer). 15:01:18 -!- tertu has joined. 15:01:40 clearly both boily and mauke are correct. 15:07:30 -!- carado has joined. 15:15:50 -!- conehead has joined. 15:16:41 -!- LinearInterpol has quit (Read error: Connection timed out). 15:17:45 -!- LinearInterpol has joined. 15:25:58 -!- glogbackup has quit (Read error: Connection reset by peer). 15:54:26 http://science.slashdot.org/story/14/01/02/2247214/dogs-defecate-in-alignment-with-earths-magnetic-field 15:55:26 -!- Guest65919 has changed nick to _46bit_. 15:56:04 -!- oerjan has quit (Quit: i bet that's a shitty article). 15:56:19 @tell oerjan *mapole smack* 15:56:19 Consider it noted. 16:03:14 -!- glogbackup has quit (Ping timeout: 252 seconds). 16:07:44 -!- ter2 has joined. 16:07:47 -!- tertu has quit (Ping timeout: 272 seconds). 16:12:32 http://serverfault.com/questions/293217/our-security-auditor-is-an-idiot-how-do-i-give-him-the-information-he-wants this is comedy gold 16:18:43 uhm. plaintext passwords, private SSH keys, everything in the hands of a bozo? 16:22:46 doesn't look any better 16:33:35 I'm not sure which scares me more ... the idea of handing all that information to somebody calling themselves security auditor, or the apparently genuine interest in complying with such a request. 16:35:47 ^ 16:36:55 ↑ 16:37:23 damnit boily, topping me. 16:37:30 ☝ 16:38:28 -!- pikhq has quit (Ping timeout: 246 seconds). 16:39:05 LinearInterpol: try CtrlR-Shift-U. 16:39:29 lol. 16:40:23 ⇑⤊⟰ 16:40:28 -!- pikhq has joined. 16:40:57 ⌃ 16:41:49 ⇈⇡⇧⬆↑ 16:42:07 mauke is a Master Archer, with all kinds of tricky arrows. 16:42:11 `? mauke 16:42:13 mauke? ¯\(°​_o)/¯ 16:42:16 http://mauke.hopto.org/stuff/javascript/unicode.html?q=up 16:42:37 `learn mauke is a Master Archer. Caution! He can shoot your PRIVMSG with creative arrows! 16:42:41 I knew that. 16:51:24 Is there an option for ghc to just produce strict code? 16:57:56 -!- conehead has quit (Quit: Computer has gone to sleep.). 17:02:23 -!- yorick has quit (Remote host closed the connection). 17:08:20 🔶 17:20:52 -!- LinearInterpol has changed nick to [li]|AoS. 17:31:37 -!- FreeFull has joined. 17:39:20 #define shortjmp return 17:39:34 huh. 17:41:02 huh? 17:41:09 nabokoS was nasty ... of course the required number of pushes is optimal and the "hard" version has a unique solution up to symmetry. 17:41:19 I wouldn't call 'return' a jump. 17:41:48 then what is longjmp? 17:41:51 though I guess "longjump" isn't much of a jump either. 17:42:03 also, it's obviously a jmp, not a jump 17:42:16 "no u" 17:42:30 int-e: you speak like fungot. 17:42:30 boily: you don't know a lot of it can be ( make-circle-str 250 ' blue) 17:42:33 no "u". I'm not using it very often. 17:43:10 The fun got me. 17:43:15 int-e is the new incarnation of fungot! zzo38 is an impostor! 17:43:16 boily: such as fnord' rather than fnord data, maybe specify it in a minute i'll see whether i need inheritance or not in css) " give me the message now. 17:43:29 * boily thwacks int-e because of the bad pun. 17:44:13 boily: "nabokoS" is ais523's enigma level that asks you to build a sokoban level. 17:44:43 * boily is conflagratedly puzzled... 17:46:48 And I call it "nasty" because I had to write a computer program in order to solve it. 17:47:22 can I get a link to the enigmais523? 17:47:57 http://www.nongnu.org/enigma/ 17:49:12 `? ais523 17:49:14 Agent “Iä” Smith is an alien with a strange allergy to avian body covering, which he is trying to retroactively prevent from ever evolving. On the 3rd of March, he's lawful good. 17:49:24 There is one level in there called "Nabokos", which was created by ais523. 17:56:14 kmc: ? 17:59:59 wait, ais523 made nabokos? 18:01:14 i like enigma quite a bit and especially that one 18:14:38 -!- [li]|AoS has changed nick to LinearInterpol. 18:31:06 hichaf 18:31:38 shachaf: i sent you the xkcd link in the same spirit as you pasting me terrible things from #haskell 18:31:52 -!- ^v has joined. 18:32:17 enigma huh. 18:32:28 -!- ter2 has quit (Ping timeout: 272 seconds). 18:32:29 I have never played Enigma. 18:33:53 think I'll give it a shot. 18:37:05 kmc: ah 18:37:53 -!- glogbackup has quit (Ping timeout: 272 seconds). 18:39:18 -!- tertu has joined. 18:43:35 -!- tertu has quit (Read error: Connection reset by peer). 18:43:52 -!- tertu has joined. 18:44:16 meh, but Enigma is a lousy interface for Sokoban levels. 18:46:20 -!- tertu has quit (Read error: Connection reset by peer). 18:54:43 -!- impomatic has quit (Ping timeout: 260 seconds). 18:58:27 kmc: did you see http://www.pvk.ca/Blog/2012/07/30/binary-search-is-a-pathological-case-for-caches/ 19:00:01 -!- FreeFull has quit (Read error: Connection reset by peer). 19:02:15 «#define BARRIER do { __asm__ volatile("" ::: "memory"); } while (0)» ah yes 19:03:52 gcc has builtins for that 19:03:54 "I’ve seen horrible implementations of tr1::hash for unsigned values in (it’s the identity function on my mac)" heh 19:05:20 shachaf: no 19:07:01 at least it's collision free 19:16:01 -!- douglass_ has joined. 19:18:17 http://games.moria.org.uk/kye/ 19:20:56 LinearInterpol: i played the heck out of that as a kid 19:21:04 same. 19:21:46 Hey, that looks pretty familiar. 19:22:55 -!- FreeFull has joined. 19:36:29 -!- olsner has joined. 19:37:11 http://www.youtube.com/watch?v=x5xV6R4hn0c 19:37:22 i'm so confused right now what is happening to my brain. 19:40:15 this thing uglifies in my eyeballs. 19:44:23 hmm, burritos... is it about monads? 19:46:29 it's a traversal. (Burrito m, Taquito t) => forall a. m t a -> t m a. 19:48:57 apparently, there is such a thing as taco de ojo → http://www.burritoeater.com/tacodeojo.html 19:50:19 eye taco? 19:51:26 -!- carado has quit (Ping timeout: 240 seconds). 19:52:02 olsner: eye taco. even I am weirdede. 19:52:18 s.e\..\.. 19:53:42 -!- luce90 has joined. 19:54:58 `relcome luce90 19:55:01 ​luce90: 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.) 19:55:15 -!- luce90 has left. 19:55:37 another visitor scared away. *sigh* 19:55:46 also, anybody here who speaks Italian? 19:56:04 I'm afraid not me. 19:56:19 I only know "ciao a tutti" and "!list" 19:56:45 mauke++ 19:56:59 @karma mauke 19:56:59 mauke has a karma of 35 19:57:02 wooooooah... 19:57:07 preflex: karma 19:57:07 mauke: 1116 19:57:30 preflex: karma 19:57:30 boily has no karma 20:00:03 * boily mapoles preflex 20:00:07 preflex: kmc 20:00:10 preflex: karma 20:00:10 boily has no karma 20:00:17 kmc: sorry for autotabbing you. 20:00:38 -!- nisstyre has joined. 20:00:47 preflex: karma chameleon 20:00:47 chameleon: 6 20:03:09 @karma 20:03:09 You have a karma of 13 20:03:40 http://lists.cairographics.org/archives/cairo/2013-December/024858.html 20:09:40 nice, I've always wanted C++ to be even bigger 20:10:02 someday, C++ will be big enough to encompass Haskell! 20:17:44 -!- Bike has quit (Ping timeout: 240 seconds). 20:20:44 A 2D drawing library? 20:20:48 You have to be joking. 20:48:29 what 20:48:33 @karma 20:48:33 You have a karma of 0 20:48:36 yay 20:54:36 @karma 20:54:37 You have a karma of 1 20:55:17 @karmageddon 20:55:17 Unknown command, try @list 20:55:21 @karma geddon 20:55:21 geddon has a karma of 0 20:55:59 @karma ggedon 20:56:00 ggedon has a karma of 0 20:56:05 @karma list 20:56:05 list has a karma of 0 20:56:10 @karma 20:56:10 You have a karma of 0 20:56:13 fuck you. 20:56:17 LinearInterpol++ 20:56:18 LinearInterpol++ 20:56:20 LinearInterpol++ 20:56:22 LinearInterpol++ 20:56:24 LinearInterpol++ 20:56:25 @karma 20:56:26 You have a karma of 5 20:56:26 there, that should do it. 20:56:31 haha, thanks boily :D 20:56:47 (karma chameleon)++ 20:56:52 preflex: karma karma chameleon 20:56:52 karma chameleon: 2 20:56:58 boily++ boily++ boily++ boily++ boily++ boily++ boily++ 20:57:02 @karma boily 20:57:02 boily has a karma of 8 20:57:19 @karma 1337 20:57:20 1337 has a karma of 0 20:57:33 @karma boily 20:57:33 boily has a karma of 44 20:57:36 KD 20:57:41 @karma boily 20:57:42 boily has a karma of 80 20:58:04 Huh, the first Carmageddon game looks a lot clunkier than what I remembered. 20:58:34 preflex: karma boily 20:58:34 boily: 7 20:59:17 ha 20:59:29 now i have lower karma than all of you! 20:59:54 preflex: karma quintopia 20:59:54 quintopia has no karma 21:00:00 quintopia++ 21:00:04 quintopia++++ 21:00:10 preflex: karma quintopia++ 21:00:10 quintopia++: 1 21:00:10 preflex: karma quintopia 21:00:11 quintopia: 2 21:00:20 ¬_¬'... 21:00:39 noooooo 21:00:41 preflex: karma boily 21:00:41 boily: 7 21:00:42 preflex: karma 21:00:42 kmc: 98 21:00:49 \o/ 21:00:55 boily++ 21:00:57 boily++ 21:00:58 boily++ 21:01:05 i'll never catch you! 21:01:14 LinearInterpol++ 21:01:15 LinearInterpol++ 21:01:16 LinearInterpol++ 21:01:40 * quintopia hides from the impending karma war of doom 21:02:34 quintopia++ LinearInterpol++ kmc++ mauke++ quintopia++ 21:02:36 quintopia++ LinearInterpol++ kmc++ mauke++ quintopia++ 21:02:38 quintopia++ LinearInterpol++ kmc++ mauke++ quintopia++ 21:02:40 quintopia++ LinearInterpol++ kmc++ mauke++ quintopia++ 21:02:42 quintopia++ LinearInterpol++ kmc++ mauke++ quintopia++ 21:02:44 quintopia++ LinearInterpol++ kmc++ mauke++ quintopia++ 21:02:46 quintopia++ LinearInterpol++ kmc++ mauke++ quintopia++ 21:02:48 quintopia++ LinearInterpol++ kmc++ mauke++ quintopia++ 21:02:49 noooooooooooooooooo 21:02:50 quintopia++ LinearInterpol++ kmc++ mauke++ quintopia++ 21:02:52 quintopia++ LinearInterpol++ kmc++ mauke++ quintopia++ 21:02:53 boily-- 21:02:54 quintopia++ LinearInterpol++ kmc++ mauke++ quintopia++ 21:02:56 quintopia++ LinearInterpol++ kmc++ mauke++ quintopia++ 21:02:58 (yes, I know, something something flood something...) 21:03:00 mauke** 21:03:07 boily++ boily++ boily++ 21:03:09 boilyಠ_ಠ 21:03:09 boily++ boily++ boily++ 21:03:09 ¯|¯⌠ 21:03:09 /< | 21:03:10 boily++ boily++ boily++ 21:03:10 LinearInterpol÷÷ 21:03:11 boily++ boily++ boily++ 21:03:12 boily++ boily++ boily++ 21:03:14 boily++ boily++ boily++ 21:03:17 boily++ boily++ boily++ 21:03:19 boily++ boily++ boily++ 21:03:22 boily++ boily++ boily++ 21:03:26 ... 21:03:36 FireFly// 21:03:42 okay flood over 21:03:52 full-width solidus? 21:04:09 why not? 21:04:11 `unidecode / 21:04:12 ​[U+FF0F FULLWIDTH SOLIDUS] 21:04:16 I dunno 21:04:26 `unicode HEAVY BLACK HEART 21:04:28 ​❤ 21:04:33 `unicode ORANGE BOOK 21:04:35 Unknown character. 21:04:36 `unicode HEAVY BLACK METAL 21:04:38 Unknown character. 21:04:49 `unicode KANGXI RADICAL FIGHT 21:04:50 ​⾾ 21:04:54 `unicode RED APPLE 21:04:56 Unknown character. 21:05:02 Huh. 21:05:14 ORANGE BOOK is a real legit unicode char. 21:05:17 http://mauke.hopto.org/stuff/javascript/unicode.html?q=red+apple 21:06:07 «bin torieux.» red apple too is a Real Unicode Far Away in the SMP Character. 21:06:20 what about red lobster 21:06:22 There's also a GREEN APPLE 21:06:58 The reference pictures on file-formats.info show them in different greyscale shades 21:09:59 :D 21:10:02 @karma 21:10:02 You have a karma of 20 21:10:16 preflex: karma 21:10:17 LinearInterpol: 20 21:10:19 `unicode CLOCKWISE RIGHTWARDS AND LEFTWARDS OPEN CIRCLE ARROWS WITH CIRCLED ONE OVERLAY 21:10:20 Unknown character. 21:10:23 @karma boily 21:10:23 boily has a karma of 109 21:15:50 `unicode GLYPH FOR ISOLATE ARABIC HAMZAH UNDER LIGATURE LAM ALEF 21:15:52 Unknown character. 21:16:27 There's both an old Unicode database and an inability to handle non-BMP characters in the Python of HackEgo. 21:17:33 Oh, apparently that is an old name 21:17:42 `unicode ARABIC LIGATURE LAM WITH ALEF WITH HAMZA BELOW ISOLATED FORM 21:17:44 ​ﻹ 21:22:28 -!- Phantom_Hoover has quit (Read error: Connection reset by peer). 21:34:31 Strange Enigma thing: when playing, xscreensaver does not think there is any mouse movement, and therefore activates after the usual delay. 21:35:06 kmc: <#haskell on that comic> If you can't laugh at it, you need to reevaluate the place that technological choices have in your life. 21:37:35 i can't laugh at it because it's not funny 21:37:42 -!- carado has joined. 21:37:46 which comic? 21:38:09 olsner: today's xkcd. 21:38:21 <`^_^v> neither is any other xkcd 21:38:28 <`^_^v> this one just has more butthurt haskellers 21:38:53 it's a p. irritating attitude imo 21:39:14 if i yell "haskell sucks!" and you don't laugh at my funny joke then you are too emotionally attached to haskell 21:39:24 clearly 21:39:44 <`^_^v> not exactly, but if you take offense to it you are too emotionally attached to haskell 21:40:01 I don't laugh at that joke. Haskell programmers don't laugh, as emotion is a side-effect. 21:40:29 `^_^v: accusing people of 'taking offense' when they're expressing some other emotion is common and obnoxious 21:40:30 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: ^_^v:: not found 21:40:58 <`^_^v> who did i accuse? 21:41:09 `^_^v: me 21:41:10 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: ^_^v:: not found 21:41:17 <`^_^v> stop executing me bro 21:41:28 get a nick that doesn't suck 21:41:28 `^_^v: I didn't accuse you of accusing anyone! 21:41:45 -!- ChanServ has set channel mode: +o elliott. 21:41:55 -!- elliott has kicked `^_^v my patience for you has expired. 21:41:58 -!- elliott has set channel mode: -o elliott. 21:41:58 nice 21:42:12 I am offended at people suggesting I take offense at people suggesting I accuse offensers who offense people by taking offense at suggesting offenses are what offense people taking offense at. 21:42:32 boily: that's offensive! 21:42:39 sigh 21:43:24 Anyone know where I can buy typewriter ribbon? 21:43:45 office supply store 21:43:48 seriously 21:43:50 it's a pretty weird xkcd given that iirc xkcd.com has used haskell internally several times 21:44:08 but I'm glad I'm not in #haskell right now! 21:44:11 it's a really old and tired joke 21:44:17 I think it's pandering to its audience 21:44:26 also based on a false strawman claim about haskell 21:44:40 I'm pretty sure xkcd is just catering to the lowest common denominator half the time at this point 21:44:42 elliott: as a friend I'm also glad you aren't in #haskell 21:44:47 all the cheap gag strips feel like that now 21:44:59 which, whatever, it helps the guy sell shirts and he does cool stuff on the side 21:45:04 I am in #haskell but like Phantom_Hoover knows I blot out things that annoy me 21:45:13 hm why am i in #haskell 21:45:24 I would wager good money that this strip sat in some rejects pile for a long time and he just couldn't come up with anything better today so was like fuck it. 21:45:32 I doubt that 21:45:36 xkcd is heavily queued, IIRC 21:46:43 I've mostly stopped complaining about xkcd because I think its reputation has fallen enough that it's not so bizarrely overrated anymore 21:47:42 we should talk about typewriter ribbon or something instead of xkcd. 21:48:14 ribbons are good. my girlfriend has some nice ones. 21:48:33 I wonder if the on-campus store at York stocks them 21:51:32 shachaf: you should leave #haskell 21:51:55 Some dot matrix printer ribbons are getting hard to find. 21:52:43 -!- ^v has quit (Remote host closed the connection). 21:53:14 -!- FreeFull has quit (Ping timeout: 272 seconds). 21:53:33 dot matrix printers are still common though 21:53:35 fizzie: dot-matrix printers use ribbons? 21:53:39 but maybe particular ones aren't 21:53:51 also maybe I mean "dot matrix printers were still common in 2003"... time makes fools of us all 21:53:54 boily: Some do, at least. 21:54:25 boily: http://www.amazon.com/Epson-ERC-30-34-38-Pack/dp/B00280C35A stuff like that. 21:54:35 Or http://www.amazon.com/Epson-Premium-Compatible-Black-Pack/dp/B002DN6YA2/ref=sr_1_3?s=pc&ie=UTF8&qid=1388786039&sr=1-3 in two colors! 21:55:03 And yes, it's the non-popular models that are harder. 21:56:21 I had (maybe it's still in the basement) a Hyundai (I think) brand dot matrix printer that wasn't ribbon-compatible with anything major, and even 5-10 years ago when I was looking, a big office supply company managed to locate just three cartridges in some musty old warehouse. 21:57:29 Actually I think it was a lot like this http://www.ebay.co.uk/itm/Wide-Carriage-Dot-Matrix-printer-Hyundai-HDP-920-/251274316551 one, but perhaps not quite that one model. 21:57:52 "Hyundai HDP920 Compatible High Density Re-Inking Nylon Cassette Printer Ribbon" "This Item has now been Discontinued and is no Longer Available to Order" 21:59:11 http://ru.pc-history.com/wp-content/uploads/prn_hyundahdp-920.JPG yes that is amazingly close to what it looked/looks like. 21:59:20 sometimes, one happens to have an old incompatypewriter lying around. something that hasn't happened to me yet, but I fear will be bestowed upon me by an unknown stranger in a trenchcoat on Ste-Catherine. 21:59:44 I wonder where my typewriter is, also. 22:00:00 I wrote things with it when at the summer cottage. 22:00:08 (There wasn't all that much to do.) 22:00:25 It did do multiple colors, though. 22:00:33 I bought a typewriter from a charity shop the other day, completely impulsively 22:01:35 -!- boily has quit (Quit: CHICKEN RIBBON). 22:01:38 -!- metasepia has quit (Remote host closed the connection). 22:01:47 http://prodano.by/media/images/post/315/3153457_0.jpg apparently it works fine in Windows 7 x64 SP1. If that's what the bit in Russian means. 22:01:47 how hard is it to make your own ink ribbon out of like ribbon and ink? 22:04:59 fizzie: "PRINTING FROM WINDOWS 7 x64 SP1" 22:05:09 LOGICAL 22:05:26 (What's the hammer-and-sickle for?) 22:05:34 punctuation 22:05:38 I see. 22:05:47 (Perhaps it's a Party-approved printer.) 22:06:00 ending sentences is pretty ink-expensive in russian 22:06:57 Actually, it seems that HDP-920 is the A3 model. Mine was just A4; maybe it's the HDP-910 instead. 22:07:13 -!- Sgeo has joined. 22:13:24 -!- conehead has joined. 22:13:55 -!- yorick has joined. 22:16:31 shachaf: is there a concise term for an idea which isn't that stupid but is very popular with clueless beginners who will do it wrong and so everyone hates this idea? 22:17:22 not that i know of 22:17:26 what are some examples other than otp 22:17:44 probably a lot of things on the haskell faq 22:17:51 like dynamic typing 22:18:25 ah, makes sense 22:18:26 -!- MindlessDrone has quit (Quit: MindlessDrone). 22:18:27 -!- oerjan has joined. 22:18:53 @messages-lewd 22:18:54 boily said 6h 22m 34s ago: *mapole smack* 22:21:25 kmc: "PHP" 22:21:41 ("j/k lol") 22:22:20 haha 22:22:23 fizzie: I think Perl fits better than PHP 22:31:56 kmc: I once considered OO and static typing to be examples... sucky languages get them wrong and so they get derided 22:32:25 Although I'm not sure what some 'right' ways to do OO are, there are probably better approaches than the mainstream 22:34:26 yeah 22:34:43 definitely "wanting to do OO-ish things in Haskell" is an example 22:34:54 beginners want it and are usually wrong, but there are some valid cases 22:37:56 -!- AnotherTest has quit (Ping timeout: 246 seconds). 22:42:53 And here's me posting about it a while ago even though the post doesn't actually add anything to this discussion: http://sgeo.tumblr.com/post/45037477692/i-suspect-that-much-of-the-time-when-people-say 22:44:08 "A generic error has occurred." Well, that's helpful. 22:46:04 Would 'unknown' be better? 22:46:53 It's certainly better than pretending that the operation was successful 22:47:06 kmc, I'm heading towards an OO-ish API for this game library I'm writing in Haskell 22:47:23 Very -ish 22:48:28 I think Tcl is a language quite likely to explore interesting corners of OO design space 22:48:38 What game library is that? And what kind of OO-ish API? 22:48:41 There's XOTcl, which I don't know much about admittedly 22:48:54 Although they seem to limit themselves to single-dispatch 22:48:59 -!- Sprocklem has joined. 22:49:01 Sgeo: Tcl is awesome. 22:49:20 Smalltalk, ironically, seems less likey. Its OO is built into its core, I imagine a bit tricky to just change 22:49:27 LinearInterpol: are you pikhq? 22:49:33 nope. 22:49:47 huh. 22:50:17 I'm kind of done with Tcl after using a script I wrote that leaked around 12GB of memory 22:50:32 I wrote an object-oriented language once. 22:50:45 My IRC bot is also apparently a memory leaker, but I'm not sure what's causing that. That bot is also in Tcl. 22:50:48 LinearInterpol, you're behind Gregor, then 22:50:52 I think I'm bad at manual memory management 22:51:32 Taneb: was his language forth-like? :P 22:51:44 Glass was 22:51:48 ORK was less so 22:52:31 mine was callllled Emerald. it was p. stupid. 22:53:04 it doesn't help that people mean one of like 12 different things by "OOP" 22:53:08 Strings were disgusting to deal with. 22:53:20 kmc: mine was prototypical. 22:53:39 kmc, is "OOP" better or worse defined than "FP" 22:53:48 the lie that OOP was the origin of abstract data types is pervasive in CS education 22:53:57 How many dimemsions are there of somewhat well known terminology to describe OO systems? 22:54:08 single/multiple dispatch, prototypal/class based, etc/ 22:54:08 ? 22:54:20 Sgeo: as many dimensions as there are implementations of different ideas. 22:54:30 LinearInterpol: how many of those ideas have names though 22:54:38 tooooooooooooo many to fucking count. 22:55:12 hell, even the definition of object isn't consistent in most places. 22:55:18 in C it's taken to be data + identifier. 22:55:24 So that random joe schmoe could describe system X as "multiple-dispatch prototypal blah blah blah" and ultimately unique to X but... understandable 22:55:43 Hmm, what would multiple-dispatch prototypal look like? 22:55:46 it's so inconsistent it boggles my fucking mind. 22:55:56 And am I spelling prototypal correctly? 22:56:26 yep. 22:57:00 Sgeo: multiple-dispatch prototypal language? try emerald. 22:57:07 rather, my emerald. 22:57:22 I hacked that together so badly.. jesus. 22:57:43 Link? 22:57:57 almost afraid to give you the link but, sure. 22:58:30 https://bitbucket.org/LinearInterpol/emerald 22:59:01 like 99% of the environment isn't even defined in Python. 22:59:07 strings aren't. 22:59:13 math isn't. 22:59:31 oops, not in Python, *in the central interpreter. 22:59:34 I like stack-based except when I don't 22:59:47 Sgeo, how about queue-based? 22:59:50 this is when stack based becomes horrid. 22:59:59 look at Emerald.py 23:00:00 and weep. 23:00:04 queue-based? 23:00:35 -!- Bike has joined. 23:00:48 Sgeo, there aren't that many queue-based languages 23:01:39 I had a symbol to start and stop the interpreter. 23:01:41 : 23:01:51 which is scary enough but it does.. allow odd things to happen. 23:06:16 in "Old" you can see I was working on a C port but in the back of my head I slowly said "nooooooooooo" 23:06:39 -!- FreeFull has joined. 23:16:21 IOCCC 2013 results are in: http://ioccc.org/years.html#2013 23:16:36 oh joy. 23:17:05 -!- kmc has set topic: SURLYSPAWN is part of the ANGRYNEIGHBOR family of radar retro-reflectors. | 22nd IOCCC results: http://ioccc.org/years.html#2013 | https://dl.dropboxusercontent.com/u/2023808/wisdom.pdf http://codu.org/logs/_esoteric/ http://tunes.org/~nef/logs/esoteric/. 23:19:31 "This one-line C program accepts as a first command-line argument the last name of any of the last 31 US Presidents (from Franklin Pierce onwards), in lower case, and prints out their political affiliation." 23:20:58 main(int riguing,char**acters){puts(1[acters-~!(*(int*)1[acters]%4796%275%riguing)]);} 23:22:00 what. 23:27:51 I can almost see how that works 23:28:49 i'm just glad i can get s far as understaning that 1[bullshit] is the same as bullshit[1]. 23:29:01 Well, depending on how much I have misremembered the C spec, riging would always be 2 or 3 23:29:07 Probably 2 23:29:18 I think 4 23:29:29 I'll trust olsner 23:29:31 2 23:29:35 god, why did we make a competiton for the most eye-bleedingly horrid C program. 23:29:36 wait isn't it jsut argc 23:29:41 Yeah 23:29:43 um because it rules?? 23:29:43 mhm. 23:29:54 Bike: but most of us deal with it daily. :( 23:30:12 I, on the other hand, can't understand how it took me this long to understand where "riguing" and "acters" came from. 23:30:16 Also, according to the hint.html it works with a different argc 23:30:18 So, it's taking the first argument, casting it from a string to a pointer of ints 23:30:18 fizzie: lol. 23:30:48 lovely. 23:30:50 Or... it's casting 1 to a pointer to ints? 23:31:07 It sounds like it's based on the first 4 characters 23:31:23 Bike: link to the entry? 23:31:29 It is. 23:31:35 oh, it takes 3 arguments 23:31:38 that makes more sense 23:31:49 I was wondering what it was doing with argv[2]/argv[3] 23:32:13 I guess ~!(*(int*)1[acters]%4796%275%riguing) must end up either -1 or -2? 23:32:31 Yes, again. 23:32:33 "This entry takes a BMP image file of hand-drawn (mouse-drawn?) text, specified as the first command-line parameter, and converts it to an ASCII text document. " very nice. 23:32:40 LinearInterpol: http://ioccc.org/2013/cable1/hint.html 23:32:43 god, why did we make a competiton for the most eye-bleedingly horrid C program. <-- you're asking this in a channel that has at least two previous winners... 23:32:45 if you assume 2's complement, -b is ~b+1 23:32:55 oerjan, I know Gregor, but who else? 23:32:59 It's kind of cheaty how it needs the outputs as arguments. 23:33:04 Taneb: tromp_ 23:33:12 When did he win/what for? 23:33:14 thus -~x is ~~x+1 is x+1 23:33:24 Jesus. 23:33:31 oerjan: shoot me. :P 23:33:50 I've thought about entering but keep realising I know nought about C 23:34:02 * oerjan hits LinearInterpol with the saucepan as the closest available approximation ===\__/ 23:34:06 "Newcomers to C find it hard to learn all those different ways to control flow: for, while, if, do, goto, continue, break and heaven knows what else! So, in this program we only use for, so absolute beginners can get into the code straight away." thank goodness. 23:34:39 real programmers use goto. 23:34:40 obv. 23:34:47 "main is the most useful function in all of C - so it is a mystery to the author why most programs use it only once. Here we use it over and over for maximum benefit." 23:35:51 http://ioccc.org/2013/cable2/cable2.c it's... it's so beautiful. 23:36:10 erl -e 'map{map{print int(rand()*8);}(0..16);print chr(10);}(0..30);' | tr '[0-4]' ' '| ./birken 23:36:22 this is exactly the kind of bullshit people need to stop writing in perl 23:36:24 and includes #define $ for("IOCCC" #include... 23:36:46 god it's beautiful. 23:37:31 -!- conehead has quit (Quit: Computer has gone to sleep.). 23:37:37 "This entry weighs in at a magical 4043 bytes (8086 nibbles, 28,301 bits). It manages to implement most of the hardware in a 1980’s era IBM-PC using a few hundred fewer bits than the total number of transistors used to implement the original 8086 CPU." 23:37:39 for (0..30) { for (0..16) { print int rand 8; } print "\n"; } 23:38:17 Taneb: tromp_ won in the 2012 contest, and i'd say for implementing an esolang. 23:38:19 "If you like living on the edge you can try building the emulator on a big endian machine, and you will get an emulation of a big endian 8086," hsh 23:38:29 nice 23:38:41 oerjan, yeah, I see 23:38:51 I was working on something vaguely similar that overused gmp 23:38:54 But it has bugs 23:39:26 jebus. 23:39:44 –64[T=1[O=32[L=(X=*Y&7)&1,o=X/2&1,l]=0,t=(c=y)&7,a=c/8&7,Y]>>6,g=~-T?y:(n)y,d=BX=y,l] 23:40:36 is there an ioccc entry that compresses c source by making it incomprehensible 23:40:46 ~-T is an amusing way to test for 1 23:41:04 Bike: well there's a C compiler 23:41:12 http://bellard.org/otcc/ 23:41:24 Fabrice Motherfucking Bellard 23:42:20 That Fucker 23:43:33 int *Q,u,i,c,k,B,r=0,w,n,F=0,x,J,u,m,p,s=0,v,e,r,L,a,z,y,D,o,g; 23:43:54 I like the completely useless =0 in there 23:44:51 It improves the readability of the code. 23:45:02 Brwn and Jmpsver aren't nice words without the 0s 23:45:12 is this supposed to do something? 23:46:24 Well, first of all it's supposed to impress the IOCCC judges. 23:47:26 shachaf: http://twitpic.com/dr4b32 23:50:08 myname: the quickbrownfox one is an OCR program. 23:51:18 oh hey, there's a Lazy K implementation. 23:51:24 "We liked this entry because it can serve as a standalone program as well as an include file" 23:53:20 -!- Sprocklem has quit (Ping timeout: 260 seconds). 23:53:40 "Huge memory may be required to compile the program (about 300 MB on my machine)" uh 23:53:57 -!- conehead has joined. 23:54:14 -!- pikhq has quit (Ping timeout: 264 seconds). 23:59:17 "Shaders are written in an interpreted language that supports basic arithmetic, a few math functions, variables and procedural call in the CPS (Continuation Passing Style)." 23:59:22 just gonna keep quoting crap 2014-01-04: 00:03:27 oooh ioccc results 00:04:26 "Finally, if you lost track of how many misaka.c you have stacked together, you can feed the source to a brainfuck interpreter to get a overview of how the programs are stacked" help 00:08:28 Bike: yeah recursively calling main() is an old trick 00:09:07 "Nevertheless, the program was too big to meet the IOCCC’s size rule. So I created a smaller bootstrap program that generates the main program. prog.c contains fragments of the main program as a comment which iocccsize -i does not count." 00:09:07 and C++ forbids it!!! those bastards 00:09:08 :D 00:09:55 lol 00:10:16 kmc: weird, why? 00:10:22 are there videos about them presentating their code? 00:10:25 i'd love that 00:10:46 -ta 00:11:26 Bike: i'm not really sure why. http://stackoverflow.com/questions/4518598/is-it-legal-to-recurse-into-main-in-c/4519407#4519407 says a little about it 00:11:27 Bike: main isn't really a function in C++ 00:11:39 it has implementation-defined linkage 00:11:39 it doesn't follow the usual language rules 00:11:55 I guess on many platforms it is effectively extern "C" implicitly? 00:12:00 ah, hm 00:12:00 no name mangling, two possible implementations (but no overloading) 00:12:01 you can't take its address either 00:12:08 ah yeah that too 00:12:27 ah the lengths to which we go to make C++ sort of a superset of C 00:12:54 clearly they should have gone the Java route and required you to implement a class Main with an int operator()(int argc, char **argv) 00:12:57 C++ is a superset of a subset of C 00:13:09 `addquote C++ is a superset of a subset of C 00:13:13 1157) C++ is a superset of a subset of C 00:13:18 or rather: the intersection of C++ and C is non-empty 00:13:55 mauke: only if the named subset of C is non-empty 00:14:30 it is, hence the strengthening 00:15:37 http://ioccc.org/2013/misaka/hint.html ok this one is just amazing 00:15:42 it's "quite a ride" 00:16:29 yes 00:16:46 don't forget to look at thea ctual program 00:17:04 this might be my fav entry and i haven't even seen them all 00:17:09 v. anime 00:17:14 ow my brain 00:17:26 * LinearInterpol dies. 00:17:51 also i'm glad i wasn't the only one who imagined horizontal cat, lol 00:18:15 "Getting the code down to <= 4096 characters to meet the IOCCC rule 2 overall size limit required a good deal of effort (and appreciable risk of divorce)" 00:18:56 mauke: which one's that from? 00:19:00 appreciable risk of divorce eh. 00:19:05 cable3 00:19:48 i love when you're wondering "gosh what does this program even DO?" and then you see something like 00:19:51 I n t,e,l[80186],*E,m,u,L,a,T,o,r[1<<21], 00:21:22 Int,? what? 00:21:57 nooodl: it's like frosting on a cake. 00:22:13 delicious, delicious frosting. 00:22:16 not Int,; I n t, 00:22:28 wow this is an 8086 emulator in 8086 nibbles of C 00:22:57 At least the variable declarations are descriptive 00:23:01 as in, they describe the program 00:23:26 nooodl: actually it's a full PC emulator 00:26:50 Is Don Yang just going to submit one of the programs on his website every year 00:26:55 for(my $i = 0; $i <= $#d; $i++) 00:26:57 goddammit 00:27:05 why do we let these people write perl 00:27:24 open my $file, "<$opt" 00:27:33 $expected = join '', <$file>; AAAARGH 00:33:27 mauke: i don't know any perl; what's wrong with those 00:33:49 first one should be: for my $i (0 .. $#d) 00:34:05 basically, you don't use C-style for loops in perl unless you have a very good reason 00:34:36 ah yeah. ruby's like that too 00:34:41 and the <= in the condition isn't idiomatic C either 00:35:17 second, I noticed that the author used -w instead of 'use warnings' 00:35:18 i guess $#d is the length of @d? it looks a lot like an off-by-one error 00:35:28 $#d is the last index in @d because Perl 00:35:36 but @d used as a scalar is the length of @d 00:35:43 i... perl 00:35:47 which is kind of OK if you want to stay compatible with perls before 5.6.0, released in 2000 00:36:03 but then they use 'open my $file', which requires at least 5.6.0 00:36:15 let me guess. @foo[$#foo] is a perl idiom 00:36:34 but then they use 2-arg open, which you have no business using because starting from 5.6.0 perl supports 3-arg open 00:36:35 -!- conehead has quit (Quit: Computer has gone to sleep.). 00:36:38 so the whole thing is a clusterfuck 00:36:52 join '', <$file> is a really inefficient way to read the whole file into a string 00:36:56 note that the last index in @d could be anything, because you can globally change the starting index for arrays, using $[ 00:37:00 nooodl: no, that's terrible 00:37:04 nooodl: the idiom is $foo[-1] 00:37:09 kmc: wrong 00:37:12 whew 00:37:12 $[ isn't global 00:37:25 also, deprecated 00:37:34 lol well that's fine then 00:37:54 not only can the starting index be anything, it can be different in different places? this is great 00:37:59 assignment to $[ is treated as a compiler pragma and has been since 5.0 00:38:20 and it's lexically scoped so other modules can't fuck up your script 00:38:34 olsner: wondering what happens if you pass such arrays around 00:38:36 (officially deprecated since 5.12) 00:39:00 myname: nothing. $[ affects indexing operations, not the data structure 00:39:07 ah 00:39:15 myname: perl, that's what happens 00:39:21 but... why? 00:39:35 could you make arrays starting at -1? 00:39:40 sadly, yes 00:39:46 hahaha 00:39:47 i swear perl is like a 20-something-year-old regularly looking back at its teens, thinking, "god. why did i do all of these dumb things. now i gotta deal with that" 00:39:55 so a[-2] is the last element? 00:40:06 myname: yes 00:40:17 hilarious 00:40:20 it's crazy, but in a sane way 00:40:35 does $[ have to be an integer? 00:40:36 oh if you set $[ to 1, a[0] is the last element? 00:40:39 olsner: yes 00:40:40 -!- pikhq has joined. 00:40:49 hahahaha 00:40:52 ok :( 00:41:03 ooh, I didn't know this: if you 'use v5.16' explicitly, $[ simply stops working 00:41:09 fantastic to toggle between two values 00:41:13 because WTF are you even doing, touching $[ 00:41:20 $[ = 2147483647; 00:41:20 make an array with both, change $[, access a[0] 00:41:57 god. i need an obfuscated perl code contest in my life 00:42:18 does that ex--ah. of course it exists 00:42:37 you'll probably get more "oh god please no" out of golf contests 00:44:02 myname: re: "why", it's probably to make awk programmers feel at home 00:44:09 and I wouldn't be surprised if a2p uses it 00:45:39 IIRC there was a popular algorithms book that used int foo_[20]; int *foo = &foo_[-1]; to be able to use foo as a 1-based array in C 00:46:00 (this code has undefined behavior) 00:46:28 fizzie mentioned some code he dealt with that did that (plus typedefs) 00:54:41 -!- tromp has quit (Read error: Operation timed out). 00:55:09 -!- tromp has joined. 01:01:05 -!- FreeFull has quit (Ping timeout: 246 seconds). 01:03:09 -!- FreeFull has joined. 01:04:44 -!- Sorella has quit (Quit: It is tiem!). 01:05:39 -!- Sprocklem has joined. 01:05:58 mauke: I have used something like that once I think, but (foo_-1) instead of like that, and a macro rather than another variable. 01:06:12 still not valid 01:06:28 Yes, I know it is still undefined on some computers 01:06:41 s/on some computers// 01:06:52 Which have hardware pointer datatypes, for example, and maybe some VMs as well 01:07:00 computers are irrelevant 01:07:06 you're not writing computer code, you're writing C 01:07:47 But even in such a case, hopefully the compiler should optimize out the -1 or move it around, since it can be more efficient that way anyways. 01:07:51 c0mpUt3r. 01:08:17 I don't normally do that though (I think I only did once), and yes I know it is undefined. 01:08:46 no, in such a case the compiler should optimize out the whole statement 01:09:05 because it has no semantics 01:09:19 and no code runs faster than some code 01:09:30 Yes, that would be a valid thing for it to do and agree with the C specification, I suppose. 01:09:51 http://ideone.com/uFM1D4 01:10:36 But it doesn't seem very sensible to do that automatically without being able to change it with an option (at least for targets where it is defined) 01:10:54 I don't know what you're thinking in but it's not C 01:11:26 Yes, I know in C it isn't defined. 01:12:09 But in some targets it is defined in the reasonable way, because of the way the CPU instruction set works, the pointers are just treated as numbers. 01:12:23 http://mauke.hopto.org/stuff/c/ubfun-1.c 01:14:33 What does %hd mean? 01:15:07 short int in decimal format 01:15:38 do you have to use h when sending shorts? don't they get expanded to ints? 01:15:59 -!- Sprocklem has quit (Ping timeout: 252 seconds). 01:16:22 I'm not sure, actually 01:16:37 `? varargs 01:16:38 varargs? ¯\(°​_o)/¯ 01:17:05 anyway, the code has undefined behavior 01:17:16 it behaves differently under gcc -O0 and gcc -O2 01:19:20 * oerjan discovers that walter pinkus's middle name is haskell 01:19:41 mauke: How does it behave? 01:20:00 it behaves undefinedly :) 01:20:17 zzo38: try it and see :-) 01:20:31 What does it do on your computer? 01:20:38 mauke: what if he gets the same behaviour 01:20:41 !! 01:20:55 then that would be interesting 01:21:36 Advanced compiler optimizations: we remove code that you intended to run 01:22:25 Shouldn't it print negative numbers? Or is the proper thing to do, something else? 01:23:30 Are there any maill systems out there that still can't handle high 8 bits? 01:23:30 -!- tromp_ has quit (Read error: Connection reset by peer). 01:23:43 yes 01:23:57 -!- tromp_ has joined. 01:24:05 -!- conehead has joined. 01:24:56 (“Are there still systems that...” “Yes”) 01:30:13 mauke: Hmm, I get the same behaviour (with gcc 4.8.2), even with -fstrict-overflow 01:30:53 (in particular, no infinite loop) 01:30:58 ooh, this seems to be new in 4.8 01:31:14 older versions generated an infinite loop 01:33:25 -!- oerjan has quit (Quit: nyx). 01:36:17 It could be argued that creating an infinite loop is a pessimization 02:00:12 Well, that's not what was happening. The compiler removed a test that it could prove would always succeed unless the program invoked some sort of undefined behaviour (in this case, signed integer arithmetic underflow). 02:06:59 -!- Sprocklem has joined. 02:16:50 http://regex.alf.nu/ 02:17:58 sounds awesome 02:20:45 oh, fun. 02:21:32 there should be more regex games 02:21:55 some of the later ones require loads of perl extensions to the regexpes 02:22:11 oh :( 02:22:11 well, more than 0 02:23:02 "This doesn't really work as a tutorial. Not really clear what you're supposed to do here." 02:23:06 is there backtracking required 02:23:30 allochirally, good word 02:23:39 olsner: well, it uses JS' engine, so it can't use too many Perl extensions 02:23:51 JS regexp doesn't even support lookbehinds 02:24:18 oh. this one is titled 'backrefs'. 02:24:28 page closed, unfollowed, detweeted, called the cops 02:25:22 lol 02:25:39 it says "regex", not "regular expression" 02:26:27 do i have to call the cops on yout too 02:26:45 come at me bro 02:27:01 /.*/cops 02:27:15 4 is pretty simple, though 02:29:29 -!- yorick has quit (Remote host closed the connection). 02:30:36 5 would be easy if you could change the columns 02:32:55 5 is easy but my solution is inelegant 02:33:06 huh 02:33:24 ooooh 02:33:29 oh, no 02:33:58 oh god, 6 is worse 02:34:24 I'm kinda stuck at 6 02:34:33 brute force again, I guess 02:34:42 i am kinda stuck at 5 :( 02:34:52 er 02:34:54 i could do negative lookahead or the like 02:34:54 7 I mean 02:35:07 but i never ever recall what they look like 02:35:33 oh god, the prime thing 02:35:35 I know I've seen a regex for 7, but I can't remember how it worked 02:35:39 fortunately it's easy 02:35:43 :( 02:35:48 i assume the prime thing should be easy 02:35:52 call me if they're looking for fibonacci sequences 02:36:15 lol 02:36:55 does this even support negative lookahead? 02:37:19 JS regexp doesn't even support lookbehinds 02:37:21 can i get a regex to recognize fibonacci sequences like abccdddeeeeeffffffff of any length, and with any characters 02:37:28 Oh, you mean as in (?!)? yes, that's supported 02:37:28 lookbehind does not matter 02:37:44 why doesn't my sollution work, then 02:37:54 Bike: I can recognize "x x xx xxx xxxxx" etc 02:38:07 too easy 02:38:27 show me 02:39:06 apparently, i'm too stupid for lookahead assertions 02:39:23 oh 02:39:47 what the 02:41:10 i don't know, that's why i'm asking! 02:41:38 i am pretty sure, there has to be a ?! at number 5 02:41:45 i just can't assemble it 02:43:06 myname: http://p3rl.org/perlretut 02:45:54 mauke: i know how they work, i think 02:58:48 so... [^\2] does not work` 02:58:49 ? 03:02:46 Nope 03:12:20 i don't get it 03:14:23 maybe i'm too tired 03:18:50 great, it seems to not knot conditions 03:59:07 -!- qlkzy has quit (Quit: ZNC - http://znc.sourceforge.net). 03:59:15 -!- qlkzy has joined. 04:00:00 -!- ineiros has quit (Ping timeout: 245 seconds). 04:00:39 -!- ineiros has joined. 04:01:37 Slereah: since those are supposed to be anubis things 04:01:42 they're technically not jackals at all 04:02:09 or at least they're not depicting jackals! 04:02:10 well jacktually, 04:02:12 or are they 04:02:15 this is very pomo 04:11:26 can i just start adding ##crypto quotes here 04:11:37 why not 04:11:57 they don't have a crypto quote bot and it's sad 04:12:14 although lambdabot is there so maybe it's more appropriate 04:18:51 preflex: quote 04:18:52 and facing a choice between perl and mircscript, i'd gladly shoot myself 04:22:23 Good choice 04:22:40 preflex: quote 04:22:41 scroll lock is a letter in the canadian language 04:25:14 Are there 2D and 3D implementations of PADsynth? 04:28:09 The description of PADsynth is: 1. Add together several bell curves with differing mean, variance, and amplitude (specified as parameters to the algorithm), to fill up the amplitude table. 2. Fill up the phase table with random data. 3. Make the inverse Fourier transform. 04:29:04 What other synthesis algorithms are there with a kind of relative simplicity? 04:34:15 -!- copumpkin has joined. 04:36:06 http://moviecode.tumblr.com/image/72105358714 04:36:20 Sample code? That seems a bit monotonous 04:39:12 -!- preflex has quit (Read error: Operation timed out). 04:39:12 -!- mauke has quit (Read error: Operation timed out). 04:40:01 -!- mauke has joined. 04:41:13 -!- FreeFull has quit (Ping timeout: 246 seconds). 04:41:35 http://moviecode.tumblr.com/ finally 04:41:44 -!- preflex has joined. 04:43:08 -!- FreeFull has joined. 04:48:47 -!- FreeFull has quit (Ping timeout: 260 seconds). 04:56:05 "In the film Elysium the space station is rebooted using code taken directly from the Intel Architecture Software Developer’s Manual Volume 3: System Development" 04:56:08 seems accurate 04:58:12 I'm kind of shocked that Uplink has gotten any kind of update 04:59:11 (There's now an iPad version) 05:13:13 -!- FreeFull has joined. 05:15:01 -!- nooodl has quit (Ping timeout: 272 seconds). 05:32:12 wtf 05:32:13 "I drank a chemistry experiment in class once. I forget the exact nature of the experiment, but I do remember that if we did it 05:32:14 correctly, we ended up with plain old salt water. We must have done it mostly correct, because other than a mild burning for 05:32:14 about an hour after, I was fine. Teacher flipped her shiat though. My lab partners threw me under the bus. All through the 05:32:14 experiment, they were like , "C'mon...drink it...DRINK IT! I dare ya!" and then when the teacher got mad, they did a 180 and 05:32:15 were all like, "She did it man, it was HER idea!". I got an F on that particular lab assignment." 05:32:50 student does dumb thing 05:33:04 -!- FreeFull has quit (Ping timeout: 260 seconds). 05:34:40 I had homeroom in a science classroom, and someone spit in the teacher's drink, so I told the teacher not to drink it. Later was told what a good thing I did, especially since it could have been anything in there, and asked me if I knew what it was. Spit. 05:35:10 Which I guess is a thing to avoid consuming, but probably not as ... dangerous as they were thinking 05:35:31 could be worse 05:35:37 it's a biohazard 05:38:52 It was almost the timestamp 1388813888 according to some computers. It repeating in twice 05:43:10 -!- FreeFull has joined. 05:50:26 -!- FreeFull has quit (Ping timeout: 252 seconds). 05:50:52 -!- conehead has quit (Quit: Computer has gone to sleep.). 05:58:16 -!- LinearInterpol has quit (Ping timeout: 260 seconds). 06:13:13 -!- FreeFull has joined. 06:17:45 -!- tromp_ has quit (Read error: Connection reset by peer). 06:24:30 -!- tromp_ has joined. 06:30:06 -!- tromp_ has quit (Read error: Connection reset by peer). 06:43:16 -!- FreeFull_ has joined. 06:43:41 -!- FreeFull has quit (Ping timeout: 272 seconds). 07:26:28 -!- tertu has joined. 07:34:49 -!- FreeFull has joined. 07:35:51 -!- FreeFull_ has quit (Ping timeout: 260 seconds). 08:00:51 -!- ter2 has joined. 08:01:35 -!- ter2 has quit (Read error: Connection reset by peer). 08:01:52 -!- ter2 has joined. 08:04:23 -!- tertu has quit (Ping timeout: 272 seconds). 08:10:20 zzo38: nice 08:10:54 zzo38: have you seen https://twitter.com/megasecond 08:13:21 I just upgraded my libc to sid apparently 08:13:23 fun 08:13:46 on the plus side, the thing I was trying to get working is 08:14:36 too bad there's no way to run daemons or cronjobs on HackEgo 08:14:51 because i think megaseconds should be announced in here 08:16:05 in big rainbow ascii art perhaps 08:18:35 -!- Bike has quit (Ping timeout: 272 seconds). 08:21:28 Is there any correlation between a game being difficult for computers and being fun for humans. 08:21:38 I guess a lot of unfun for humans games are easy for computers 08:21:51 But I mean, like chess and go, computers have more difficulty with Go 08:22:12 I guess I'm imagining 'computers are good at it' to indicate 'semi-trivial strategy' 08:22:15 yeah although they're pretty good at go now as well 08:22:19 Althouhg that's obviously false for chess 08:22:31 Although iiuc chess strategy does have some trivial parts 08:22:34 memorized openings 08:22:51 trivial means there exists a computer program to do it 08:22:58 or we can imagine one 08:24:16 kmc: I have not seen. 08:24:49 Make up your own megaseconds announcement if you prefer to 08:25:26 Sgeo: do you think that go is more fun than chess? 08:25:41 It's been a very long time since I tried chess 08:25:51 I kind of don't want to try it again, not sure why 08:26:04 So I don't really think I can compare too well 08:27:40 There are games other than chess and go, such as shogi. 08:27:59 And there is Fischerandom chess 08:29:23 -!- FreeFull has quit (Ping timeout: 252 seconds). 08:31:18 well you can appeal to some idea that tree pruning heuristics are more fun than exhaustive search, but a game can exceed the human ability for exhaustive search and still be easy for computers 08:31:55 it's not clear that additional computer-hardness past that point changes a human player's subjective experience that the game has deep strategy 08:40:47 apparantely chess has lots of memorizing positions 08:40:56 there's a sirlin article on that I think 08:43:04 http://codegolf.stackexchange.com/questions/17005/produce-the-number-2014-without-any-numbers-in-your-source-code 08:43:17 boring. 08:45:37 `python "print int(`len('aaaaaaa')`+'de',len('bbbbbbbbbbbbbbbb'))" 08:45:41 python: can't open file '"print int(`len('aaaaaaa')`+'de',len('bbbbbbbbbbbbbbbb'))"': [Errno 2] No such file or directory 08:45:47 `python run "print int(`len('aaaaaaa')`+'de',len('bbbbbbbbbbbbbbbb'))" 08:45:48 python: can't open file 'run "print int(`len('aaaaaaa')`+'de',len('bbbbbbbbbbbbbbbb'))"': [Errno 2] No such file or directory 08:45:56 oh. golf 08:46:03 Golfing is always interesting. 08:46:59 `olist (936) 08:47:00 olist (936): shachaf oerjan Sgeo FireFly 08:51:23 `run python -c "print sum(ord(c) for c in 'Happy new year to you!')" 08:51:24 2014 08:52:06 nice 08:52:20 print ord('ߞ') 08:52:28 ^- there you go 08:52:49 Who's gonna beat that? 08:55:07 `run python -c "print sum(map('Happy new year to you!'))" 08:55:09 Traceback (most recent call last): \ File "", line 1, in \ TypeError: map() requires at least two args 08:55:13 `run python -c "print sum(map(ord, 'Happy new year to you!'))" 08:55:14 2014 08:55:29 imo > sum . map ord $ "..." 08:55:59 > sum$map ord"Happy new year to you!" 08:56:00 2014 08:56:23 > ord<$>"Happy new year to you!" 08:56:25 [72,97,112,112,121,32,110,101,119,32,121,101,97,114,32,116,111,32,121,111,11... 09:01:47 -!- qlkzy has quit (*.net *.split). 09:01:47 -!- pikhq has quit (*.net *.split). 09:01:48 -!- Gregor has quit (*.net *.split). 09:01:48 -!- ggherdov has quit (*.net *.split). 09:01:49 -!- tromp has quit (*.net *.split). 09:01:49 -!- augur has quit (*.net *.split). 09:01:49 -!- yiyus has quit (*.net *.split). 09:01:51 -!- Deewiant has quit (*.net *.split). 09:01:52 -!- Jafet has quit (*.net *.split). 09:01:52 -!- coppro has quit (*.net *.split). 09:01:52 -!- JZTech101 has quit (*.net *.split). 09:01:52 -!- int-e has quit (*.net *.split). 09:01:53 -!- drlemon has quit (*.net *.split). 09:01:54 -!- lambdabot has quit (*.net *.split). 09:01:54 -!- trout has quit (*.net *.split). 09:01:54 -!- rntz^2 has quit (*.net *.split). 09:01:54 -!- rodgort has quit (*.net *.split). 09:01:54 -!- jix_ has quit (*.net *.split). 09:01:54 -!- sebbu has quit (*.net *.split). 09:01:55 -!- CADD has quit (*.net *.split). 09:01:55 -!- _46bit_ has quit (*.net *.split). 09:01:55 -!- upgrayeddd has quit (*.net *.split). 09:01:55 -!- myndzi has quit (*.net *.split). 09:01:55 -!- preflex has quit (*.net *.split). 09:01:55 -!- Sprocklem has quit (*.net *.split). 09:01:55 -!- glogbackup has quit (*.net *.split). 09:01:55 -!- jconn has quit (*.net *.split). 09:01:55 -!- Gracenotes has quit (*.net *.split). 09:01:56 -!- b_jonas has quit (*.net *.split). 09:01:56 -!- mauke has quit (*.net *.split). 09:01:56 -!- carado has quit (*.net *.split). 09:01:56 -!- realzies has quit (*.net *.split). 09:01:57 -!- FireFly has quit (*.net *.split). 09:01:57 -!- Sellyme has quit (*.net *.split). 09:01:57 -!- copumpkin has quit (*.net *.split). 09:01:57 -!- lifthrasiir has quit (*.net *.split). 09:01:57 -!- Slereah has quit (*.net *.split). 09:01:58 -!- ineiros has quit (*.net *.split). 09:01:58 -!- Sgeo has quit (*.net *.split). 09:01:58 -!- ski_ has quit (*.net *.split). 09:01:58 -!- aloril has quit (*.net *.split). 09:01:58 -!- Taneb has quit (*.net *.split). 09:01:58 -!- heroux has quit (*.net *.split). 09:01:59 -!- Fiora has quit (*.net *.split). 09:01:59 -!- elliott has quit (*.net *.split). 09:01:59 -!- quintopia has quit (*.net *.split). 09:01:59 -!- ion has quit (*.net *.split). 09:02:00 -!- ter2 has quit (*.net *.split). 09:02:01 -!- olsner has quit (*.net *.split). 09:02:01 -!- fungot has quit (*.net *.split). 09:02:01 -!- kmc has quit (*.net *.split). 09:02:01 -!- myname has quit (*.net *.split). 09:02:01 -!- TodPunk has quit (*.net *.split). 09:02:01 -!- atehwa has quit (*.net *.split). 09:02:01 -!- EgoBot has quit (*.net *.split). 09:02:01 -!- HackEgo has quit (*.net *.split). 09:02:01 -!- oklopol has quit (*.net *.split). 09:02:02 -!- zzo38 has quit (*.net *.split). 09:02:02 -!- Froox has quit (*.net *.split). 09:02:02 -!- shachaf has quit (*.net *.split). 09:02:02 -!- SirCmpwn has quit (*.net *.split). 09:02:02 -!- iamcal has quit (*.net *.split). 09:02:02 -!- nortti has quit (*.net *.split). 09:02:02 -!- douglass_ has quit (*.net *.split). 09:02:03 -!- fizzie has quit (*.net *.split). 09:02:03 -!- Zuu has quit (*.net *.split). 09:02:03 -!- Vorpal has quit (*.net *.split). 09:02:04 -!- nisstyre has quit (*.net *.split). 09:02:04 -!- mroman has quit (*.net *.split). 09:02:04 -!- clog has quit (*.net *.split). 09:35:39 -!- SirCmpwn has joined. 09:35:39 -!- nortti has joined. 09:35:39 -!- iamcal has joined. 09:35:39 -!- Froox has joined. 09:35:39 -!- zzo38 has joined. 09:35:39 -!- oklopol has joined. 09:35:39 -!- Gregor has joined. 09:35:39 -!- trout has joined. 09:35:39 -!- rntz^2 has joined. 09:35:39 -!- lambdabot has joined. 09:35:39 -!- drlemon has joined. 09:35:39 -!- shachaf has joined. 09:35:39 -!- b_jonas has joined. 09:35:39 -!- FireFly has joined. 09:35:39 -!- Gracenotes has joined. 09:35:39 -!- jconn has joined. 09:35:39 -!- realzies has joined. 09:35:39 -!- Sellyme has joined. 09:35:39 -!- sebbu has joined. 09:35:39 -!- myndzi has joined. 09:35:39 -!- rodgort has joined. 09:35:39 -!- upgrayeddd has joined. 09:35:39 -!- _46bit_ has joined. 09:35:39 -!- CADD has joined. 09:35:39 -!- carado has joined. 09:35:39 -!- Sprocklem has joined. 09:35:39 -!- mauke has joined. 09:35:39 -!- preflex has joined. 09:35:39 -!- Deewiant_ has joined. 09:35:39 -!- jix has joined. 09:35:39 -!- int-e_ has joined. 09:35:39 -!- ggherdov has joined. 09:35:39 -!- 23LAATJIN has joined. 09:35:39 -!- pikhq has joined. 09:35:39 -!- qlkzy has joined. 09:35:39 -!- ion has joined. 09:35:39 -!- quintopia has joined. 09:35:39 -!- Fiora has joined. 09:35:39 -!- elliott has joined. 09:35:39 -!- heroux has joined. 09:35:39 -!- Taneb has joined. 09:35:39 -!- aloril has joined. 09:35:39 -!- ski_ has joined. 09:35:39 -!- Sgeo has joined. 09:35:39 -!- ineiros has joined. 09:35:39 -!- mroman has joined. 09:35:39 -!- Vorpal has joined. 09:35:39 -!- Zuu has joined. 09:35:39 -!- fizzie has joined. 09:35:39 -!- douglass_ has joined. 09:35:39 -!- Bike has joined. 09:35:39 -!- yiyus has joined. 09:35:39 -!- augur has joined. 09:35:39 -!- tromp has joined. 09:35:39 -!- nisstyre has joined. 09:35:39 -!- clog has joined. 09:35:39 -!- coppro has joined. 09:40:05 -!- AnotherTest has joined. 09:44:10 -!- JZTech101 has joined. 09:44:10 -!- copumpkin has joined. 09:44:10 -!- lifthrasiir has joined. 09:44:10 -!- Slereah has joined. 09:47:49 hm. 09:48:02 How many modulos does one need to reconstruct the original number? 09:48:18 starting from 2 09:48:25 What? 09:48:44 i.e 2014 % 2 = 0, 2014 % 3 = 1; 2014 % 4 = 2; 2014 % 5 = 4 and so on 09:49:02 which gives you the numbers 0,1,2,4,... 09:49:17 And you want to know how many of those numbers you need to reconstruct 2014 uniquely? 09:49:23 exactly 09:49:48 you just need one, as long as it's bigger than 2014 09:49:51 If your moduli are coprime, you can uniquely reconstruct a count of numbers that is the product of the moduli. 09:50:08 For instance if your moduli are 2, 3, and 5, you can have 2*3*5 = 30 unique numbers. 09:50:13 (after that they'll start repeating) 09:50:41 (0 mod 2 = 0, 0 mod 3 = 0, 0 mod 5 = 0; 30 mod 2 = 0, 30 mod 3 = 0, 30 mod 5 = 0) 09:50:57 Is that what you mean? 09:51:05 Yeah, that helps. 09:51:20 a little. 09:51:37 what else do you want to know 09:52:07 How many numbers do I need to reconstruct (uniquely) any given number 09:52:14 ;) 09:52:20 infinite. 09:52:27 seeing as how there are infinitely many numbers. 09:52:29 such is life. 09:52:34 what 09:52:49 s/any/a certain given 09:53:14 doesn't matter. if you're not specifying an upper range you're out of luck. 09:53:39 -!- ter2 has joined. 09:53:39 -!- olsner has joined. 09:53:39 -!- fungot has joined. 09:53:39 -!- kmc has joined. 09:53:39 -!- myname has joined. 09:53:39 -!- TodPunk has joined. 09:53:39 -!- atehwa has joined. 09:53:39 -!- EgoBot has joined. 09:53:39 -!- HackEgo has joined. 09:53:47 what? 09:53:51 I want f(x) 09:53:56 try writing out the integers mod certain numbers. 2: 0, 1, 0, 1... 3: 0, 1, 2, 0, 1, 2, 0, 1, 2, ... 4: 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3,... 09:54:01 they repeat. 09:54:06 where f is a function that tells me how many numbers I'd need to reconstruct x 09:54:37 oh 09:54:37 I see your point 09:54:47 The upper bound is x 09:55:01 -!- JZTech101 has quit (Changing host). 09:55:01 -!- JZTech101 has joined. 09:55:04 -!- SirCmpwn has changed nick to Guest37212. 09:55:06 then shachaf knows the answer. 09:55:37 he cheated with "as long as it's bigger" 09:55:58 cheated? you didn't say anything bout the moduli 09:56:22 do you want to have the moduli be contiguous and starting at 2? 09:56:29 Of course. 09:56:36 "of course", he says 09:56:43 That's the whole point 09:56:52 they're not coprime so it's some bullshit. look up the chinese remainder theorem. 09:56:59 it would be much more sensible to use only prime moduli. 09:57:51 in which case you need, let's see, five. 09:58:06 > 2 * 3 * 5 * 7 * 11 09:58:07 2310 09:58:43 > (2014 `mod` 2, 2014 `mod` 3, 2014 `mod` 5, 2014 `mod` 7, 2014 `mod` 11) 09:58:44 (0,1,4,5,1) 10:06:10 -!- Deewiant_ has changed nick to Deewiant. 10:32:31 -!- FreeFull has joined. 10:40:14 Bike: Yep. 10:42:01 that's about 11.1 bits if you're wondering, very ehhhhh 10:42:17 now I need to be convinced that mod 4 does not provide more information than mod 2 10:42:26 which I assume it does not 10:42:42 well, it does. 10:42:53 i mean, obviously 3 and 1 are distinct under mod 4 and not under mod 2. 10:43:20 Yeah 10:43:33 but can it reduce the required numbers to 4 instead of 5 for 2014 10:43:34 it's when you use them at the same time that things get redundant. 10:43:37 given that you don't start at 2 10:43:46 but can choose 4 moduli you like < 2014 10:43:59 oh, well sure i guess. 3, 4, 5, 7, and 11 are still coprime 10:44:23 is coprime gdt(a,b) = 1? 10:44:28 eh wait 10:44:31 gcd(a,b) 10:44:34 yes 10:44:36 Ok 10:44:46 so Teilerfremd in German :) 10:44:47 just means they don't share any factors; primes are coprime with everything 10:46:10 > 8 * 11 * 13 10:46:12 1144 10:46:15 > 8 * 11 * 13 * 17 10:46:16 19448 10:46:57 that should let me uniquely reconstruct 2014 with 4 numbers? 10:47:40 hm 10:48:00 > 2014 `mod` 1008 10:48:01 1006 10:48:07 > 1008 + 1006 10:48:08 2014 10:48:17 Man am I stupid. 10:48:52 If the moduli is > x/2 it's pretty obvious you only need one 10:49:11 how cruel 10:49:14 yeah 10:49:27 for the "pick yourself a moduli" case 10:49:28 what? 10:49:38 or modulo 10:49:53 if you have one modulus of 1008 you can't distinguish 1006 and 2014 10:50:19 aw. yeah 10:50:54 I'll stop trying. 10:51:10 basically you're not going to represent 2014 in any useful sense without being able to represent at least 2015 distinct numbers :p 10:51:35 Yeah. 10:51:54 I'm experimenting with "probabilistic compression algorithms" or whatever you call them 10:52:10 lossy compression? 10:52:19 In a sense, yes. 10:52:35 It's basically an "underdefined" equation 10:53:09 I.e. you can't reconstruct the data uniquely 10:53:32 but you can construct all possible solutions 10:53:39 one of them then is the actual original data 10:54:19 given that it is english text 10:54:28 you can do an text-analysis on all solutions 10:54:38 -!- MindlessDrone has joined. 10:54:42 and reconstruct the original data pretty well 10:56:13 You may tell me now how stupid that is ;) 10:57:04 another approach is to predict the future 10:57:22 and then only transmit information if the actual outcome wasn't the same as the prediction 10:57:37 so you actually transmit a "difference" of the actual data to the "prediction" 10:58:37 but you might as well use something more sane like huffman or lz or whatever 11:00:19 (underdefined == not well enough defined) 11:00:25 Not sure if that's an actual english word 11:01:39 it's well enough defined :p 11:02:47 -!- mauke has quit (Remote host closed the connection). 11:03:10 -!- mauke has joined. 11:09:53 hm 11:10:28 `run "echo 2014 | python -c 'print input()'" 11:10:30 bash: echo 2014 | python -c 'print input()': command not found 11:14:28 -!- FreeFull_ has joined. 11:15:23 -!- FreeFull has quit (Ping timeout: 272 seconds). 11:24:17 -!- FreeFull_ has quit (Ping timeout: 252 seconds). 11:38:11 -!- Phantom_Hoover has joined. 11:44:31 -!- FreeFull has joined. 11:54:46 -!- ter2 has quit (Read error: Connection reset by peer). 11:55:01 -!- ter2 has joined. 11:57:56 -!- ter2 has quit (Read error: Connection reset by peer). 11:58:21 -!- tertu has joined. 11:59:33 -!- tertu has quit (Read error: Connection reset by peer). 11:59:56 -!- tertu has joined. 12:03:11 -!- tertu has quit (Read error: Connection reset by peer). 12:03:34 -!- tertu has joined. 12:03:39 -!- FreeFull has quit (Ping timeout: 260 seconds). 12:04:32 -!- tertu has quit (Read error: Connection reset by peer). 12:05:00 -!- tertu has joined. 12:06:32 -!- ter2 has joined. 12:06:38 -!- coppro has quit (Ping timeout: 252 seconds). 12:06:48 -!- coppro has joined. 12:07:57 -!- ter2 has quit (Read error: Connection reset by peer). 12:08:18 -!- ter2 has joined. 12:10:38 -!- tertu has quit (Ping timeout: 246 seconds). 12:11:39 -!- ter2 has quit (Read error: Connection reset by peer). 12:11:55 -!- ter2 has joined. 12:14:31 -!- FreeFull has joined. 12:15:15 -!- tertu has joined. 12:16:36 -!- tertu has quit (Read error: Connection reset by peer). 12:16:55 -!- tertu has joined. 12:18:11 -!- ter2 has quit (Ping timeout: 252 seconds). 12:20:07 -!- tertu has quit (Read error: Connection reset by peer). 12:20:21 -!- tertu has joined. 12:21:41 -!- tertu has quit (Read error: Connection reset by peer). 12:21:56 -!- tertu has joined. 12:26:01 -!- tertu has quit (Read error: Connection reset by peer). 12:26:19 -!- tertu has joined. 12:27:56 -!- ter2 has joined. 12:29:08 -!- ter2 has quit (Read error: Connection reset by peer). 12:29:25 -!- ter2 has joined. 12:30:14 -!- qlkzy has quit (Quit: ZNC - http://znc.sourceforge.net). 12:30:32 -!- ter2 has quit (Read error: Connection reset by peer). 12:30:37 -!- qlkzy has joined. 12:30:59 -!- ter2 has joined. 12:31:17 -!- tertu has quit (Ping timeout: 272 seconds). 12:32:14 -!- tertu3 has joined. 12:35:55 -!- ter2 has quit (Ping timeout: 260 seconds). 12:36:00 -!- tertu has joined. 12:37:22 -!- tertu3 has quit (Ping timeout: 245 seconds). 12:37:22 -!- AnotherTest has quit (Ping timeout: 245 seconds). 12:37:38 -!- ter2 has joined. 12:39:20 -!- tertu3 has joined. 12:41:03 -!- tertu3 has quit (Read error: Connection reset by peer). 12:41:20 -!- tertu3 has joined. 12:41:31 -!- FreeFull has quit (Ping timeout: 260 seconds). 12:41:38 -!- tertu has quit (Ping timeout: 265 seconds). 12:43:20 -!- ter2 has quit (Ping timeout: 245 seconds). 12:44:37 -!- FreeFull has joined. 12:45:21 -!- tertu has joined. 12:46:40 -!- FreeFull has quit (Read error: Connection reset by peer). 12:48:24 -!- tertu3 has quit (Ping timeout: 265 seconds). 12:49:21 -!- augur has quit (Remote host closed the connection). 12:49:24 -!- ter2 has joined. 12:49:57 -!- augur has joined. 12:53:15 -!- ter2 has quit (Read error: No route to host). 12:53:32 -!- ter2 has joined. 12:54:10 -!- augur has quit (Ping timeout: 245 seconds). 12:54:11 -!- tertu has quit (Ping timeout: 272 seconds). 12:55:05 -!- ter2 has quit (Read error: Connection reset by peer). 12:55:30 -!- ter2 has joined. 12:57:14 -!- ter2 has quit (Read error: Connection reset by peer). 12:57:25 -!- augur has joined. 12:57:29 -!- ter2 has joined. 12:59:17 -!- tertu3 has joined. 13:02:28 -!- tertu has joined. 13:03:27 -!- nooodl has joined. 13:03:57 -!- ter2 has quit (Ping timeout: 272 seconds). 13:05:29 -!- tertu3 has quit (Ping timeout: 272 seconds). 13:05:35 -!- oerjan has joined. 13:05:42 -!- tertu has quit (Read error: Connection reset by peer). 13:05:59 -!- tertu has joined. 13:07:25 -!- ter2 has joined. 13:09:00 -!- tertu3 has joined. 13:10:00 -!- carado has quit (Ping timeout: 245 seconds). 13:10:14 -!- yorick has joined. 13:10:26 -!- tertu3 has quit (Read error: Connection reset by peer). 13:10:50 -!- tertu3 has joined. 13:11:16 tertu3, fix your connection plx 13:11:43 `unicode ٩ 13:11:45 Unknown character. 13:11:49 `unidecode ٩ 13:11:50 ​[U+0669 ARABIC-INDIC DIGIT NINE] 13:11:55 -!- tertu has quit (Ping timeout: 272 seconds). 13:12:18 `unicode ARABIC-INDIC DIGIT EIGHT 13:12:20 ​٨ 13:13:02 -!- tertu3 has quit (Read error: Connection reset by peer). 13:13:15 -!- ter2 has quit (Ping timeout: 260 seconds). 13:13:18 -!- tertu3 has joined. 13:14:31 `run for d in one two three four five six seven eight nine; do unicode "$(echo arabic-indic digit $d | tr a-z A-Z)"; done | tr -d '\n' 13:14:37 ​١٢٣٤٥٦٧٨٩ 13:16:01 ٦ looks more like a 7 to me. Such foolishness. 13:16:15 -!- tertu3 has quit (Read error: Connection reset by peer). 13:16:30 -!- tertu3 has joined. 13:17:37 `unicode arabic-INDIC digit ZERO 13:17:38 ​٠ 13:17:43 I guess it wasn't case-sensitive after all. 13:18:20 -!- ter2 has joined. 13:21:40 -!- tertu3 has quit (Ping timeout: 260 seconds). 13:24:21 -!- ter2 has quit (Quit: Leaving). 13:33:04 -!- conehead has joined. 13:41:54 `wget ftp://ftp.unicode.org/Public/UNIDATA/UnicodeData.txt 13:41:55 ​--2014-01-04 13:41:55-- ftp://ftp.unicode.org/Public/UNIDATA/UnicodeData.txt \ => `UnicodeData.txt' \ Resolving ftp.unicode.org... failed: Name or service not known. \ wget: unable to resolve host address `ftp.unicode.org' 13:49:31 ITYM "fetch" 13:49:45 I think someone might've done that already, also. 13:50:26 -!- Sorella has joined. 13:52:35 -!- FreeFull has joined. 13:55:58 -!- conehead has quit (Ping timeout: 246 seconds). 13:57:02 -!- conehead has joined. 14:04:35 -!- conehead has quit (Quit: Textual IRC Client: www.textualapp.com). 14:05:58 Oh 14:12:44 Possibly not, I can't find any traces of it. 14:26:58 is there a certain bound subset of bf known to be turing complete? 14:27:43 finite registers would be nicest, but i really doubt thst 14:27:50 yeah, if you have bigints 14:27:56 you only need like 6 cells or something 14:28:10 mauke, oerjan proved 3 cells with bigint 14:28:22 oh wow 14:28:35 You can do it with 1-bit cells if you have infinite cells, I think 14:29:08 1-bit cells are in bitchanger and boolfuck 14:29:09 Taneb: yes that's boolfuck 14:29:28 Those are the two extremes 14:29:51 Is it proven that two unbounded cells is sub-TC? 14:30:32 well i never wrote up a proof 14:31:18 but the fact ending a loop forces one cell to be zero means you have not very much more than a single cell to use 14:32:08 or maybe we _did_ get a proof during previous discussions of the issue here, i don't quite remember 14:34:27 mauke: the 3-cell proof is in the "Collatz function" article of the wiki (because it's like, a corollary of those) 14:34:58 mauke: could you elborte 14:35:26 how? 14:35:47 is there an actual proof of that bigint part 14:36:11 `wiki Collatz function 14:36:12 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: wiki: not found 14:36:17 ^wiki Collatz function 14:36:18 http://esolangs.org/wiki/Collatz function 14:36:46 not very escaping that command 14:37:11 reduction from fractrn 14:37:14 oh boy 14:37:20 would love reading about that 14:38:09 myname: the function for the reduction is in the haskell code further down 14:38:19 that 3-cell-thing might be handy for proofs 14:39:05 it should be possible to compile from 3-cell-bf to wolfgang 14:40:56 have to think on how to handle loops... 14:41:23 wait, should actually be pretty easy 14:41:35 i will take a look at it later 14:41:41 myname: if wolfgang can embed state machines, then a 2-register minsky machine or fractran might fit better. 3-cell bf is nice if you only have precisely bf's control flow. 14:42:29 oerjan: well, i agree, but i have no approach in mind on how to compile fractran to wolfgang 14:42:45 ok 2-register minsky machine then. 14:42:52 i may have a look at it 14:43:04 it's like the member of the family which has full state machine control 14:45:58 okay, so i have to proof a) i can resemble a fsa and b) i can increment and decrement on at least 2 registers? 14:46:02 apropos state machines, this regex game y'all linked to is starting to get awkward, i think i need to convert a state machine to solve this triples level 14:46:42 myname: yeah. and also branch on registers reaching zero. 14:46:57 finite sets are technically boring 14:47:19 oerjan: you have to cheat for triples 14:47:28 oh? 14:47:41 because i know in _principle_ how to do the conversion. 14:47:56 huh? 14:48:08 it's just looking to be large, is all. 14:48:20 i only know it's possible for binary numbers 14:49:08 myname: calculating modulus wrt any base can be done with an fsa. 14:49:25 and it's particularly easy for 3. 14:49:35 that doesn't mean the regex is nice. 14:49:50 (well i guess binary is even easier.) 14:50:23 it's just the digital root algorithm, really. 14:50:42 binary can easily be done with 3 states 14:51:07 you mean checking triples in binary? 14:51:16 yes 14:51:19 you only need 3 states regardless of base, anyway. 14:51:24 huh? 14:51:30 how do you do that? 14:51:36 oh 14:51:44 nvmd 14:52:52 -!- LinearInterpol has joined. 14:57:18 how does a minsky machine actually use the registers? 14:57:47 is there something like an "increment r1" state? 14:59:20 each state has like a command attached, which is either increment a register, or decrement a register and branch. 14:59:24 and maybe halt. 14:59:51 or nop, i assume 15:00:02 (well, you can simulate nop at least) 15:00:04 nop is sort of useless. 15:01:35 if a state uses nop, you can just remove it and skip directly to its target instead. 15:02:06 it will still read a char from it's input 15:02:26 um you're thinking of ordinary fsas. 15:02:33 oh 15:02:54 minsky machines don't have i/o other than the initial and final register values. 15:03:00 ah 15:03:05 that does make sense 15:06:29 http://i.imgur.com/vwbKqAK.png Any way to simplify this using only these kinds of gates? Transistors would be fine 15:06:47 Or is this the simplest design possible (using NOT, NOR and AND) 15:08:17 * oerjan managed to get the conversion for triples working 15:19:29 * oerjan tweaks it up to 519 points with cheating 15:20:53 i had 555 15:21:02 :( 15:21:05 someone told me, 630 are possible 15:21:42 okay, maybe not 15:21:56 630 should be all the words 15:23:54 oh wtf blob 15:23:57 * oerjan gives up 15:24:14 er glob 15:26:29 yeah 15:26:35 i am stuck at it, too 15:29:40 myname, oerjan what are you talking about? 15:31:17 the regexp thingy? 15:32:52 regex.alf.nu 15:33:32 FreeFull: Is that just a full adder? 15:36:32 fizzie: Yeah 15:37:59 Google pops up an arXiv paper of "Single bit full adder design using 8 transistors with novel 3 transistors XNOR gate", if that's what your "transistors would be fine" means. 15:42:30 Thanks 15:52:25 That design involves a multiplexer 16:00:46 -!- FreeFull has quit (Read error: Operation timed out). 16:03:14 Yes, made out of two transistors. 16:03:16 https://gist.github.com/jonathanmorley/8058871 has many regex.alf.nu spoilers (with total score 4069. I had 3850 or so) 16:03:39 -!- int-e_ has changed nick to int-e. 16:04:49 In the end I was annoyed by the fact that cheating wins in almost all cases. 16:04:57 09:57:51: in which case you need, let's see, five. 16:04:58 09:58:06: > 2 * 3 * 5 * 7 * 11 16:05:22 > foldl1' lcm [5,7,8,9] 16:05:23 2520 16:06:02 @localtime oerjan 16:06:03 Local time for oerjan is Sat Jan 4 17:06:03 2014 16:06:51 @tell mroman 5, 7, 8, 9 are enough. 16:06:51 Consider it noted. 16:07:18 > foldl1' lcm [5,6,7,8] 16:07:20 840 16:07:43 > foldl1' lcm [1..9] 16:07:44 2520 16:09:18 oh. there was a netsplit around that time, tsk. 16:10:05 int-e: i'm pretty sure this was after that netsplit 16:10:26 tunes.org wasn't loading. 16:10:52 still isn't. 16:11:36 Ah I failed at applying time zones correctly. Ok. 16:12:06 int-e: the paste is from codu, so utc, anyway. 16:13:45 Yes, I figured it out. The @localtime was my mistake. 16:14:27 -!- Guest37212 has quit (Changing host). 16:14:28 -!- Guest37212 has joined. 16:14:54 -!- Guest37212 has changed nick to SirCmpwn. 16:14:57 @tell mroman the clue is that if you start with a range [1..n], you can throw away all numbers that aren't the largest power of a prime. 16:14:58 Consider it noted. 16:16:32 @tell mroman hm i'm not entirely sure that always gives the smallest number of numbers. probably, though. 16:16:33 Consider it noted. 16:16:55 why wouldn't it 16:17:34 > foldl1' lcm [1..20] 16:17:35 > scanl lcm 1 [1..] 16:17:35 232792560 16:17:36 [1,1,2,6,12,60,60,420,840,2520,2520,27720,27720,360360,360360,360360,720720,... 16:17:45 oh no euler spoilers!!!!!!!! 16:18:08 nooodl: actually it doesn't. e.g. 5,6 is better than 2,3,5. 16:18:35 oh, like that 16:18:48 well, 30 is better than 5,6 16:19:19 i guess you have that [1..n] range you need to stay in 16:19:28 nooodl: yes but we also want to minimize the largest number, i think. 16:19:55 otherwise it's trivial to take just the bound you want. 16:20:29 Right, let's just compute modulo 2^64 like everybody else does. 16:20:54 420 is best got with 7*6*5. 16:21:30 @tell mroman actually not always, e.g. for x=420 you get the best by using 5,6,7. 16:21:30 Consider it noted. 16:22:56 i suspect 2*3 = 6 might be one of the few replacements that can work. 16:38:33 -!- 23LAATJIN has quit (Read error: Connection reset by peer). 16:38:53 -!- tromp_ has joined. 16:45:25 oerjan: for 4084080 (= lcm [1..17]/3) the best possible seems to be 7*11*13*15*16*17. 16:47:35 oerjan: note that you did the same thing; 7*6*5 equals 210 16:49:41 And by "the same" I mean that you also have a prime power factor that isn't maximal below a chosen n. In your case, 2 <= 7 instead of 4 <= 7. 17:00:19 oops 17:00:45 @tell mroman scratch that last one, i missed the 4 17:00:45 Consider it noted. 17:01:09 @tell mroman or well, it works for x=210. 17:01:09 Consider it noted. 17:05:29 int-e: hm well, to get all of the lcm [1..n] you obviously need to include all the prime powers as factors somewhere. 17:07:40 if you have p^i*q^j as factors where p < q, then p^(i+j) must also be a factor somewhere, which means including it with q is redundant. so you never save anything by including non-prime-powers. 17:07:58 oerjan: yes. but that lcm [1..n] sequence is very coarse. 17:08:25 yeah especially if n is prime. 17:20:52 -!- Slereah_ has joined. 17:22:55 -!- Slereah has quit (Ping timeout: 265 seconds). 17:28:48 Oh good. If the cipher mode for dm-crypt is given as -plain, the kernel translates that to -cbc-plain. I wish that fact was properly documented (I expected a hint in Documentation/device-mapper/dm-crypto.txt). 17:31:30 (man cryptsetup has such a hint: "--cipher, -c: set cipher specification string. Usually, this is "aes-cbc-plain". For pre-2.6.10 kernels, use "aes-plain" as they don’t understand the new cipher spec strings. [...]". However, I only found that after reading the kernel sources...) 17:32:55 hm 17:33:01 @messages 17:34:32 -!- boily has joined. 17:39:36 `factors 65536 17:39:38 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: factors: not found 17:39:51 how did that work again? 17:40:14 `factor 65536 17:40:15 65536: 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 17:40:20 (It's a relatively standard utility.) 17:41:09 (Not quite POSIXly standard, but part of GNU coreutils at least.) 17:41:44 -!- oerjan has quit (Quit: leaving). 17:45:05 `factors 65535 17:45:06 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: factors: not found 17:45:08 `factor 65535 17:45:10 65535: 3 5 17 257 17:47:38 `factor `echo 1` 17:47:39 factor: ``echo 1`' is not a valid positive integer 17:47:45 `eval factor `echo 1` 17:47:46 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: eval: not found 17:48:06 run? hmm. 17:48:26 `run factor `dc <<<'2 64^1+p'` 17:48:28 factor: `18446744073709551617' is too large 17:48:33 wimp. 17:51:00 Sadly, I don't think HackEgo comes with PARI/GP installed. 17:52:33 > let n=2^64+1;r x y|f>1&&f (274177,67280421310721) 17:52:48 > 274177*67280421310721 17:52:49 18446744073709551617 17:53:40 `run factor 67280421310721; factor 274177 17:53:41 67280421310721: 67280421310721 \ 274177: 274177 17:54:07 I have this strangest feeling we just factored 2^64+1 the other day, on-channel. 17:57:13 Ah, the smallest prime factor of 2^128+1 is a bit too big for Pollard's rho method to be effective. Pity. 17:59:06 > (2 ** 1 + 1) * (2 ** 2 + 1) * (2 ** 4 + 1) * (2 ** 8 + 1) 17:59:07 65535.0 17:59:32 > (2 ** 1 + 1) * (2 ** 2 + 1) * (2 ** 4 + 1) * (2 ** 8 + 1) * (2 ** 16 + 1) 17:59:33 4.294967295e9 17:59:45 -!- metasepia has joined. 17:59:57 if you'd use ^ rather than ** you'd get integer results. 18:00:21 > product [2^(2^i)+1 | i <- [0..4]] 18:00:22 4294967295 18:00:45 my Python's slipping, I can't remember which exponentiation operator to use, and I'm eating leftover coleslaw. 18:01:19 oh. it's ** in Python. 18:01:29 ^ is xor in Python 18:01:54 `run python -c 'print (2 ** 1 + 1) * (2 ** 2 + 1) * (2 ** 4 + 1) * (2 ** 8 + 1) * (2 ** 16 + 1)' 18:01:55 4294967295 18:04:17 It's Haskell that needs three operators to harness the power of exponentiation. 18:04:54 the power... or curse (flips hair dramatically) 18:05:28 I only said it for the pun. 18:05:43 oh. uh. me too 18:05:54 all I want is to exponiate, not to get mired in the Cursed Swamp of Mathematically Correct Operators. 18:06:22 > let x = 0/0 in x == x 18:06:23 False 18:07:30 > let x = 0; y = -0 in (x == y, 1/x == 1/y) 18:07:31 (True,False) 18:07:49 But to be fair, the Haskell designers didn't make up those rules. 18:07:53 Does math say -0 == 0? 18:08:04 IEEE 754 does. 18:08:24 or probably like it's with math -0 == 0 for some math and -0 <> 0 for some other math . 18:08:29 But yes, math does, too, because 0+0 = 0, so 0 is the additive inverse of 0. 18:09:45 Well, "math". This is true for any group (the neutral element is its own inverse), and in particular for the additive group in rings. 18:09:50 ~eval 0 / 0 18:09:51 NaN 18:10:07 ~eval (1 / 0, -1 / 0) 18:10:08 (Infinity,-Infinity) 18:10:58 ~eval let x = 0; y = -0 in ((x :: Int) == (y :: Int), (x :: Double) == (y :: Double)) 18:10:59 (True,True) 18:11:05 x = y -> f(x) = f(y) is something mathematicians tend to expect from equality. So that failure (= not being a congruence relation) is pretty bad. 18:11:43 equality is hard. let's do something different! 18:11:56 > 0/0 < 0 18:11:57 False 18:12:01 Eh. 18:13:21 > let x = 0/0 in (x > 1, x == 1, x < 1) 18:13:22 (False,False,False) 18:13:30 Of course dividing by 0 is also generally frowned upon, because you will necessarily lose the ring structure :) 18:15:55 @tell oerjan Btw, re-reading GG is totally worth it. There are so many small details to rediscover, not to mention some significant plot developments that I have forgotten over the years. 18:15:55 Consider it noted. 18:22:57 what's GG? 18:23:14 myname: it may be Girl Genius. hth. 18:23:32 boily: hth 18:24:08 coppro: hth. 18:24:21 > let x = 1 / 0; y = - 1 / 0 in (x > y, x < y, x == y) 18:24:23 (True,False,False) 18:32:03 boily is right as usual. 18:34:46 ~metar CYQB 18:34:47 CYQB 041800Z 03008KT 30SM FEW022 BKN080 BKN095 M18/M23 A3018 RMK SC2AC3AS2 SLP230 18:34:56 today is a hot day. -18 °C! 18:36:34 ergh 18:41:18 boily: in norway? 18:41:25 -!- AnotherTest has joined. 18:41:32 myname: in CANADA! 18:41:41 norway is warmer this time of the year. 18:41:42 h 18:42:00 "come to canada. we have great summers. last year, it was a tuesday" 18:42:21 ~metar ENGM 18:42:23 ENGM 041820Z 21007KT 9999 -DZ FEW012 SCT016 BKN025 04/04 Q0997 NOSIG 18:42:42 ~metar YMCA 18:42:43 --- Station not found! 18:43:12 ~metar KFUM 18:43:12 --- Station not found! 18:43:26 ~metar KBGR 18:43:27 KBGR 041753Z 19006KT 10SM BKN110 M13/M18 A3031 RMK AO2 SLP273 4/024 60000 T11281183 11128 21289 56039 18:43:29 ~metar SPAM 18:43:30 --- Station not found! 18:45:32 Still above zero, I suppose? 18:45:35 ~metar ESSA 18:45:35 ESSA 041820Z 23009KT 9999 SCT007 BKN010 05/04 Q1002 R01L/29//95 R08/29//95 R01R/29//95 TEMPO BKN015 18:45:52 you wimps with above-zero wintemperatures... 18:47:09 Almost all of december has been considerably warmer than average 18:47:29 http://www.smhi.se/klimatdata/meteorologi/2.1353/dailyTable.php?par=tmpAvvDay&yr=2013&mon=12 18:49:17 wow, 10 degrees warmer than normal in almost all of norrland 18:50:13 Yeah.. 18:56:41 It's very strange. 18:56:44 ~metar EFHK 18:56:47 EFHK 041850Z 13008KT 6000 -RASN BKN003 01/01 Q1004 NOSIG 18:57:13 The newspaper said Russian tourists (of which there are many this time of year) have been very disappointed with the mild weather. 18:57:49 ~metar IKEA 18:57:50 --- Station not found! 19:01:29 ~metar ETLA 19:01:30 --- Station not found! 19:09:27 -!- Zuu has quit (Ping timeout: 245 seconds). 19:11:51 -!- Zuu has joined. 19:13:35 -!- FreeFull has joined. 19:19:31 -!- FreeFull has quit (Ping timeout: 272 seconds). 19:23:16 -!- MindlessDrone has quit (Quit: MindlessDrone). 19:29:47 ~metar ZERO 19:29:47 --- Station not found! 19:29:55 -!- FreeFull has joined. 19:33:53 -!- FreeFull has quit (Read error: Connection reset by peer). 19:41:05 -!- doesthiswork has joined. 19:41:23 the most recent oots was most excellent 19:42:14 -!- impomatic has quit (Ping timeout: 264 seconds). 20:07:11 IOCCC! → http://ioccc.org/years.html?a=123 20:07:29 * Bike glances meaningfully at topic 20:11:17 * boily glances at himself... 20:11:29 /clear! /clear! /abort! /time-travel! 20:32:38 meanwhile, my mind is completely twisted by misaka. 20:33:13 fair enough 20:34:51 holy. horizontal. tiling. 20:36:31 -!- jconn has quit (Ping timeout: 272 seconds). 21:08:16 -!- jconn has joined. 21:23:04 kmc: i like the haskell variation where main :: String and all the rts does is evaluate it and print it to stdout 21:23:12 lol 21:23:36 i think that clarifies the "execution vs. evaluation" thing out of existence 21:24:08 -!- nisstyre has quit (Quit: Leaving). 21:40:31 -!- shachaf has quit (Changing host). 21:40:31 -!- shachaf has joined. 21:46:09 -!- AnotherTest has quit (Ping timeout: 252 seconds). 22:08:24 -!- boily has quit (Quit: CRYPTIC CHICKEN). 22:08:26 -!- metasepia has quit (Remote host closed the connection). 22:14:23 -!- LinearInterpol has quit (Read error: Connection timed out). 22:15:30 -!- LinearInterpol has joined. 22:19:33 -!- FreeFull has joined. 22:19:54 -!- ^v has joined. 22:20:11 -!- TodPunk has quit (Quit: This is me, signing off. Probably rebooting or something.). 22:26:34 -!- ^v has quit (Remote host closed the connection). 22:34:02 -!- LinearInterpol has quit (Read error: Connection timed out). 22:35:16 -!- LinearInterpol has joined. 22:36:41 -!- Jafet has joined. 22:36:53 -!- FreeFull_ has joined. 22:37:28 -!- FreeFull has quit (Ping timeout: 246 seconds). 22:41:48 -!- TodPunk has joined. 23:10:42 -!- carado has joined. 23:20:56 -!- doesthiswork has quit (Quit: Leaving.). 23:38:12 -!- Bike has quit (Ping timeout: 245 seconds). 23:43:49 -!- Phantom_Hoover has quit (Read error: Connection reset by peer). 23:48:05 -!- LinearInterpol has quit (Read error: Connection timed out). 23:49:07 -!- LinearInterpol has joined. 23:51:23 -!- oerjan has joined. 23:52:17 @messages-gouda 23:52:18 int-e said 5h 36m 22s ago: Btw, re-reading GG is totally worth it. There are so many small details to rediscover, not to mention some significant plot developments that I have forgotten over the years. 23:53:24 -!- Bike has joined. 2014-01-05: 00:03:03 i like gouda 00:06:53 @tell boily norway is warmer this time of the year. <-- incidentally i saw in the newspaper that the night before yesterday was the fourth hottest january night ever measured (by minimum temperature) in trondheim. (it was 5.1 celsius.) 00:06:53 Consider it noted. 00:08:12 5.1 celsius is p. cold 00:08:21 @tell boily http://www.adressa.no/vaeret/article8897643.ece 00:08:22 Consider it noted. 00:09:52 shachaf: you californians are p. spoiled 00:10:10 wait am i a californian now 00:10:39 i'd hazard a guess israelis are p. spoiled about temperature too 00:11:31 look the point is, why are you even in trondheim when it's so inhuman there 00:11:35 and a proper finn would never call 5.1 celsius cold. 00:12:32 when i was last in helsinki it was ~30°C 00:12:37 too hot imo 00:12:45 tru dat. 00:13:02 Second half of December in Finland was the warmest ever in statistics starting from 1961. 00:13:31 what if you put some flour in your hair and moved to california 00:13:58 that's more sensible than calling people spoiled imo 00:14:03 the highest temperature ever measured in norway was 35.6°C 00:15:56 They did have -39.7 °C in December somewhere up north though. 00:16:13 this year? 00:17:01 Last year. It hasn't been December this year yet. 00:17:18 meh, slow year 00:17:55 -!- nisstyre has joined. 00:19:16 depends on where you let start your year 00:19:35 i mean, if america starts a week on sunday, why not start a year in december? 00:22:05 In fact, whole 2013 was the sixth warmest in the 1847..2013 range. (Top 5 has 1938, 1989, 2011, 2000, 1934.) 00:23:19 -!- augur has quit (Read error: Connection reset by peer). 00:23:56 in Europe in the Middle Ages, the year generally started on 25 March 00:23:59 https://en.wikipedia.org/wiki/New_Year#Historical_Christian_new_year_dates 00:24:24 kmc: perfect 00:24:31 or sometimes on Easter, never mind that the date of easter moves back and forth 00:24:34 'same date could occur twice in a year; the two occurrences were distinguished as "before Easter" and "after Easter".' 00:24:35 also, there were a december this fiscal year 00:25:10 January 1 is the Feast of the Circumcision of Christ 00:25:16 religion is creepy 00:25:21 sunday is the sensible day to start the week 00:25:27 america starts it on monday 00:25:40 oh 00:25:50 who starts on sunday, then? 00:25:58 The American convention is Sunday. 00:26:05 ISO starts it on Monday 00:26:12 are you gonna argue with ISO 00:26:30 imo it starts on sunday 00:26:35 are you gonna argue with IMO 00:26:36 Monday is the first day in most of continental Europe, as far as I'm aware. 00:26:41 why argue with ISO when you can simply ignore them completely 00:27:17 america has been strong in ignoring standards for ages 00:30:00 -!- augur has joined. 00:31:59 Week numbers: worst things. (Even agreeing on the start day doesn't guarantee those.) 00:32:57 at least there is no $[ in there 00:33:42 "World map showing first day of week used in different countries Saturday Sunday Monday Wednesday (questionable) 00:33:57 Last one sounds good. 00:34:21 wtf wednesday? 00:34:26 wednesday is questionable 00:34:44 i mean, in german it's practically named "midweek" 00:34:53 how the hell can a week start at that 00:35:51 It's "midweek" in Finnish too. 00:36:29 where live these crazy people? 00:36:37 odin's day 00:36:42 swedish also has "wednesday" (but spelled onsdag) 00:37:54 Apparently it's just wrong. (The map had Hungary marked with Wednesday.) 00:40:16 -!- ^v has joined. 00:40:24 ISO week numbers have Monday as first day, and the week is associated with the year that contains the Thursday of that week, but: "In some countries, though, the numbering system is different from the ISO standard. At least six numberings are in use: --" 00:41:06 great thing about standards 00:44:10 "In Scandinavian countries, Saturday is called lördag, "lørdag," or laurdag, the name being derived from the old word laugr/laug (hence Icelandic name Laugardagur), meaning bath, thus Lördag equates to bath-day. This is due to the Viking practice of bathing on Saturdays.[citation needed]" 00:44:33 That last bit was somehow amusing. 00:44:50 (It's "lauantai" in Finnish.) 00:45:12 indeed I bathed today (earlier today when it was saturday) 00:45:24 Vikings are well-known for their bathing habits. 00:46:41 I did, too; we have a sauna reservation on Saturday, which I think is p. typical. (Though it's v. possible a private sauna would be even more typical; haven't seen statistics.) 00:48:23 Statistics Finland's page is not loading. :/ 00:49:12 myname: wednesday as midweek only makes sense if the week starts on sunday 00:49:46 shachaf: It makes perfect sense when week starts on Monday, because Saturday and Sunday don't count. 00:49:48 shachaf: depends 00:49:56 exactly 00:50:47 have you considered that you don't count (properly) 00:51:03 also hebrew gives better evidence for it 00:51:14 in hebrew sunday is called firstday and monday is called secondday and so on 00:51:19 why? my week ends on friday :p 00:51:22 Bah, this page only has statistics for numbers of buildings. 00:51:29 shachaf: sensible 00:52:00 shachaf: must drive programmers crazy 00:53:39 why 00:54:35 Apparently, in 2012, there are approximately 1555000 saunas "in flats", and 2579781 "household-dwelling units" in general. So (assuming the contribution of multiple-sauna dwellings as negligible) I guess it would logically follow that it's more common to have a sauna than not. 00:55:01 well, i mean, why would you not have a sauna 00:55:26 I wonder if I could get a sauna put in my flat, or if it requires special infrastructure 00:55:27 Because of money, I guess. 00:55:43 I believe it requires rather similar infrastructure as a bathroom. 00:56:10 my grandmother has a sauna in her house in .il 00:56:15 less common, i imagine 00:56:46 (We don't have a sauna here, probably because it wasn't as common as it nowadays is to put private ones in, back in 1984 when this building was builded.) 00:58:07 Having one does take up some floor space. Though the ones they put in small apartments are really very tiny. 00:58:24 The sort of things that will be very crowded if you try to have more than two people in at the same time. 00:59:03 imo you gotta have your own lake, too 00:59:44 There are 187888 lakes (definition: >500 square metres) in Finland, so we'd have to kill a lot of people to achieve that. 00:59:44 maybe you could use your bathtub as the lake and have a foldable sauna you can use to convert the rest of the bathroom into a sauna 01:00:24 I guess we could dig out more lakes, too. 01:00:35 The killing solution just sounded occurred to me first. 01:01:36 maybe you can consider a 1000 square metre lake to be two adjacent 500 square metre lakes 01:05:01 Hmm, that would work. 01:05:56 According to W|A, there's 34330 km^2 of lakes in Finland, so divided to 5.42 million people, that's about 6334 square metres. 01:06:11 Enough to give everyone up to 12 lakes. 01:06:25 well 01:06:36 i think everyone should get some shore as well 01:07:38 Oh no, the shoreline problem. 01:08:07 it is difficult to have a sauna by the lake when all you have is lake 01:08:57 I asked for "shoreline in Finland", but I think it's interpreting that as the coastline bordering the sea, or something. (On the other hand, I learned that 1250 km is "0.78 × distance the Proclaimers would walk, just to be the man that walks a thousand miles to fall down at your door". 01:09:08 (The distance being a thousand miles.) 01:09:23 ) 01:09:42 (The comparisons of W|A are frequently very useful.) 01:10:21 78 centimiles 01:10:22 -!- zzo38 has quit (Remote host closed the connection). 01:11:39 I think I'll make like a Proclaimer and walk (a shorter distance) to fall asleep now. (Nights.) 01:13:46 wait, i meant centikilomiles 01:14:41 decamiles? 01:25:38 I wonder if I should eat (because it's dinner time) or sleep (because it's bedtime) 01:28:24 I may ban everyone who tries to argue that the week starts on Sunday 01:28:51 itt elliott proves he's an antisemite 01:35:24 -!- FreeFull_ has changed nick to FreeFull. 01:40:31 -!- Sprocklem has quit (Ping timeout: 272 seconds). 02:06:46 -!- nisstyre has quit (Quit: Leaving). 02:07:39 -!- nisstyre has joined. 02:19:51 -!- Froox has quit (Ping timeout: 246 seconds). 02:22:02 -!- Frooxius has joined. 02:27:38 -!- Bike has quit (Ping timeout: 265 seconds). 02:29:05 -!- Bike has joined. 02:32:27 -!- zzo38 has joined. 02:38:03 -!- Bike has quit (Ping timeout: 272 seconds). 02:39:26 -!- Bike has joined. 02:43:14 -!- oerjan has quit (Quit: pnyte). 02:43:16 -!- yorick has quit (Remote host closed the connection). 02:57:30 -!- Sorella has quit (Quit: It is tiem!). 03:04:09 -!- Sprocklem has joined. 03:11:30 o.O 03:11:42 I didn't realize new BOFH stories are being produced 03:15:53 -!- augur_ has joined. 03:18:05 -!- augur has quit (Disconnected by services). 03:18:09 -!- augur_ has changed nick to augur. 03:38:31 does anyone know about weird-ass linux boot errors 03:39:03 this thing is telling me "Firmware Bug" and then.. i think it's crashing trying to look at an empty hard drive, which dumps me into ramfs, but it can't get a tty so i can't even tell it to die 03:40:12 huh, some kernel bug. weird. i wonder why the recovery linux works then 03:50:59 -!- doesthiswork has joined. 03:58:54 what the hell is shutdown -k for, i love it 04:13:44 -!- nooodl has quit (Quit: Ik ga weg). 04:24:02 haha 04:37:12 -!- mauke has quit (Disconnected by services). 04:37:22 -!- mauke has joined. 04:39:04 -!- preflex_ has joined. 04:40:25 -!- preflex has quit (Ping timeout: 272 seconds). 04:40:27 -!- preflex_ has changed nick to preflex. 04:44:31 -!- _46bit_ has quit (Quit: Crunk.). 04:45:42 -!- _46bit has joined. 05:10:26 -!- carado has quit (Ping timeout: 264 seconds). 05:14:37 -!- carado has joined. 05:22:26 -!- carado has quit (Ping timeout: 264 seconds). 05:30:52 -!- Sprocklem has quit (Ping timeout: 260 seconds). 05:32:14 -!- myndzi\ has joined. 05:33:26 -!- myndzi has quit (Ping timeout: 240 seconds). 05:36:12 -!- myndzi has joined. 05:44:14 -!- carado has joined. 06:13:31 -!- tromp has quit (Ping timeout: 246 seconds). 06:14:02 -!- LinearInterpol has quit (Ping timeout: 264 seconds). 06:14:59 -!- tromp has joined. 06:32:19 NOTES: 06:32:21 Shutdown wasn't designed to be run setuid. 06:32:34 ...uhm. 06:32:51 hm, mine doesn't have that. 06:33:16 actually i think this ubuntu one is a totally different implementation from the arch one, how odd 06:34:06 which i guess has to do with ubuntu doing some total other thiing with initd, well, whatever 07:02:58 I have more idea of some kind of computer game based on something I have dreamt of. Do you have any such things? 07:04:58 i thought of basing a game on dreams once. 07:05:01 -!- tromp_ has quit (Remote host closed the connection). 07:05:31 Can you please be more specific? 07:05:36 -!- tromp_ has joined. 07:06:13 a game with a framing story of invading dreams somehow (Paprika ish, probably) used to exhibit real people's dreams in FPS form. 07:09:28 Ah, OK. My ideas isn't like that; it is simply using things I have dreamt as ideas. 07:09:54 right. but it seemed related. 07:10:03 Yes, that's OK. 07:10:26 -!- tromp_ has quit (Ping timeout: 264 seconds). 07:18:15 -!- nisstyre has quit (Quit: Leaving). 07:22:02 -!- ski_ has quit (Quit: Lost terminal). 07:29:12 -!- FreeFull_ has joined. 07:30:01 Can you perhaps give an example of how you would do that? 07:31:07 -!- FreeFull has quit (Ping timeout: 245 seconds). 07:31:14 i had a friend with a dream where she was picked up by robots and told to run obstacle courses, so that they could study humn behavior; bam, tutorial level 07:31:50 sounds a lot like psychonauts to me 07:48:57 -!- FreeFull_ has quit (Ping timeout: 252 seconds). 07:59:13 -!- FreeFull has joined. 07:59:56 I can tell you what one of my ideas is, though. You can gain (and change) your affiliation with various organizations during the game, such as the evil "The Core", or one of the three factions that secretly work for them; or the four small intelligent insects (two red and two blue) who are against them, and can eat the inside of your body and brain a little bit. Eventually they can grow much larger (almost as big as people) and wings to fly; ... 08:00:54 ... if big then it is a great help to you to stop "The Core", too. Or, you can play as the insectoid character, which is like another game, even though it is the same game. And then there can be even more confusing circumstances involved in the situations!!!! 08:01:48 the game of confusing circumstances involved in situations 08:03:12 zzo38: i think i might like this game! 08:03:30 Jafet: that's an important note 08:04:01 translation "shutdown is not necessarily a secure piece of software. If you setuid it, attackers may do other things" 08:06:39 quintopia: Yes, maybe, but I don't actually have much more idea than just what I wrote now. 08:07:26 oh 08:08:41 Well, there is one more thing. I also dreamt that such evil organizations was in the same building as a clothing store (maybe as a kind of front), and for some reason there was the situation where for "cosmic balance" or something like that, we had to accelerate the rack hanging shirts while riding it, once we reach the middle we must turn it around immediately and decelerate all the way to the other side until it stops. 08:08:51 However, it wouldn't stop... 08:09:44 So such a thing could be worked into a game too, but it can also be made not to. 08:09:51 Maybe it doesn't help. 08:09:55 yeah it makes little sense 08:10:58 I know it isn't sensible. 08:13:02 The other ideas above seems more likely to work, though. But still I don't have much more idea to actually program in such things. 08:13:24 well 08:13:34 if you wanted to 08:13:40 you could come up with something 08:13:46 just think about it hard enough 08:14:02 Yes, I might be able to do so in future 08:14:19 Do *you* have any better ideas? 08:15:04 i am sometimes working on a puzzle game 08:15:20 What kind of puzzle game? 08:15:42 -!- FreeFull has quit (Ping timeout: 245 seconds). 08:17:06 it's about santa's elves going on strike. so santa gets conned into replacing them with robots that run on rails. and the player is stuck with the task of designing the rails and switches so that the toys get put together correctly. 08:17:15 OK 08:18:38 so it would be a manufactoria sort of game, but less turing-complete (no queue) 08:24:49 If I ever do make a game based on what I wrote about what I dreamt (the first one, not the second unsensible one), then I can show you. But, I might not. Nevertheless, there are several other idea possibility. 08:25:21 how much time a day do you usually spend building software 08:26:58 -!- ^v has quit (Remote host closed the connection). 08:27:27 I don't know. 08:42:56 Can Zerocoin keys be transmitted using separate channels? 08:57:16 presumably 08:57:37 but there's not really a need for it 08:58:15 instead, just reclaim your zerocoin as btc, and immediately give it to whomever in the usual way 08:58:34 anonymity is maintained as long as you do the claiming with a new address 08:59:32 -!- FreeFull has joined. 08:59:33 -!- FreeFull has quit (Changing host). 08:59:33 -!- FreeFull has joined. 09:06:50 But would it simplify something in any way if in a way that would still work OK? 09:08:25 You would still need time to verify the transaction, for sure, though. 09:13:46 I'm not sure what ways there are to do what things, since it seem to me a good idea would be to design the system to allow transmissions on separate channels 09:33:52 but you already can 09:34:18 just hand out the private key of the zerocoin transaction you made 09:59:55 I am just wondering how much privacy issues there are from such thing; maybe it depends on who uses it? 10:01:10 Do you know about CipherSaber? 10:01:18 well, the point of zerocoin is to remain anonymous, and if you transfer zerocin via a side channel, you are deanonymizing yourself to the person you give it to 10:01:34 no i'll look it up 10:02:01 -!- FreeFull has quit (Ping timeout: 272 seconds). 10:02:16 CipherSaber is a variant of ARCFOUR with a ten-byte initialization vector and the key setup repeated a secret number of times too (this secret number would be part of the key). 10:03:09 -!- FreeFull has joined. 10:05:02 right 10:05:22 it appears to be a specific RC4 implementation. no biggie. 10:07:05 I have used RC4 as nothing more than a random number generator, and this seems to work; it also isn't too difficult to implement in a 6502, although it uses up a large amount of the RAM in systems such as NES/Famicom. 10:08:32 I want to implement a good quality random number generator for the RANDOM instruction of the Z-machine, but I don't have 256 bytes of RAM remaining which can be used for this purpose; almost all of the RAM is already used (and that includes the 64K RAM in the cartridge, too!) 10:08:36 doesn't seem like famicom would have much need for encryption 10:09:05 ohhhhhh 10:09:25 Yes, it is true, but I just wanted to implement a good quality random number generator; cryptographic quality is not necessary but it does have to be *good* quality. 10:10:27 so have you considered and rejected LCGs? 10:10:35 they certainly use very little memory 10:11:43 Are they good enough? 10:12:29 I don't expect it to be good enough. 10:12:40 i don't know what good enough means to you 10:12:48 -!- carado_ has joined. 10:12:55 -!- carado has quit (Ping timeout: 245 seconds). 10:13:08 LFSRs can be computed in the same amount of memory but take longer to compute, but have better randomness properties 10:13:30 -!- carado_ has quit (Client Quit). 10:13:54 Random numbers shouldn't need to be generated too often. 10:14:16 why? 10:15:48 Probably in any Z-machine games it won't be generated a lot of random numbers each turn, but it need to be at least reasonably fast, but not a lot like other things are. 10:16:47 Note that the time could also be used as an input to the random number generator; the results don't have to be predictable. 10:16:48 then i think LFSR will be good enough. 10:18:37 OK, I hope so 10:18:42 I can try. 10:20:17 It could be combined with a time counter increasing every frame, and then it need to know how many bits of output are needed and then if the number is too high after masking out the unneeded bits, try again. 10:21:53 sounds good 10:22:21 using XOR to combine with time i assume? 10:23:17 -!- AnotherTest has joined. 10:24:16 Z machine on a famicom? 10:24:18 Note that there is actually a LFSR in the 2A03 (the CPU for the Famicom), however the program cannot read it unless pin 30 is high, in which case the I/O ports stop working, and anyways pin 30 is internally hardwired to ground and cannot be changed. It *is* output to the cartridge, but no cartridge does anything with it except to output it to the audio. 10:25:01 Jafet: Yes, I made up much of it already, but not division and random numbers. http://wiki.nesdev.com/w/index.php/User:Zzo38/Famicom_Z-machine You can read the coding so far 10:26:09 You can use a multiply-with-carry generator, I don't know if it will fit in 256 bytes (of code?) 10:26:28 Jafet: The code can be put in ROM; it doesn't need to fit in RAM. 10:26:53 I can implement it in software, though. I didn't intend to use XOR, but rather subtraction, to do the combine, however; and the number need to be 15-bits but a 16-bits LFSR could be used. 10:26:54 Though the small word size of the 6502 may be a problem. 10:27:12 That would slow it down a bit, yes. 10:28:11 Maybe the multiplication would be better using the Russian algorithm; would this be better or not, than what I have? 10:28:30 (I mean for the MUL instruction, not for random number generators) 10:28:39 And yet I would still require division/modulo 10:31:31 As well as an efficient way to lookup in the vocabulary (which could be preprocessed using a separate program if it would help; there is probably enough ROM space for such a thing) 10:35:24 Also please notify me if you found anything wrong with the program so far 10:41:54 -!- doesthiswork has quit (Quit: Leaving.). 10:43:42 -!- MindlessDrone has joined. 10:50:00 I noticed a C code for LFSR in Wikipedia. However, in a GNU C program, you might use __builtin_parity, would that work better? (Or you can use __builtin_parityll if you need more bits) 11:04:26 -!- carado has joined. 11:04:36 -!- carado has quit (Client Quit). 11:12:53 The 6502 does not have a division instruction? 11:14:00 Oh, it's *that* old. 11:17:33 SPARC doesn't have a division instruction either. 11:18:02 (And it's a not-that-old "real" processor.) 11:18:20 I guess it might have a floating-point division, though. 11:19:21 (Or, to be more exact, a SPARC might commonly come with a FPU that does division.) 11:23:16 Yes, 6502 has no multiplication or division instruction. 11:23:17 -!- gully_foil_Ja has joined. 11:23:47 (Although the MMC5 cartridge does include a hardware register for multiplication.) 11:27:16 http://img.pr0gramm.com/2012/07/tfcu4.png 11:27:52 The ARM in the Nintendo DS has a hardware integer multiplication (and multiply-accumulate) instruction, but no division; however, the DS adds a separate memory-mapped (64- and 32-bit) integer division and square-root device. 11:28:32 -!- FreeFull has quit (Quit: Regaining my lost channels). 11:29:03 -!- FreeFull has joined. 11:31:08 Yes, that is true even as early as ARMv2, I think; it has multiplication but not division instruction. 11:31:26 ion: wondering what linux looks like at this 11:33:29 myname: http://ecx.images-amazon.com/images/I/518UgTYS4UL._SY300_.jpg perhaps? 11:35:13 not unlikely 11:40:39 -!- AwfulProgrammer_ has joined. 11:54:02 -!- Zerker has joined. 11:57:55 -!- Sorella has joined. 12:16:23 -!- sebbu has quit (Ping timeout: 245 seconds). 12:21:11 There is article in Esolang wiki relating to some Japanese book. However, it mentions "Starry" and "Bolic", which are red links. 12:21:43 multiplication? the 6502 doesn't even have proper shift instructions. 12:22:27 b_jonas: The 6502 can shift one at a time, although there isn't any arithmetic right shift. 12:23:30 zzo38: exactly 12:23:46 -!- sebbu has joined. 12:24:33 -!- sebbu has quit (Changing host). 12:24:33 -!- sebbu has joined. 12:25:19 You can fake it, though, for example CMP #$80 ROR A (I think) 12:25:42 Multiplication is quite a lot to ask. Z80 doesn't have it either. 12:25:46 zzo38: something like that, yes 12:26:20 mind you, even 386 didn't have a fast multiplication 12:26:31 it did have a multiplication instruction but it took ages 12:27:00 it was only later, near the pentiums, when they added a multiplication circuit so we can now perform multiplication fast 12:36:43 -!- sebbu2 has joined. 12:36:47 -!- sebbu has quit (Ping timeout: 252 seconds). 12:37:11 -!- sebbu2 has quit (Changing host). 12:37:11 -!- sebbu2 has joined. 12:37:12 -!- sebbu2 has changed nick to sebbu. 12:45:50 Also looking at that Japanese stuff, it reveals another esolang, called "Smile", which also isn't in the wiki. https://github.com/yhara/smile The implementation appears to be incomplete. 12:47:58 Shouldn't a "semicolon" just be a single dot, anyway? 12:49:11 (The Finnish name translates literally to "half-dot", incidentally, which is equally illogical.) 12:52:23 I would think "semicolon" and "half-dot" names are due to their function rather than writing. 12:57:00 -!- yorick has joined. 12:57:21 This Japanese stuff, in addition to Bolic, Starry, and Smile, also mentions HSQ9+ which is HQ9+ with the "S" command to display the steam locomotive (like the "sl" command in some UNIX systems), and Uncontrollable, a brainfuck equivalent using words that mean control structures in Ruby and other programming languages. 12:57:33 -!- Zerker has quit (Remote host closed the connection). 12:58:46 -!- Zerker has joined. 12:58:50 i wonder if we will have ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789+~ eventually 12:59:27 8 will print "88 bottles of beers" 12:59:52 of course not, 8 is clearly conways game of life 13:13:01 -!- Zerker has quit (Quit: Colloquy for iPad - Timeout (10 minutes)). 13:13:08 http://mauke.hopto.org/stuff/perl/hq9+.pl - good old usenet signature 13:19:29 -!- oerjan has joined. 13:21:46 -!- gully_foil_Ja has quit (Quit: has left chat). 13:26:52 -!- LinearInterpol has joined. 13:31:22 -!- pikhq has quit (*.net *.split). 13:31:29 -!- pikhq has joined. 13:43:29 zzo38: I wonder if there are any other published books about esolangs? 13:45:46 -!- nooodl has joined. 13:59:19 FireFly: I don't know, but I have read a magazine article once about it (I forget which). 14:04:34 There is article in Esolang wiki relating to some Japanese book. However, it mentions "Starry" and "Bolic", which are red links. <-- yeah we are clearly missing some japanese stuff. the only reason we have KEMURI is that i used google translate on wikipedia's japanese esolang page once. 14:11:27 Brainfuck has probably been mentioned in MEDIA many times. 14:11:52 I vaguely recall some kind of a mention in some Finnish computer magazine. 14:16:22 -!- AwfulProgrammer_ has changed nick to AwfulProgrammer. 14:19:38 i'll look into Starry 14:21:00 ah, there's a ruby implementation on yhara's book's site 14:23:26 Some Japanese stuff I have added myself too though 14:23:46 I am once more not in Hexham 14:24:24 (But I didn't use Google translation; I can read a little bit Japanese, and some may have partial English documentation, and can see the C or Ruby implementations) 14:35:13 Taneb: I guess you still carry an intangible bit of Hexham with you, in your heart? 14:35:51 Yeah 14:35:55 Also I stole the abbey 14:36:18 you can take the Taneb out of Hexham but you can't take the Hexham out of Taneb 14:36:38 I'm starting a collection of old churches 14:37:10 The oldest church I've been in would either be Hexham Abbey, York Minster, or the Colosseum 14:37:34 Or the Pantheon 14:47:10 Panteon, that's the one with the hole in the dome? 14:47:34 Aye 14:48:50 Hexham Abbey is the only one that started out Christian and stayed Christian 14:49:28 What's the York one started as? 14:49:40 Roman, I think 14:49:46 And it had a bit when it was Norse 15:09:25 -!- tromp_ has joined. 15:17:59 http://esolangs.org/wiki/Starry there 15:31:48 -!- Chillectual has joined. 15:34:49 http://lyrics.in.th/17527 http://youtu.be/ArvmQBEkzWw 15:34:58 -!- LinearInterpol has quit (Ping timeout: 265 seconds). 16:02:01 i grammar 16:06:50 -!- Chillectual has quit (Read error: Connection timed out). 16:08:53 -!- ais523 has joined. 16:09:01 -!- Chillectual has joined. 16:14:48 -!- Phantom_Hoover has joined. 16:22:33 -!- oerjan has quit (Quit: leaving). 16:46:03 why does endoh3's hint make such a big deal about "what is 89/84?????" it being a number that's being multiplied by and it being a program to output sounds based on note names, it's obviously a "good enough" approximation of the 12th root of 2. 16:49:09 I don't really see a "big deal" about it. 16:49:41 I mean, there's a single bullet point about it. 16:50:01 (With a single question mark.) 16:50:26 scale=10; (89/84)^12=2.0013758126 16:50:28 That's pretty good 16:50:58 The hint file mentions a thing that's useful for finding rational approximations, too. 16:51:00 hmm i thought i'd seen it in there twice, but it turns out i had seen it in the spoiler (because i still haven't unrot13'd it) and considered that the second time 16:51:03 scale=10; ((89/84)^12 - 2)/2 * 100 16:51:40 It's kind of spoiled in the spoiler, but that's presumably why it's called a spoiler. 16:51:59 It's off by only 0.06879% 16:52:06 rot13 isn't good for hiding numerical spoilers 16:52:12 Also the cbj(2, 1.0 / 12.0) part isn't terribly well-protec... right, that. 16:52:17 When brought back, anyway 16:53:08 Actually, it's off by less than that 16:53:23 fizzie: i still don't know what a stern-brocot tree is. should i look it up 16:53:30 0.00573% off 16:53:42 That's a very good approximation of 2^(1/12) 16:53:47 quintopia: Spoiler: it's something that can be useful for locating approximations. 16:54:33 fizzie: i figured as much. but is it interesting enough to spend minutes on? could i use it to prove that phi is the most irrational number? 16:54:41 What are we talking about anyway? 16:54:42 It's also a binary tree that has every (positive) rational number in it, which is maybe funky? 16:54:51 hmm 16:54:52 quintopia: What does most irrational mean? 16:55:40 > (196/185)^12 16:55:42 1.999917660227735 16:56:12 > (89/84)^12 16:56:13 2.0013758132105313 16:56:27 FreeFull: something like "for any large enough given length denominator, the best approximation of phi with denominators of that length will be worse than the best approximations of any other irrational number" 16:57:09 quintopia: That sounds like a very difficult and significant thing to prove 16:57:27 FreeFull: i certainly haven't learned how yet 16:57:30 Let's think of some irrational numbers 16:57:38 Any square root of a prime 16:57:43 The fixed point of cos 16:57:53 e, pi and phi 16:58:17 Hmm, I wonder if the non-zero fixed points of tan are irrational 16:58:28 FreeFull: they are 16:58:45 FreeFull: also, the entire sequence of golden sections and silver sections 16:59:08 Most multiples of irrational numbers are irrational 16:59:29 not the multiples 16:59:46 I know, just enumerating more irrationals 17:01:01 All transcendental numbers are irrational, I believe. 17:01:10 That is true 17:01:13 Rational approximations are intimately related to continued fractions, and 1/(1+1/(1+1/(1+ ... ))) = phi has a tail of 1s which is about the worst that can happen. (Cutting the continued fraction off just before a large number typically results in good approximations.) 17:01:34 It's even harder to prove something is transcendental though 17:02:13 int-e: You can convert many continued fractions into recursive relations and solve them 17:02:30 So there, you'd get 1/(1+phi) = phi 17:02:53 FreeFull: Yes. But that's besides the point, since phi itself is not rational. 17:02:53 Given #esoteric, I guess it's mandatory to also mention Chaitin's constant. 17:02:53 Or is that right 17:03:37 fizzie: We can't even give an approximation for that 17:03:40 if you truncate the continued fraction you get rational approximations of phi: 0/1, 1/1, 1/2, 2/3, 3/5, 5/8, 8/13, 13/21, etc. 17:04:08 int-e: Isn't that 1/phi? 17:04:16 FreeFull: You can always give an approximation, it just might not be any good. 17:04:17 FreeFull: right. 17:04:51 FreeFull: the solution to your recurrence relation (as a sequence) is F_{n+1}/F_n 17:05:00 fizzie: We can't even tell how good an approximation is though 17:05:07 `unicode DARK BLACK HEART 17:05:12 Unknown character. 17:05:18 hmm 17:05:33 FreeFull: Well, 1/2 is not more than 1/2 away. 17:05:47 fizzie: Levy's constant :D 17:06:10 FreeFull: But 1+1/(1+1/(1+1/(1+ ... ))) is almost the same. 1/1, 2/1, 3/2, 5/3, 8/5, 13/8 etc. 17:06:25 let's list definable numbers with nonfinite descriptions 17:06:30 13/8 is a nice time signature. 17:07:12 ion: i know a rock song in 13/8, that wasn't broken in the way that led zeppelin's drummer broke nice time signatures 17:07:12 1/(1+phi) = phi 1 = (1+phi)phi 1 = phi + phi^2 phi^2 + phi + 1 = 0 (phi + 1/2)^2 - 1/4 + 1 = 0 (phi + 1/2)^2 = -3/4 phi + 1/2 = sqrt(-3/4) I did something wrong 17:07:23 phi + 1/2 doesn't have a complex part ): 17:07:42 1 = phi + phi^2 phi^2 + phi + 1 = 0 17:07:48 you mean -1 17:07:50 Ah, right 17:08:00 Yeah, that solves the minus problem 17:08:46 phi^2 + phi - 1 = 0 (phi + 1/2)^2 - 1/4 - 1 = 0 phi + 1/2 = sqrt(5)/2 phi = (sqrt(5) + 1)/2 17:08:49 Yay 17:08:56 pi = 3 + 1/(7+1/(15+(1/(1+1/(292+...)))) gives the great approximation 355/113 of pi. (Off by about 1/3748629) 17:09:06 I was worried I might get 1/phi instead by accident 17:09:07 fizzie: do you know any definable numbers with (only) infinite descriptions? 17:09:15 where 355/113 = 3+1/(7+1/(15+1/1)) 17:09:43 int-e: didn't the ancient chinese know that approximation? 17:12:50 I wouldn't be surprised if they did. 17:16:02 The easiest way to approximate pi is to draw a circle and measure it 17:17:23 i assume the other silver sections are the ones with continued fractions [2,2,2,2,2,2,2,2,...] and [3,3,3,3,3,3,3,3,3,3,...] etc. 17:18:13 -!- Chillectual has changed nick to LinearInterpol. 17:18:30 Oh, I know what I did 17:18:33 so 1+sqrt(2) 17:18:35 is one 17:18:40 I did the square root without putting in ± 17:18:41 (the first one) 17:19:36 quintopia: https://en.wikipedia.org/wiki/Tsu_Chung-Chih 17:19:56 "He obtained the result by approximating a circle with a 12,288 (= 2^12 × 3) sided polygon" 17:20:00 FreeFull: making a circle and measuring it seems a lot more difficult than writing a program that generates a sequence that converges to pi, and kill the program when it gets close enough 17:30:29 quintopia: Try doing that when you find yourself stuck 3000 years in the past 17:30:33 does unicode contain rod numerals? 17:31:56 𝍠𝍡𝍢𝍣𝍤𝍥𝍦𝍧𝍨𝍩𝍪𝍫𝍬𝍭𝍮𝍯𝍰𝍱 These? 17:32:01 FreeFull: you said easiest. you didn't say easiest on pen and paper. nonetheless, i could do so, and it would still probably get good approximations faster than making and measuring a circle 17:32:13 FreeFull: those aren't in my font 17:33:01 quintopia: I never mentioned pen and paper 17:33:27 good morning 17:33:31 ...i'm pretty sure i just said you didn't say that :P 17:33:32 fungot: good morning 17:33:32 kmc: hmm... my fnord bad enough already. :) at least fnord.) 17:33:52 but you can do as well with brush and paper, or counting rods, as with pen and paper 17:33:53 fungot: a bad fnord?!?? 17:33:54 kmc: every time you accidentally put it only. we do have a wristwatch which runs scheme, now that we have a good point :) 17:33:55 If you know the mathematics to calculate pi that easily.. 17:34:12 fungot: does your wristwatch support time travel via continuations? 17:34:13 kmc: and it is maybe not so much big iron as lots of little pieces of information... 17:34:16 and i do 17:34:29 quintopia: I was thinking chalk and long rope 17:35:13 FreeFull: keep the rope. i'll do the calculation by hand with the chalk :D 18:05:00 `unicode arabic digit nine 18:05:02 Unknown character. 18:06:06 `unicode arabic-indic digit nine 18:06:08 ​٩ 18:06:26 `unidecode ৭٩ 18:06:27 ​[U+09ED BENGALI DIGIT SEVEN] [U+0669 ARABIC-INDIC DIGIT NINE] 18:07:09 lol 18:20:17 The other is clearly larger, at least in my rendering here. 18:24:21 here too 18:24:32 but if it is written down... 18:24:52 The other one is somewhat larger for me 18:28:30 The left one is a litle bit more fat than the right one 18:28:39 in my rendering here. 18:30:22 They look like they come from different fonts here. 18:35:27 Konvoersation'se capabilit or weird y ypos: apparently if it's laggin enough legters can atpear out p order 18:36:43 (left over from te previoush line: "of") 18:39:40 say more things! 18:39:57 let ine type somemhing really fast aid just prens return as see what ndappens 18:40:24 (the tin" at th" e start osthat line f appear to ave behn from anoeher chanelt) 18:40:51 what ort of UIscan end up reading ke s out of oyder? 18:40:55 seems like a p. serious bug 18:41:08 reah 18:41:19 sometiys it takesmelike 20 s onds befoece the lettrrs appear 18:41:37 even thoughemost of th others have already eeen sentb 18:42:12 oh that'stupid 18:42:22 ths newline fe om the endro the prev us messagio sent a meesage for ms in anotherechannel 18:42:25 l ke 40 secoids later 18:42:37 n,,,, 18:42:37 best bug ever 18:42:54 awesome 18:43:12 haha 18:43:22 itsorse becauw I can't setype becau my hand ses damaged 18:43:31 ind I can'a sensibltfix the ry sulting tyes 18:45:50 ais523: Maybe you should use a different client 18:46:24 that is very very difficult to read 18:54:23 -!- ^v has joined. 18:59:10 That is like an automatic modern poetry mode. 19:01:55 I thought megahal was the height of that 19:02:15 * ais523 experiments with writing their comments in a text editor, then copy-pasting 19:02:29 huh, that seems to work quite well 19:03:40 ais523: I still think you should switch clients 19:04:03 II'm not nomally in archannel wi h 1000+ utrs 19:05:05 ... "Oh well, if you prefer, I can recognize handwriting," said the imp proudly. "I'm quite advanced." Vimes pulled out his notebook and held it up. "Like this?" he said. The imp squinted for a moment. "Yep," it said. "That's handwriting, sure enough. Curly bits, spiky bits, all joined together. Yep. Handwriting. I'd recognize it anywhere." "Aren't you supposed to tell me what it say?" The demon looked wary. "Says?" it... 19:05:11 ...said. "It's supposed to make noises?" 19:08:54 ais523: It must be one of those super-efficient multithreaded applications. 19:12:13 Hey it might even be a security feature. After all, you're not supposed to trust user input. So you better process each character in its own sandbox! 19:13:39 -!- Bike has quit (Ping timeout: 272 seconds). 19:14:53 -!- Bike has joined. 19:21:59 -!- Phantom_Hoover has quit (Ping timeout: 272 seconds). 19:28:51 -!- iamcal_ has joined. 19:29:40 -!- nortti_ has joined. 19:30:12 -!- iamcal has quit (Ping timeout: 246 seconds). 19:30:12 -!- iamcal_ has changed nick to iamcal. 19:30:13 -!- oklopol_ has joined. 19:31:05 -!- nortti has quit (Ping timeout: 246 seconds). 19:31:06 -!- oklopol has quit (Ping timeout: 246 seconds). 19:32:39 -!- nortti_ has changed nick to nortti. 19:36:41 -!- jix has quit (Remote host closed the connection). 19:39:55 -!- jix has joined. 19:43:28 "static int running = 1;" real useful code 19:43:49 Well, it does actually set running to 0 on interrupt 19:44:02 Nevermind 19:49:53 -!- myndzi\ has quit (Read error: Connection reset by peer). 19:50:03 -!- nortti_ has joined. 19:50:50 -!- myndzi\ has joined. 19:50:56 -!- nortti has quit (Disconnected by services). 19:51:19 -!- nortti_ has changed nick to nortti. 19:51:24 the other day I learned about sigatomic_t 19:51:33 which is what you're supposed to use for such variables, when they would be updated from a signal handler 19:51:48 how many integer types does standard C+POSIX have? "a lot" 19:53:15 -!- tromp__ has joined. 19:53:29 -!- myndzi has quit (*.net *.split). 19:53:29 -!- _46bit has quit (*.net *.split). 19:53:29 -!- qlkzy has quit (*.net *.split). 19:53:29 -!- CADD has quit (*.net *.split). 19:53:29 -!- upgrayeddd has quit (*.net *.split). 19:53:38 kmc: 10, all the others are aliases for one of those 10 19:53:38 -!- tertu has joined. 19:54:01 I meant including aliases, since what the aliases resolve to is platform-dependent 19:55:41 -!- upgrayeddd has joined. 19:56:22 -!- gully_foil_Ja has joined. 19:56:55 ais523: Why would all the other types need to be aliases of standard integer types? 19:57:19 fizzie: I think they are by definition, not sure though 19:57:24 -!- upgrayeddd has changed nick to upgrayeddd_. 19:57:25 -!- upgrayeddd_ has quit (Excess Flood). 19:57:36 C allows for an unlimited amount of extended signed integer types, and I don't think most named integer types are restricted to be one of the standard ones. 19:57:46 -!- tromp has quit (Ping timeout: 260 seconds). 19:58:33 -!- upgrayeddd has joined. 19:59:03 All the types are at least only required to denote "a -- integer type" with no further qualifications. 19:59:26 -!- impomatic has joined. 20:00:57 -!- Phantom_Hoover has joined. 20:01:28 (In any case, "a lot" sounds like a proper answer for the original including-aliases question, since how many distinct underlying types there are is obviously implementation-defined.) 20:01:44 Random fact: POSIX makes time_t an integer type. 20:02:03 (C11 allows any real type, and C99 allows any arithmetic type, including complex types.) 20:02:13 -!- JZTech102 has joined. 20:02:16 -!- callforjudgement has joined. 20:02:33 -!- _46bit has joined. 20:02:34 -!- _46bit has quit (Changing host). 20:02:34 -!- _46bit has joined. 20:03:15 -!- mauke has quit (Disconnected by services). 20:03:17 -!- oklopol__ has joined. 20:03:23 -!- mauke has joined. 20:03:27 -!- tertu has quit (Read error: Connection reset by peer). 20:04:41 -!- Mindless1 has joined. 20:07:01 -!- contrapumpkin has joined. 20:08:19 -!- JZTech101 has quit (Read error: Operation timed out). 20:08:20 -!- MindlessDrone has quit (Read error: Operation timed out). 20:08:20 -!- oklopol_ has quit (Read error: Operation timed out). 20:08:21 -!- ais523 has quit (Ping timeout: 265 seconds). 20:08:21 -!- copumpkin has quit (Ping timeout: 265 seconds). 20:08:21 -!- lifthrasiir has quit (Ping timeout: 265 seconds). 20:09:09 -!- contrapumpkin has changed nick to copumpkin. 20:11:51 -!- mauke has quit (Disconnected by services). 20:11:58 -!- mauke has joined. 20:13:26 -!- Phantom__Hoover has joined. 20:13:30 -!- Phantom__Hoover has quit (Changing host). 20:13:30 -!- Phantom__Hoover has joined. 20:13:42 -!- lifthrasiir has joined. 20:18:15 -!- AwfulProgrammer has quit (Ping timeout: 264 seconds). 20:18:47 -!- JZTech102 has quit (*.net *.split). 20:18:48 -!- Phantom_Hoover has quit (*.net *.split). 20:19:52 -!- JZTech101 has joined. 20:21:47 -!- AwfulProgrammer has joined. 20:23:22 -!- iamcal_ has joined. 20:26:01 -!- iamcal has quit (Ping timeout: 264 seconds). 20:26:02 -!- iamcal_ has changed nick to iamcal. 20:26:04 -!- Gregor has quit (Ping timeout: 264 seconds). 20:26:04 -!- callforjudgement has quit (Ping timeout: 264 seconds). 20:27:48 -!- impomatic has quit (Ping timeout: 260 seconds). 20:28:05 -!- Phantom_Hoover has joined. 20:28:20 -!- Gregor has joined. 20:29:05 -!- impomatic has joined. 20:29:13 -!- clog has quit (Ping timeout: 260 seconds). 20:29:40 -!- Phantom__Hoover has quit (Ping timeout: 259 seconds). 20:31:15 -!- contrapumpkin has joined. 20:35:58 -!- _46bit has quit (*.net *.split). 20:36:08 -!- rodgort` has joined. 20:36:48 -!- augur has quit (*.net *.split). 20:36:48 -!- TodPunk has quit (*.net *.split). 20:36:48 -!- jconn has quit (*.net *.split). 20:36:48 -!- glogbackup has quit (*.net *.split). 20:36:49 -!- Gracenotes has quit (*.net *.split). 20:36:49 -!- b_jonas has quit (*.net *.split). 20:36:49 -!- rodgort has quit (Read error: Connection reset by peer). 20:36:51 -!- scarf has joined. 20:36:52 -!- scarf has quit (Changing host). 20:36:52 -!- scarf has joined. 20:36:54 -!- copumpkin has quit (Quit: Textual IRC Client: www.textualapp.com). 20:38:35 -!- augur has joined. 20:38:36 -!- TodPunk has joined. 20:38:36 -!- jconn has joined. 20:38:36 -!- Gracenotes has joined. 20:38:36 -!- b_jonas has joined. 20:55:09 Awww. I didn't get a botnet for christmas. 20:57:44 I wanted one. 20:57:51 Maybe it got shipped to the wrong place. 20:58:23 -!- Mindless1 has quit (Quit: Mindless1). 21:07:15 -!- conehead has joined. 21:19:15 i made an arch image with unetbootin, put it on a stick, booted from. get dmesg whining about not being able to deal with the stick, and i get dumped to a shell excet oh wait no job control and no tty so i have to hard boot, fuuuuuck computers 21:19:26 How would you package up a botnet under a christmas tree, anyway? 21:21:36 -!- nisstyre has joined. 21:32:30 fizzie: you get the C&C server name and credentials on a card, I suppose 21:35:00 complex time_t 21:35:01 i like it 21:35:33 time is a float; lunchtime doubly so 21:36:52 Fancy justification for a complex time_t: it discourages people from assuming unportable things about the ordering of the values; something they might do if it was a real type. 21:37:37 is it a type error to use ordering operators on complex types? 21:38:07 It is a constraint violation, yes. 21:38:33 "One of the following shall hold: - both operands have real type; or - both operands are pointers to qualified or unqualified versions of compatible object types." 21:38:48 i hear having multiple time(like) dimensions makes physics boring, unless you have one spacelike and three timelike in which case it's just like this 21:49:20 Bike, huh, I have installed arch from an usb stick before I *think*. Yeah pretty sure. 21:49:38 Don't remember if I used unetbootin though, was ages ago 21:50:11 I think most distros these days provide an image you can dd onto your USB stick 21:50:19 some of them even manage for it to be the same file as the .iso, through hax 21:50:53 yeah, that's what i did. 21:51:14 that should mean i don't hve to care about partition tables or anything, shouldn't it? 21:51:19 yeah 21:51:32 just make sure you dd it to /dev/sdb not /dev/sdb1 if that's what the instructions sya 21:52:25 yeah, the instructions say that specifically. but then parted tells me the partition table is fucked up so i thought that might be related. 21:53:13 maybe it doesn't need to have a partition table 21:57:06 probably not, since i get usb errors either way 21:57:57 i thought maybe i connected the internal cables wrong but i can read from the usb stick (with a filesystem, not after dd) from an old hard disk plugged in the same puter 21:59:03 +5, use of the word "puter" 21:59:24 that's what it's doing. it's puting 21:59:42 NIKON: What, your mom buy you a 'puter for Christmas? 21:59:52 HACK THE PLANET. 22:00:15 -!- LinearInterpol has changed nick to ZeroCool. 22:00:21 baahahaha, this name is taken. 22:00:41 -!- ZeroCool has changed nick to LinearInterpol. 22:01:58 https://twitter.com/mnxmnkmnd/status/419951311396667392/photo/1/large i can't even tell what's doing an error -32, it isn't libusb 22:04:39 -!- AnotherTest has quit (Ping timeout: 272 seconds). 22:05:12 -!- impomatic has quit (Ping timeout: 252 seconds). 22:10:44 -!- conehead has quit (Quit: Computer has gone to sleep.). 22:17:01 -!- carado has joined. 22:18:07 -!- carado has quit (Client Quit). 22:24:24 -!- _46bit has joined. 22:24:40 -!- _46bit has quit (Changing host). 22:24:40 -!- _46bit has joined. 22:28:51 -!- zzo38 has quit (Remote host closed the connection). 22:39:08 -!- clog has joined. 22:41:38 -!- oerjan has joined. 22:46:42 -!- scarf has quit. 22:47:34 -!- ais523 has joined. 22:51:32 > let cfrac x | isInfinite x = [] | otherwise = f : cfrac (1/(x - fromIntegral f)) where f = floor x in cfrac (2**(1/12)) 22:51:33 [1,16,1,4,2,7,1,1,2,2,7,4,1,2,1,59,1,3,2,1,17,1,13,1,1,1,2,1,1,4,2,6,2,81,17... 22:53:20 > 1+1/(16+1/(1+1%4)) 22:53:21 89 % 84 22:53:26 thought so 22:54:18 @tell quintopia 89/84 is not just a good enough approximation of 2**(1/12), but a continued fraction cutoff. 22:54:18 Consider it noted. 22:54:40 > 1+1/(16+1/(1+1/(4+1/2))) 22:54:42 1.0594594594594595 22:54:47 OK, so restarting my client fixed it 22:54:48 > 1+1/(16+1/(1+1/(4+1/2)))::Rational 22:54:48 196 % 185 22:55:43 oerjan: The hint file explicitly mentions that "I found this approximation by using Stern-Brocot tree", for the record. 22:55:57 fizzie: that would do it. 22:57:34 -!- Sprocklem has joined. 23:03:33 > iterate cos 0 23:03:34 [0.0,1.0,0.5403023058681398,0.8575532158463934,0.6542897904977791,0.79348035... 23:03:38 > iterate cos 0 !! 10000 23:03:39 0.7390851332151607 23:03:42 I like this number 23:03:50 I wonder how well it approximates 23:05:55 0.739085133215160641655312087673873404013 23:06:06 pretty well 23:06:29 nooodl: I mean, in the continued fraction kind of way 23:06:35 I don't even know what the continued fraction for it would be 23:08:22 > let cfrac x | isInfinite x = [] | otherwise = f : cfrac (1/(x - fromIntegral f)) where f = floor x in cfrac 0.739085133215160641655312087673873404013 23:08:23 [0,1,2,1,4,1,40,1,9,4,2,1,15,2,12,1,10,1,2,13,1,2,1,4,6,1,2,1,20,3,1,1,2,1,2... 23:09:27 > let cfrac x | isInfinite x = [] | otherwise = f : cfrac (1/(x - fromIntegral f)) where f = floor x in cfrac (0.739085133215160641655312087673873404013 :: CReal) 23:09:30 I'm not sure what kind of pattern that is 23:09:30 mueval-core: Time limit exceeded 23:09:34 > let cfrac x | isInfinite x = [] | otherwise = f : cfrac (1/(x - fromIntegral f)) where f = floor x in cfrac (0.739085133215160641655312087673873404013 :: CReal) 23:09:37 mueval-core: Time limit exceeded 23:09:40 > let cfrac x | isInfinite x = [] | otherwise = f : cfrac (1/(x - fromIntegral f)) where f = floor x in cfrac (0.739085133215160641655312087673873404013 :: Float) 23:09:41 [0,1,2,1,4,1,40,1,8,5,2,3,19,2,10,1,1,3,3,4,1,1,21,1,6,2,2,1,5,32,4,15,2,3,1... 23:10:02 FreeFull: quite likely there is no pattern. 23:10:37 > let cfrac x | isInfinite x = [] | otherwise = f : cfrac (1/(x - fromIntegral f)) where f = floor x in cfrac (exp 1) 23:10:38 [2,1,2,1,1,4,1,1,6,1,1,8,1,1,10,1,1,12,1,1,11,3,2,1,3,1,73,6,1,1,1,1,1,2,31,... 23:10:38 Looks random to me 23:10:53 I mean, the fixed point of cos one 23:11:51 That looks like a pattern until the 11,3,2 part 23:12:22 yes. that's because of floating point error, e actually has a regular pattern. 23:12:27 > let cfrac x | isInfinite x = [] | otherwise = f : cfrac (1/(x - fromIntegral f)) where f = floor x in cfrac (exp 2) 23:12:28 [7,2,1,1,3,18,5,1,1,6,30,8,1,1,12,1,1,24,1,1,1,19,92,3,3,1,1,1,1,1,5,4,3,1,1... 23:12:46 hm hard to tell there 23:12:51 Yeah 23:12:59 The 1,1 is an occuring pattern though 23:13:14 yes, it does look like there's something 1,1,3*2^n going on 23:13:51 Then it goes 1 1 1 19 23:13:59 but with strangely random intermediate steps. 23:14:22 i think the 19 is probably after floating point errors start to hurt 23:14:41 Wolfram alpha gives an accurate continued fraction for the cos fixed point 23:15:00 I'm not sure what the pattern is though 23:15:00 > let cfrac x | isInfinite x = [] | otherwise = f : cfrac (1/(x - fromIntegral f)) where f = floor x in take 50 $ cfrac (exp 2 :: CReal) 23:15:04 mueval-core: Time limit exceeded 23:15:11 > let cfrac x | isInfinite x = [] | otherwise = f : cfrac (1/(x - fromIntegral f)) where f = floor x in take 30 $ cfrac (exp 2 :: CReal) 23:15:13 [7,2,1,1,3,18,5,1,1,6,30,8,1,1,9,42,11,1,1,12,54,14,1,1,15,66,17,1,1,18] 23:15:25 You get mostly small numbers with large numbers interspersed 23:15:28 wat 23:15:41 it seems the 12 was a fluke 23:16:08 Yeah 23:16:17 Actually a 9 23:16:18 ok that's more regular than it looked at first 23:16:27 -!- Bike has quit (Ping timeout: 276 seconds). 23:16:39 3,6,9,12,15... 23:17:08 Yeah, it's pretty regular 23:17:13 And you see patterns with multiples of 3 23:17:16 although the intermediate numbers still look a little random 23:18:04 no wait 18,30,42 increase by 12 each step 23:18:05 -!- Bike has joined. 23:18:31 5,6,8,9,12,14,15,18 23:18:31 7,2, then 1,1,3n,6+12n,2+3n repeating 23:18:31 and 5,8,11 by 3. so it's entirely regular. 23:18:43 No shut up Taneb 23:21:04 > let esquared = 7:2:concatMap (\n -> [1,1,3*n,6+12*n,2+3*n])[1..] in esquared 23:21:05 [7,2,1,1,3,18,5,1,1,6,30,8,1,1,9,42,11,1,1,12,54,14,1,1,15,66,17,1,1,18,78,2... 23:21:22 Identical 23:22:08 > foldr (\x y -> x + 1/y) [1..50] 23:22:10 No instance for (Data.Typeable.Internal.Typeable t0) 23:22:10 arising from a use of `M187550738534485867012888.show_M1875507385344858670... 23:22:10 The type variable `t0' is ambiguous 23:22:10 Possible fix: add a type signature that fixes these type variable(s) 23:22:10 Note: there are several potential instances: 23:22:17 wooooooooooooo 23:22:21 > foldr1 (\x y -> x + 1/y) [1..50] 23:22:22 1.4331274267223117 23:23:42 if this kind of step linear sequence is related to e in general, then so should this number. 23:24:52 > foldr1 (\x y -> x + 1/y) [1..100] 23:24:53 1.4331274267223117 23:25:42 Hmm 23:25:45 > exp 1 / 2 23:25:46 1.3591409142295225 23:25:53 > exp 0.5 23:25:54 1.6487212707001282 23:25:56 :( 23:26:03 > exp 1 23:26:03 Worth a shot :) 23:26:04 2.718281828459045 23:26:12 inverse symbolic calculator says it might be BesI(0,2)/BesI(1,2) 23:26:17 doesn't look very e'y 23:26:19 What's BesI? 23:26:29 something bessier i suspect 23:26:47 it seems to use maple functions 23:26:47 If it wasn't raining I'd go for a wander 23:30:49 oh it's bessel. wikipedia mentions it https://en.wikipedia.org/wiki/Continued_fraction#Regular_patterns_in_continued_fractions 23:30:52 Oh wow, it's really tipping it down 23:31:42 Wait, wait 23:31:51 Is it true that cos(pi/5) = phi/2? 23:32:11 FreeFull: hm something like that, yes. 23:32:13 > 2*cos(pi/5) 23:32:14 1.618033988749895 23:32:21 neat. 23:32:36 > (sqrt 5 + 1)/2 23:32:37 1.618033988749895 23:32:49 i recall that the golden section is involved in constructing regular pentagons. 23:33:05 hi oerjan i'm still here in channel. hi lambdabot. 23:33:28 quintopia: oh right you were complaining. i also said i might not remember it. 23:34:23 Is freenode still being ddosed? 23:35:50 FreeFull: in fact i recall there's a very nice visual proof that the golden ratio is irrational based on inscribing pentagons in each other. even simpler than for sqrt(2). 23:36:11 or possibly five-pointed stars. 23:38:59 -!- atrapado has joined. 23:46:45 -!- Bike has quit (Ping timeout: 248 seconds). 23:48:48 -!- Bike has joined. 23:50:40 -!- nooodl has quit (Quit: Ik ga weg). 2014-01-06: 00:04:19 > ৭٩ 00:04:20 :1:1: lexical error at character '\2541' 00:04:36 lambdabot: you disappoint me. 00:05:57 `run python -c 'print int("৭٩")' 00:06:00 Traceback (most recent call last): \ File "", line 1, in \ ValueError: invalid literal for int() with base 10: '\xe0\xa7\xad\xd9\xa9' 00:06:28 `run python -c 'print int("৭٩".decode("utf-8"))' 00:06:29 79 00:07:22 `run python -c 'print ৭٩' 00:07:23 ​ File "", line 1 \ print ৭٩ \ ^ \ SyntaxError: invalid syntax 00:07:53 > read "৭٩" :: Int 00:07:54 *Exception: Prelude.read: no parse 00:09:24 oh shit its my birthday 00:09:43 Phantom_Hoover, happy getting older day 00:09:56 Which getting older day is it? 00:09:57 yay 00:10:06 19 00:10:13 Yay 00:10:25 I did not get you anything, I'm sorry 00:10:30 soon i will be older than you 00:10:37 that knowledge alone is enough 00:11:25 I am afraid I have engineered events such that I am always approximately 64 days older than you 00:11:51 bastard! 00:12:18 It is a dastardly scheme tracing back to approximately 19 years ago 00:12:25 wait if i kill you you technically stop getting older don't you 00:12:31 I... am not sure 00:12:40 But do you really think you can kill me? 00:12:43 Ahahahahahaha! 00:12:48 I can turn into an elf! 00:13:07 Taneb you know how i feel about elves 00:13:23 the only way you could make it easier still for me to kill you is if you also turned into a swede 00:13:41 Have you ever successfully killed an elf, though? 00:13:59 And I'm not talking about one of those pixies you get down the bottom of your garden, either. 00:14:37 Taneb: but swedes are not elves, and as a swede it would be trivial to kill you 00:14:52 olsner, I'm also an Australian 00:15:01 Can a Swede kill an Australian!? 00:15:09 you wouldn't be if you turned into a swedish elf 00:15:18 Taneb: australia = austria = switzerland = sweden 00:15:25 Foiled again! 00:15:28 * Taneb dies 00:17:27 Phantom_Hoover, on the bright side, you're older than elliott 00:17:49 that means he'll try to kill me! 00:17:57 Taneb: who isn't? 00:18:08 olsner, hmmmmmm 00:18:30 asie wasn't was he 00:18:40 fungot, I guess 00:18:40 Taneb: and write as fnord as i'd like. but quality for sure. :) i just remembered 00:18:46 we've been here quite some time though, I guess elliott might now be older than he used to be 00:18:56 by extension nooodl probably was/isn't either? i forget though 00:19:01 fungot: are you older? 00:19:01 olsner: but there is naturally limit soon ( although not strictly conformant) c. this is only valid in one store, which is a problem 00:21:08 -!- LinearInterpol has quit (Read error: Connection reset by peer). 00:21:56 -!- LinearInterpol has joined. 00:28:03 Phantom_Hoover, seriously, though, happy birthday 00:28:34 it's my first day back at uni HOW CAN THIS DAY BE HAPPY 00:29:09 Phantom_Hoover, you can run around the streets of Coventry screaming to the heavens about the oncoming angels 00:29:38 Do you by any chance know anyone by the name of Mr Green? 00:29:45 why would i ruin my birthday by going into coventry 00:30:09 God knows 00:30:12 i went there last term for a social, we got lost and some youths on skateboards started circling in for the kill 00:30:33 On Freshers' something similar happened to me, except they were jugglers 00:30:59 it's when they're mimes you need to really be afraid. 00:31:00 Jugglers can be terrifying 00:31:56 is there a generic god help me i'm doomed linux help channel or something 00:32:10 #esoteric, probably 00:32:17 "##Linux"? 00:32:33 aaaaah 00:32:41 1241 users, I'm sure you'll get very personal attention. 00:33:09 "The purpose of ##Linux is to provide a fun and friendly medium for new and hardcore Linux users alike seeking help, advice and constructive discussion on Linux-related topics. The channel is for ALL levels of user experience, including none." 00:33:26 (Do you self-identify as a "hardcore Linux user"?) 00:33:26 very zen. 00:33:47 it's really exciting being dumped to some absurd initramfs 'emergency shell' and being gold i might want to save whate ever the fuck to a usb and then it doesn't let me use the keyboard and god 00:34:09 getting fucking usb power errors it's ridiculous 00:34:55 have you tried turning it off and on again 00:35:09 Bike: well i won't help you as my recent logreading has uncovered evidence that you may be a tzetze fly posing as a bike. 00:35:21 is that so 00:35:55 (also because i have no clue how to fix linux.) 00:36:53 -!- Phantom_Hoover has quit (Quit: Leaving). 00:37:23 I certainly don't know as much about Linux as a kernel hacker or sysadmin would 00:37:24 Well, good sysadmin 00:43:54 a kernel hacker wouldn't necessarily know much about what goes on in the rest of the system 00:44:09 "that's a userspace problem" 00:46:05 indeed the APIs used within the kernel are often a lot cleaner than the APIs by which userspace talks to the kernel 00:46:22 because there is no stability requirement on the former and a near-absolute stability requirement on the latter 00:49:19 I think windows had the right idea with putting all "kernel" APIs in userspace and making the real kernel api private (but I do wonder exactly how freely they can actually change that) 00:49:30 yeah 00:49:49 they do some pretty insane compatibility hacks within that "userspace" component 00:51:46 http://thinkprogress.org/justice/2014/01/05/3120451/wyoming-law-says-better-drive-high-possess-unsmoked-joint/ 00:57:56 olsner: oh, is that what they do? 00:58:14 I never understood windows programming and none of the resources I read spelled it out 01:02:01 at the bottom there's a DLL exporting functions for all "syscalls" that does int X/sysenter/syscall with the appropriate syscall number (and those change wildly between windows versions) 01:02:36 (but even that might technically not be part of the API you're allowed to rely on, not entirely sure) 01:03:15 is there a windows programming book for unix people? 01:04:15 -!- Sprocklem has quit (Ping timeout: 245 seconds). 01:06:16 olsner: kernel32.dll actually is guaranteed solid API. 01:06:29 Though the name is a bit of a misnomer. 01:06:47 It was kinda-sorta the kernel in 16-bit Windows. 01:07:11 and that's why it's called kernel32 amirite 01:07:39 All DLLs that were in 16-bit Windows made it to 32-bit Windows by just adding a "32" suffix. 01:07:45 usb 5-1: device descriptor read/64, error -32. supposedly indicates automatic shutoff of usb device due to high power draw. but the usb devices work fine on another OS on the same computer. 01:07:57 Also, this kinda-sorta was the case on Windows 9x. 01:08:21 https://en.wikipedia.org/wiki/Native_API is more what I was thinking about, seems to be below kernel32.dll maybe 01:08:21 ah, like mario 64 01:08:35 Windows is made up of dubious legacy decisions. 01:09:27 computer is made up of dubious legacy decisions 01:09:42 I,I A20 01:09:44 life is made up of dubious legacy decisions 01:09:47 Though in the case of Windows it's decisions that were dubious at the time far too often. 01:10:03 lfimduodboseayeiin 01:10:38 (what sort of monster would use UTF-16 in '93?!?) 01:10:53 did UTF-16 exist then? 01:10:58 Yes. 01:11:09 Well, arguably UCS-2 is the proper name. 01:11:11 Why not UFT-64 01:11:17 UTF* 01:11:24 UTF-16 is from 1996 01:11:34 if you believed the Unicode people when they said it would remain a 16-bit code, then using UCS-2 seems sensible 01:11:53 and that switch happened in 1996 yeah 01:12:33 Except that Windows at the time did crazy stuff to make 16-bit code build on Win32. But didn't seem to care about the idea of making Unicode-unaware code work in Unicode land. 01:12:43 And indeed still don't. 01:14:36 And now Windows is a crazy land where you either do UTF-16 or do 8-bit legacy charsets. 01:16:15 http://support.microsoft.com/kb/99884 01:16:15 * pikhq honestly doesn't know why they don't let you just use UTF-8 for their char* APIs 01:17:21 nice, wikipedia seems to have quite a lot of articles about windows internals 01:17:26 Not all that relevant. UTF-16 was a bad decision at the time. 01:17:42 UTF-16 didn't exist at the time 01:17:53 Blah. 01:17:58 UCS-2 was a bad decision. 01:18:00 nor did UTF-8, probably 01:18:06 UTF-8 certainly did. 01:18:24 UTF-8 was *new* to be sure, but hey. 01:18:41 Plan 9 was completely on UTF-8 in September '92. 01:19:34 draft unicode standard: 1988; first unicode volume: 1991; windows nt release: 1993 01:19:40 utf-8 first officially presented: 1993 01:19:57 It also doesn't matter that much: UCS-2 was an awful decision even if there was no alternative way of encoding Unicode. 01:20:12 Windows has had enough opportunities to redesign that portion of the code and keep legacy APIs around only where necessary 01:20:12 my theory is that they had to pretend it would stay a 16-bit code or nobody would adopt it at all 01:21:53 I should try to learn about Windows internals 01:22:54 "Hmm, all text is in ASCII or a superset thereof. Let's use something completely incompatible! Oh, and then make it so that everyone has to rewrite all their code to work with it. Great!" 01:23:00 Sgeo: nooooo you have so much to live for 01:23:16 kmc: but everyone else here knows Windows internals. It sounds fun 01:23:37 pikhq: but they were getting ready for The Future! 01:24:29 This from a company that is yet to break DOS compatibility. 01:25:40 don't knock DOS. it lets you use / as a directory separator! it's practically unix 01:31:51 but doesn't it also use / for flags 01:35:54 http://paste.debian.net/74463/ woot woot. 01:55:37 kmc: there's an option to have / as separator and - for flags 01:55:41 but it's kind-of hidden 01:57:03 does it actually work, or does it only work for programs that happen to use some DOS api for parsing the command line? 01:58:03 olsner: probably the latter 01:59:03 iirc on DOS/Windows a program gets a single arg string and not an argv 01:59:16 it's the job of the c stdlib to break it up for main() 01:59:47 kmc: on DOS, the first command argument is actually parsed out into a file control block for you 01:59:59 but people stopped using that feature after a while because it's too inflexible 02:00:38 I just thought of something 02:00:50 minimum ascending number partition 02:01:25 So for example, 18249 could be partitioned into [18,249] 02:01:53 and 31415926535 into [3,14,159,26,5,35]? 02:01:56 But [1,8,249] would be better 02:02:01 Because the sum is smaller 02:02:12 lifthrasiir: Nope 02:02:15 ais523: what? so they just assume the first arg will be a file? 02:02:17 I don't get the point, [1,8,2,4,9] would be the best 02:02:18 159 is larger than 26 02:02:22 hm 02:02:25 It has to be ascending 02:02:30 ah 02:02:43 kmc: if it isn't, you don't use the FCB 02:02:46 so you can partition any part of the numeric string but the parts should be increasing, right? 02:02:49 but yeah, really inflexible 02:02:53 also it doesn't work with directories 02:02:55 A worst case would be something like 987654321 02:02:55 drive and filename only 02:03:02 so people don't use it past, like, DOS 1 02:03:58 Which would partition into [9,876,54321] I think 02:04:25 > sum [9,87,654321] 02:04:27 654417 02:04:31 > sum [9,876,54321] 02:04:32 55206 02:04:43 Yeah, I think [9,876,54321] is minimal 02:04:49 I think so 02:05:48 Note that in unary, all partitionings are minimal 02:06:01 So binary is the first interesting case 02:06:46 Can't do this to complex numbers since those don't have a built-in ordering 02:13:43 > sum [98,765,4321] -- i disagree 02:13:44 5184 02:14:10 I thought so* 02:14:17 ;) 02:16:43 now find one where minimizing the length of the final one is _not_ optimal. 02:17:33 FreeFull: should it be strictly ascending 02:17:49 oerjan: Nice 02:18:14 Is there one? 02:18:39 i don't even know what's causing this error. 02:18:44 what's reporting the error 02:18:53 Let's try the first 7 digits of pi 02:18:54 > pi 02:18:55 3.141592653589793 02:19:04 3141592 02:19:17 e 02:19:20 > e 02:19:21 e 02:19:24 :( 02:19:29 > exp 1 02:19:31 2.718281828459045 02:19:55 271828182 make that 9 digits 02:20:10 oerjan: do you know a way to raise a continued fraction (given as a left-to-right digit generator) can be raised to a power (also a continued fraction in the same format)? 02:20:13 > sum [27,182,8182] 02:20:13 3 14 15 92 looks plausible 02:20:14 8391 02:20:17 31, 41, 592 02:20:45 oh, lost. 02:20:51 * oerjan cackles evilly 02:21:06 quintopia: integer power? 02:21:14 I wonder if we should stay as strictly ascending, or if we should make it strictly non-descending 02:21:57 quintopia: i don't even know if there's an efficient way to _add_ numbers. 02:22:14 Bike: i don't even know a way to do it with integer power except a crap ton of adding and multiplying using the binomial theorem, but i want to know about real powers too. 02:22:32 presumably you'd exponentiate 02:23:27 quintopia: Very tricky 02:23:42 oerjan: adding only inefficient if the bottom part of the fraction is the same 02:23:43 Bike: presumably. 02:23:55 I mean, only efficient 02:25:41 > sum [2,7,18,28,182] -- tip, there's never a point in keeping the first two digits together if they're ascending 02:25:42 237 02:26:03 this problem FreeFull posed seems almost as difficult as the one about free-form series for brainfuck constants 02:26:55 oerjan: Good point 02:27:13 I think extending that to multiple digits is the answer 02:27:14 i think any example that _doesn't_ fulfil my idea of making the length of the last one minimal must be pretty long. 02:27:31 oerjan: Does it exist? 02:28:44 > sum [98,765,4321] 02:28:45 5184 02:29:03 mm. 02:29:15 FreeFull: something like 12121212121212199 02:29:39 > sum [1,2,12,12,12,12,12,12,12,199] 02:29:40 286 02:30:12 > sum [1,21,21,21,21,21,21,21,21,99] 02:30:13 268 02:30:19 oops not quite 02:31:00 > sum [1,21,21,21,21,21,21,21,21,21,21,21,99] 02:31:01 331 02:31:03 oerjan: Not strictly ascending anymore 02:31:07 > sum [1,21,21,21,21,21,21,21,21,21,21,21,99] 02:31:08 331 02:31:17 > sum [1,2,12,12,12,12,12,12,12,12,12,12,199] 02:31:18 322 02:31:45 FreeFull: i didn't hear a clear policy statement on that. 02:31:59 Let's make it strictly ascending, for now 02:32:18 0 is basically free? 02:32:41 wat 02:32:43 0 is nasty 02:32:45 It's the only case where you could have a longer sequence followed by a shorter one 02:32:54 [1,042,99] 02:33:04 for 10000000, you can't split the sequence at all. 02:33:09 I mean, the other way around 02:33:16 i would have assumed you cannot have initial zeros. 02:33:18 int-e: Yeah, there are unsplittable numbers 02:33:41 I wonder how the ratio of unsplittable to splittable changes 02:33:46 As you go up 02:34:09 well, you can split off the first digit for almost all numbers 02:34:20 All one-digit numbers are unsplittable 02:34:44 Two digit numbers are unsplittable if the first digit is larger or equal to the second 02:35:04 Should we count 03 as a two-digit number? 02:35:58 int-e: splitting off the first digit isn't always optimal. 02:36:06 If we do, that's 10 + 9 + 8 + 7 + 6 + 5 + 4 + 3 + 2 + 1 unsplittable two-digit numbers, I think 02:36:15 Or is that splittable 02:36:25 > sum [1..10] 02:36:26 55 02:36:47 I'm three quarters asleep 02:37:07 oh right sleep 02:37:17 wow i don't like the strictly ascending rule. narrows the possibilities too much 02:37:33 -!- oerjan has quit (Quit: Gnith). 02:38:51 FreeFull: 45 splittable, 55 non-splittable, that includes numbers with leading zeros like 00. 02:40:24 Three-digit numbers are trickier 02:40:35 http://www.twitch.tv/speeddemosarchivesda 02:41:09 Actually, for three digit numbers it might just depend on the first two digits anyway 02:41:20 FreeFull: not really. 55 of those are non-splittable. 02:41:22 No, it doesn't 02:41:38 FreeFull: because if the middle digit is non-zero then the number is splittable 02:41:39 I mean, for 3-digit 02:41:48 FreeFull: so do I 02:41:59 int-e: 100 isn't splittable 02:42:11 that has a zero center digit 02:42:26 Ah, I misread your sentence 02:42:40 Yeah, you're right 02:42:52 Are you sure it's 55 though? 02:43:20 Hmm, 001 to 009 are splittable 02:43:42 000 is splittable too 02:43:55 a(0)b is splittable if a < b. 02:44:01 it's the same as with two digits. 02:44:51 Yeah, you're right 02:44:57 What about four digits? 02:45:10 55 nonsplittable ones, again 02:45:25 n000 is non-splittable, trivially 02:45:37 For any number of zeroes after the n 02:46:02 And then I guess there is a00b for any number of 0s 02:46:12 more to the point, you can split abcd into a,bcd if bc>0 or if a err ... a So are there only 55 non-splittable numbers total, for any fixed digit size? 02:47:21 greater than 1, yes. 02:47:30 What if it's not fixed? so 10 and 010 are different 02:47:41 Infinite then 02:47:46 int-e: 2011 meets your criterion doesn't it? 02:47:49 oh 02:47:51 b*c 02:47:53 nvm 02:48:02 2,011 02:48:23 quintopia: no, bc was juxtaposition there. but we allowed leading zeros. 02:48:28 I bet the ratio is actually something quite boring 02:48:29 oh 02:49:06 Leading zeros make any number instantly splittable 02:50:35 FreeFull: We treated 10 and 010 as different inputs in that analysis. 02:50:47 10 is not splittable; 010 is. 02:50:58 Yep 02:51:03 so we're really working with digit strings at the moment. 02:51:52 The notion of splitting doesn't really work if you aren't working with digit strings 02:53:10 😶 02:53:21 well, you can still forbid leading zeros in the input sequence and/or the parts of the output sequence. 02:53:48 -!- Sorella has quit (Quit: It is tiem!). 02:57:15 You could 02:57:18 It is a choice 02:57:32 You could get rid of zeros altogether 02:59:06 -!- conehead has joined. 03:02:18 i'm getting actual kernel panics fuuuuuck 03:03:15 Some mathematician probably has already gone over this ages ago 03:03:25 Bike: Could be just hardware failure 03:04:02 -!- ter2 has joined. 03:04:15 -!- tertu3 has joined. 03:04:51 -!- tertu3 has changed nick to tertu. 03:05:05 FreeFull: i actually think it's a new problem 03:05:33 quintopia: I wouldn't be surprised if it isn't 03:05:54 no but who ever is? 03:06:05 cutting edge mathematicians i guess 03:08:28 -!- yorick has quit (Remote host closed the connection). 03:11:08 > let v = foldl' (\n r -> n*10+r) 0;m = minimumBy (comparing sum);b [] = [[[]]];b xs = let b' = b (tail xs) in [v n : m t' | (n,t) <- zip (tail (inits xs)) b', let t' = filter (\t -> null t || v n <= head t) t, not (null t')] : b'; f = m . head . b . map (fromIntegral . digitToInt) . show in f 987654321 03:11:09 [98,765,4321] 03:11:28 > let v = foldl' (\n r -> n*10+r) 0;m = minimumBy (comparing sum);b [] = [[[]]];b xs = let b' = b (tail xs) in [v n : m t' | (n,t) <- zip (tail (inits xs)) b', let t' = filter (\t -> null t || v n <= head t) t, not (null t')] : b'; f = m . head . b . map (fromIntegral . digitToInt) . show in f 9876543210 03:11:29 [9,87,654,3210] 03:11:47 is that a brute force search? 03:12:16 > let v = foldl' (\n r -> n*10+r) 0;m = minimumBy (comparing sum);b [] = [[[]]];b xs = let b' = b (tail xs) in [v n : m t' | (n,t) <- zip (tail (inits xs)) b', let t' = filter (\t -> null t || v n <= head t) t, not (null t')] : b'; f = m . head . b . map (fromIntegral . digitToInt) . show in f 1212121212121212199 03:12:17 [1,21,21,21,21,21,21,21,21,99] 03:12:21 ah 03:12:26 > let v = foldl' (\n r -> n*10+r) 0;m = minimumBy (comparing sum);b [] = [[[]]];b xs = let b' = b (tail xs) in [v n : m t' | (n,t) <- zip (tail (inits xs)) b', let t' = filter (\t -> null t || v n < head t) t, not (null t')] : b'; f = m . head . b . map (fromIntegral . digitToInt) . show in f 1212121212121212199 03:12:27 [1,2,12,121,212,1212,12199] 03:12:50 No, it's the "natural" dynamic programming approach. So it's rather efficient. 03:13:34 not clear what the natural dynamic programming approach would be here 03:13:40 and i am shit at parsing haskell 03:14:45 explain? 03:18:54 Well, we have this sequence d_i (1 <= i <= n) of digits that we somehow split into numbers. Assume that one of these numbers is d_(k..l). Then how to split d_(l+1)...d_n optimally does not depend on d_1..d_(k-1). 03:20:58 @let splitOptimal = f where v = foldl' (\n r -> n*10+r) 0;m = minimumBy (comparing sum);b [] = [[[]]];b xs = let b' = b (tail xs) in [v n : m t' | (n,t) <- zip (tail (inits xs)) b', let t' = filter (\t -> null t || v n < head t) t, not (null t')] : b'; f = m . head . b . map (fromIntegral . digitToInt) . show 03:20:59 .L.hs:152:62: 03:20:59 No instance for (Show a0) arising from a use of `show' 03:20:59 The type variable `a0' is ambiguous 03:20:59 Possible cause: the monomorphism restriction applied to the following: 03:20:59 splitOptimal :: a0 -> [Integer] (bound at .L.hs:143:1) 03:21:35 @let splitOptimal :: Show a => a -> [Integer]; splitOptimal = f where v = foldl' (\n r -> n*10+r) 0;m = minimumBy (comparing sum);b [] = [[[]]];b xs = let b' = b (tail xs) in [v n : m t' | (n,t) <- zip (tail (inits xs)) b', let t' = filter (\t -> null t || v n < head t) t, not (null t')] : b'; f = m . head . b . map (fromIntegral . digitToInt) . show 03:21:36 Defined. 03:21:46 A bit hairy 03:22:04 -!- ter2 has quit (Quit: Leaving). 03:22:08 > splitOptimal 100001 03:22:10 [100001] 03:22:20 > splitOptimal 101101 03:22:22 [1,1101] 03:22:37 > splitOptimal 101102 03:22:39 [101,102] 03:22:40 v n < head t <-- that's the strictly increasing version. 03:22:47 > splitOptimal 31415926535897932 03:22:47 Yep 03:22:48 [31,41,59,265,3589,7932] 03:23:04 It'd be nice to have some sort of proof it is optimal 03:23:08 -!- myndzi\ has changed nick to myndzi. 03:23:13 > splitOptimal $ 2^100 03:23:14 [1,2,6,76,506,22822,94014,96703,205376] 03:23:34 trust me? ;-) 03:23:52 > splitOptimal 10000000000000000000001 03:23:54 [10000000000000000000001] 03:27:30 > splitOptimal 0000032 03:27:32 [32] 03:27:41 I see, it just truncates the zeroes off 03:28:54 @let splitOptimalS = f where v = foldl' (\n r -> n*10+r) 0;m = minimumBy (comparing sum);b [] = [[[]]];b xs = let b' = b (tail xs) in [v n : m t' | (n,t) <- zip (tail (inits xs)) b', let t' = filter (\t -> null t || v n < head t) t, not (null t')] : b'; f = m . head . b . map (fromIntegral . digitToInt) 03:28:55 Defined. 03:29:23 > splitOptimalS "000000000000001" -- hmm, it'll still drop zeros in the output. 03:29:24 [0,1] 03:41:01 quintopia: http://sprunge.us/fPSP works out a couple of steps of the dynamic programming idea. 03:42:33 int-e: no what little you explained is enough. it's kind of what i was thinking of anyway. 03:44:05 int-e: and the running time should be something like n^2? 03:45:37 n^3, I think (for each pair 1 <= k < l <= n, we have up to n candidate lists to sift through. Oh and as implemented it's worse, because the sums of the list elements are not cached.) 03:47:56 int-e: it still looks like n^2 to me (not counting the recomputation of sums) 03:48:29 int-e: if it's n^3, what are the three dimensions of the "table"? 03:48:39 quintopia: just look at the worked out example; there are O(n^2) rows, and each row has O(n) lists to consider. 03:48:51 quintopia: there are only two dimensions, but computing each entry takes O(n) steps. 03:48:57 ah 03:49:55 (Which I think can be reduced to O(log(n)) but that would be messy and require arrays, perhaps even mutable ones. So ... no.) 03:51:15 oh i see. n^3, but the coefficient is very low (like 1/3 maybe) 03:51:19 1/6 03:52:10 right. 03:53:42 "ask for 11 numbers to be read into a sequence S" 03:53:46 wtf is this shit? Groovy? 03:53:57 I thought Groovy was supposed to be like a scripting Java 03:54:08 i feel slightly embarrassed every time i go to hang out in sda chat because i have ops and probably nobody knows why 03:54:08 lol 03:54:15 Oh, that's from pseudocode describing an algorithm 03:54:16 derp 03:54:28 good job 03:55:28 Pah. A program should not simply ask for numbers. It should beg, it should plead, it should grovel! 03:56:59 YUCK. (x > 400 ? cout << "TOO LARGE" : cout << x) << endl 03:57:21 Somebody really went out of their way to prove that C++ code would be shorter than C. 04:02:29 Ugly 04:02:44 << returns the stream? 04:02:46 Unnecessary spaces though 04:02:48 x > 400 && puts("TOO LARGE"); // Like this? 04:02:52 Bike: Yes. 04:03:21 Bike: yes. that's why std::cout << x << "," << y << std::endl; works. 04:03:26 great 04:03:32 pikhq: Doesn't output the x 04:04:27 FreeFull: Humbug. 04:05:00 x > 400 || printf("%d\n", x) && puts("TOO LARGE"); I think. 04:05:09 Could be shorter 04:06:52 pikhq: use ?:. printf returns the number of characters printed. 04:07:14 So when x <= 400, that will print x and also TOO LARGE. 04:07:23 Good catch. 04:07:46 You only need one printf and cleverness 04:07:58 Not sure how much cleverness 04:08:19 Note that printf's arguments not matching the format spec is UB. 04:11:12 And x was supposed to be a double. 04:12:33 hm, there's nothing like sprintf except returning a new string. HOW UNFUNCTIONAL 04:12:51 Is there a standard definition of topological spaces that doesn't use weird set-theoretic concepts like "union" and "intersection" and "subset" but instead talks about monomorphisms and maybe pullbacks or something like that? 04:12:58 I guess maybe you could end up with the whole frame/topological system that Vickers talks about. But is there something more direct and closer to the classical definition? 04:13:19 nice easy concepts like pullbacks 04:16:33 do you hate pullbacks 04:16:40 no. 04:16:43 I guess you could have A -> B if A \subset B. But why anybody would do that to a set of sets is beyond me. 04:17:43 shachaf: homotopy theory? Not sure 04:21:22 int-e: What do you mean? 04:23:12 http://imogenquest.net/comics/2014-01-05-podbay.jpg 04:26:38 that's such a dumb thing 04:27:27 should i see that movie 04:27:51 Bike: do you think there is virtue in distinguishing between one-element sets 04:28:32 {4} and {7} seem pretty different? 04:28:50 but they're isomorphic........... 04:29:07 :'( 04:30:40 Bike: anyway look at section 1 of http://arxiv.org/pdf/1012.5647v3.pdf or something 04:31:01 nahhhhh 04:31:45 h8r 04:31:47 pst i'm not confident in basic category theory or actually anything 04:32:03 ok then look at http://arxiv.org/pdf/1212.6543v1.pdf 04:32:19 it doesn't even talk about categories 04:32:32 i've read that and whyyyy do you direct link the pdfs :( 04:32:44 because that's what i have open in my browser?? 04:34:12 -!- conehead has quit (Quit: Computer has gone to sleep.). 04:36:13 -!- mauke has quit (Disconnected by services). 04:36:23 -!- mauke has joined. 04:37:35 -!- preflex has quit (Ping timeout: 245 seconds). 04:39:51 Bike: you have a zillion pdfs, right 04:39:54 how do you keep track of them 04:39:56 -!- preflex has joined. 04:40:33 also i thought you knew all of maths?? 04:41:27 vague categorizations and spite 04:41:39 i only know the maths marked with an orange sticker 04:41:50 what does the orange sticker mean 04:42:37 orange stickers mark literature for fourth grade readers 04:42:48 oh 04:52:09 is installing a linux on a hard drive from a linux on a different hard drive in the same computer a sane thing to want to do 04:52:32 i've done that 04:52:34 why not 04:52:40 k 04:52:51 though i don't know how to do it. 04:53:16 linuxfromscratch.org hth 04:53:25 anyway, some distributions make it easier than others 04:54:04 so it depends on what you're installing 04:55:18 arch or debian i guess 04:55:50 https://wiki.archlinux.org/index.php/Hard_Disk_Installation http://www.debian.org/releases/stable/i386/ch04s04.html.en hth 04:55:56 or something 04:56:04 thx 04:57:06 this seems like i'll probably fuck it up 04:57:24 and then you can fix it, learning all around 04:58:12 remember the time when i wanted grub in the mbr so i did dd if=/dev/hda4 of=/dev/hda bs=512 count=1 04:58:36 i even made a backup in my home directory first in case something got messed up, how helpful 05:00:07 (the joke is that the partition table is stored in the mbr, as i discovered that day) 05:00:30 this is the worst sound of all sounds: http://www.youtube.com/watch?v=Z5h411OcttA 05:00:36 good effort 05:01:26 having an install fail by the usb inexplicably not working during boot sucks 05:04:20 -!- zzo38 has joined. 05:04:51 -!- gully_foil_Ja has quit (Ping timeout: 276 seconds). 05:21:06 -!- LinearInterpol has quit (Ping timeout: 276 seconds). 05:35:42 -!- tromp_ has quit (Remote host closed the connection). 05:36:15 -!- tromp has joined. 05:40:30 -!- tromp has quit (Ping timeout: 245 seconds). 05:48:51 http://www.yopmail.com/en/alternate-email-address.php I somehow doubt this is secure 05:49:12 Would have to check the code to see if it looks reasonable 05:49:16 Which doesn't mean it is 05:51:14 Sends the typed email over to the server to convert it, I think 05:56:11 Just PCI passthrough and virtualize everything with dom0 snapshot unicycle. 05:57:16 Huh, youtube now hosts 4 GB videos. 06:02:24 Sgeo: yeah they can read your email, huge vulnerability 06:03:06 The question is, if random person X can get the real email address from the alias 06:03:17 How does translation from lambda calculus to B,C,K,W () work? 06:03:33 Depends on the distribution of X, but unlikely. 06:03:52 translate to ski and then translate ski to bckw, oooooooobviously 06:04:13 tht's pronounced with an 'oo' like 'cool' 06:05:53 thx 06:06:03 is there something nice and structural like ski 06:06:14 structural? 06:08:13 who knows what i mean 06:09:12 ok jstor i'm not going to pay you $24 for curry's thesis from 1930 which is in german so i won't even be able to read it 06:14:39 huh, zsh puts the return code of the last call just before your line 06:15:17 you can get that in bash too 06:15:45 just put $? in your PS1 06:15:57 gosh. 06:16:57 Does zsh even do that "by default"? 06:21:25 i don't know, the install thingie is, that's all i know 06:36:25 Now I added into HWPL, some new functions such as TAKE and PHYSICAL, and a few other things. I also made up a file of examples, although maybe it contains some errors, since it isn't tested. 06:44:35 -!- Bike has quit (Ping timeout: 265 seconds). 06:46:16 -!- Bike has joined. 07:11:46 Do you like these kind of codes? FOR ?X IN ?ADDRESS BITS: BEGIN LOCAL .REG; REGISTER .REG(?DATA); CONNECT .REG TO .DATA WHEN .READ&~|(?X^.ADDRESS); LATCH .WRITE&~|(?X^.ADDRESS) SET .REG TO .DATA; END Maybe it is wrong or inefficient or something though, but it is trying to implement RAM. Also, use of TAKE and unary % operation will be like: CONNECT TAKE(MUX(%.S,{%.I1,%.I0}))&~-./E TO .Y; 07:12:53 that is ugly as fuck. 07:13:08 To you it is! 07:14:56 You must hate it a lot, but I find it better. Maybe there is other feature other people hate of other hardware programming languages too; it is one reason why other people try to invent more possible hardware programming languages, isn't it? 07:15:23 i don't mean the content, i'm just saying, that has fucking "&~|(?X^." in it, that is some fucked shit. 07:15:41 You can space it out more if you prefer. 07:16:15 The individual tokens there will be .WRITE & ~ | ( ?X ^ .ADDRESS ) 07:18:12 Do you prefer it this way? 07:20:41 Is the purpose of these commands clear from the example, or not? If not, you can ask for clarification, please. 07:21:38 -!- impomatic has joined. 07:26:46 -!- tromp__ has quit (Remote host closed the connection). 07:27:10 -!- tromp__ has joined. 07:27:32 -!- FreeFull has quit. 07:31:17 -!- ^v has quit (Quit: http://i.imgur.com/MHuW96t.gif). 07:35:27 http://www.cnn.com/2014/01/06/tech/california-crop-circle-hoax/index.html?hpt=hp_t2 07:35:31 Isn't that... vandalism? 07:35:47 I'm alive... I'm alive.. I'm alive... and how I know it... but for chips and for freedom I could die 07:42:39 http://dilbert.com/strips/comic/1991-04-24/ 07:48:14 -!- myndzi has changed nick to 2JTAAB023. 07:48:18 -!- qlkzy has joined. 07:48:18 -!- myndzi has joined. 07:48:18 -!- CADD has joined. 07:48:57 "So Nvidia is marketing this new chip to braille users? This way blind people can see computer graphics more clearly with vivid colors. It turned out to be a public service announcement. Mystery solved!" 08:03:02 http://en.wikipedia.org/wiki/Zooko%27s_triangle 08:03:08 I'm not used to thinking of this as disproved 08:10:22 -!- Bike has quit (Quit: loud). 08:24:19 Which instructions sets would include a triple-indirect-jump-with-post-increment instruction? 08:30:31 none 08:32:54 zzo38: [[[ax]++]]? 08:33:26 ais523: Yes, like that 08:34:02 I can't think of an instruction set that would allow that, but not arbitrary combinations of addressing modes 08:38:42 Kind of bothers me that all .bit registrations are browsable 08:38:56 Doesn't DNS attempt to deliberately prevent browsing of all registrations? 08:39:00 Or am I mistaken? 08:39:25 hmm… I think there's a much simpler Zooko's triangle solution 08:39:37 in particular, the web-of-trust that's used for public keychains 08:40:04 it's obviously decentralized, it's secure in that you know exactly how much you trust each individual entry 08:40:27 and it's memorable in that the keys are associated with human-readable names, and you can adopt the name associations listed by people you trust 08:41:22 ais523: that's not a global naming system 08:41:32 making names relative is one way of squaring the triangle 08:41:51 elliott: hmm, the description doesn't imply "global" 08:41:53 plus, there's no way of going name -> key uniquely 08:42:02 and there is relative to any particular person 08:42:10 I guess the "name" would be an IP 08:42:14 because you can't adopt two name→key mappings with different names 08:42:16 "Each application type that want to store data associated with an identity must be added in the registered applications list with a description on how data will be formatted." 08:42:20 but then it fails human-readable (because key identifiers are not human readable) 08:42:27 How decentralized 08:42:34 I guess my goalposts are in different places from yours 08:42:55 well, I don't even quite understand what you're proposing or how it's even a naming system I guess :/ 08:44:04 I didn't realise that the article was about naming systems 08:50:57 Delegate your domain and subdomains to DNS servers: 08:50:57 Recommended : 08:50:57 {"ns": ["ns0.web-sweet-web.net", "ns1.web-sweet-web.net", "ns0.xname.org"]} 08:51:09 uh.... so basically, point to normal DNS? 08:52:10 I don't think "DNS" itself really attempts to prevent browsing of all entries, though maybe the DNSSEC no-enumeration NSEC3 stuff counts. 08:52:22 (Common DNS deployment practices do, sure.) 08:52:53 -!- ais523 has quit. 08:53:11 Are .pif files still alive in some shape or form? (Sure it's relevant.) 08:56:22 fizzie: I think so. 08:56:31 Though they should not work on windows 64-bit anymore 08:56:55 and as far as I know windows 32 bit requires you to enable a feature to execute 16bit programs 08:57:05 but 64bit versions don't ship with support for 16bit programs anymore 08:57:20 So you should need an emulator, I suppose, in such a case. 08:57:26 and by windows 32 bit I mean windows >= 7 perhaps? 08:57:39 windows xp executes 16bit programs by default 08:58:57 although 08:59:02 PIF's aren't really executables 08:59:37 Ooh, I should try to get Microsoft Ants working in VM 08:59:44 I miss Ants 09:00:10 It's to blame for my habit of saying ??? when I'm confused (I did eventually drop that habit) 09:00:57 Can PIFs point to 32/64bit programs? 09:03:05 Interweb is saying that 32-bit Windows 8 still makes a .pif file if you try to make a shortcut to a 16-bit DOS executable. 09:04:03 Ok. 09:04:23 Windows 64bit might still do that without being able to actually run a 16bit program 09:04:44 which would not be really helpful at all 09:05:16 hm 09:05:21 where can I see if I have Win64? 09:05:36 ah there 09:05:38 SysWOW64 09:05:39 ok 09:06:39 well. 09:06:53 rightclick -> create shortcut on a .com-file does not work 09:07:04 but I just created an empty txt file and renamed it to com 09:28:06 -!- oklopol__ has changed nick to oklopol. 09:28:15 so i did some google searching with python 09:28:30 and apparently google banned me forever (except if i use chrome) 09:28:54 i did a search every minute or so, and when the search failed i added another minute 09:29:15 That's what they have APIs for. 09:29:25 ioccc winning sources are released 09:29:33 yeah i didn't find it 09:29:35 b_jonas: See: topic. 09:29:38 yeah 09:29:41 i found apis for everything but search 09:29:50 yay 09:29:55 well i mean i found one 09:29:56 oklopol: Why didn't you... Google for it. 09:30:08 but it seemed too hard to use 09:30:18 pygoogle was much easier 09:30:56 "Don’t misuse our Services. For example, don't -- try to access them using a method other than the interface and the instructions that we provide." 09:30:59 It's what they say. 09:31:30 are you talking about the deprecated one? 09:31:33 or which one 09:31:52 Fun fact: If you desperately google for something 09:31:54 they'll ban you too 09:32:06 the custom search they link looked more like something that lets you put a search box on your website 09:32:21 I got banned googlig (manually) for about 10 minutes. 09:32:56 oklopol: Ban forever? 09:33:14 well obviously i haven't checked that 09:33:22 Yes, obviously 09:33:37 but I thought they give you the chance to answer a captcha 09:33:56 probably, i don't know what's going on because i'm using pygoogle 09:33:59 to prove that your not some bot. 09:33:59 and i don't know what it does 09:34:05 *you're 09:34:11 oklopol: That may be what it looks like, but it has the https://developers.google.com/custom-search/json-api/v1/overview half. 09:35:17 (Also the "custom search box" side is not only for "search my site only", but also "make a topical search engine that rewrites queries" or whatnot.) 09:35:23 if it comes out as json then it's already a million times harder than pygoogle 09:35:35 but perhaps doable 09:36:17 C and C++ have so crazy corners 09:37:53 wow that sounds complicated 09:38:15 i have used an api key thingie once but it was php so i could just copypaste stuff 09:39:20 -!- zzo38 has quit (Ping timeout: 260 seconds). 09:40:12 For smaller sites, Google Site Search starts at just $100 for up to 20,000 annual searches. For usage above one million searches, enterprise-level support and offline purchasing are available. 09:40:27 20000 annual ones is 100 dollars? 09:40:39 -!- zzo38 has joined. 09:40:41 i need to do 1400 queries, i figured that's nothing 09:40:50 GSS is a whole another thing than CSE, though. 09:40:54 i know, but still 09:41:24 "For CSE users, the API provides 100 search queries per day for free. If you need more, you may sign up for billing in the Cloud Console. Additional requests cost $5 per 1000 queries, up to 10k queries per day." 09:42:40 What's this "pygoogle" anyway? The first hit I get just goes "Unfortunately, Google no longer supports the SOAP API for search, nor do they provide new license keys. In a nutshell, PyGoogle is pretty much dead at this point", and the second and third ones seemed to be using the deprecated-but-still-working web search APIs. (Which I think has just a "50 queries per day without an API key" limit ... 09:42:46 ... and no more complicated bans than that.) 09:43:19 pygoogle is what i found by searching for python google search 09:43:22 consistently 09:43:41 also xgoogle and some other thing but someone somewhere said they don't work anymore so i didn't try them 09:44:03 There's also the https://developers.google.com/api-client-library/python/start/get_started thing. 09:44:28 apparently i never found the page that's the first hit with "pygoogle" 09:44:33 (i never searched for pygoogle) 09:45:14 (The official Google-provided Python thing does seem to list Custom Search as one of their supported APIs. But it does have that 100-queries-a-day limit if you want it to be entirely free.) 09:45:37 that looks like i need to spend hours decrypting it 09:46:05 pygoogle was more like import pygoogle and a = pygoogle.search(url).number_or_results() 09:46:12 but yeah i guess i need to do that 09:46:13 asdsad 09:46:35 money is not an issue, but yeah paying is a bit too complicated 09:47:13 The "Simple API example" code is not really all that more complicated. 09:48:02 And it's also not terribly complicated to make a "project" in their "console"; I did that once for their big-data query-executing thingamajick. 09:49:19 (Though I admit they could provide more "anonymous access is supported with one query per minute" kind of features.) 09:49:43 it's probably not complicated once you get it, but understanding apis and such is the hardest thing in the world 09:49:47 (for me) 09:50:13 (It's not like they'd notice that in their flood of search requests via the web interface, and nobody's going to be building a Real Service on something like that, hopefully.) 09:50:40 yeah basically my hope was that they wouldn't mind me slowly querying over the night 09:51:13 You should've probably just used something that crawls the web interface for that. :p 09:51:46 They got (in 2013), on average, 5922000000 requests per day. 09:52:15 i considered that, but again that sounded a bit complicated 09:52:55 especially as i'm on linux and i have no idea how the api works (or whatever it's called) 09:53:36 gcolor used to just use the web interface of Google image search, because they didn't have a programmatic API for it at the time. 09:54:29 Actually, I'm not sure if they do have one now either. 09:55:26 Apparently, since that, they made one and deprecated it already, then spent some more time API-less, then added image search functionality in the Custom Search thing. 09:58:15 i tried to make an api key and now i made a client id and have no idea how to make an api key 09:58:31 and i have no idea what a client id is 09:59:30 Apparently it's for those things that require authentication. 09:59:47 I don't think the custom search one does. 10:02:00 From what I recall, the "workflow" is such that you get in the google cloud service buzzword developer console, make a "project", go to "APIs" and toggle the ones you want to use "on", then go to "credentials" and select the "Public API access" one (and not the "OAuth Client ID" one). 10:02:49 I think I need to go meet some relatives now. 10:03:02 have fun 10:03:05 i need to do the same soon 10:06:54 http://www.machinadynamica.com/machina31.htm 10:25:04 -!- Sorella has joined. 10:51:00 -!- MindlessDrone has joined. 11:13:13 -!- ter2 has joined. 11:16:18 -!- tertu has quit (Ping timeout: 240 seconds). 11:22:19 -!- nortti has changed nick to yesrtti. 11:22:39 -!- yesrtti has changed nick to nortti. 11:24:47 -!- heroux has quit (Ping timeout: 260 seconds). 11:33:29 -!- tertu3 has joined. 11:36:50 -!- ter2 has quit (Ping timeout: 246 seconds). 11:40:46 -!- Phantom_Hoover has joined. 11:42:37 -!- jix has quit (Remote host closed the connection). 11:42:44 -!- jix has joined. 11:49:12 -!- ter2 has joined. 11:53:03 -!- tertu3 has quit (Ping timeout: 276 seconds). 11:53:45 -!- atrapado has quit (Quit: Bye). 12:09:19 -!- LinearInterpol has joined. 12:35:46 -!- tertu3 has joined. 12:35:47 -!- ter2 has quit (Read error: Connection reset by peer). 12:46:18 -!- heroux has joined. 12:51:53 -!- tertu3 has quit (Read error: Connection reset by peer). 12:55:06 -!- Slereah_ has quit (Read error: Connection reset by peer). 12:55:26 -!- Slereah has joined. 13:21:02 `? arrows 13:21:06 arrows? ¯\(°​_o)/¯ 13:21:21 `learn arrows are just strong monads in the category of profunctors 13:21:26 I knew that. 13:21:33 `? arrow 13:21:36 arrows are just strong monads in the category of profunctors 13:21:42 `learn Arrows are just strong monads in the category of profunctors 13:21:47 I knew that. 13:34:37 -!- Sgeo has quit (Read error: Connection reset by peer). 13:37:06 -!- Chillectual has joined. 13:40:21 -!- LinearInterpol has quit (Ping timeout: 248 seconds). 13:57:13 -!- boily has joined. 14:04:32 -!- upgrayeddd has quit (Ping timeout: 272 seconds). 14:07:29 -!- upgrayeddd has joined. 14:08:17 -!- Chillectual has changed nick to LinearInterpol. 14:08:29 -!- boily has quit (Quit: Poulet!). 14:08:42 -!- conehead_ has joined. 14:23:36 -!- conehead_ has quit (Changing host). 14:23:37 -!- conehead_ has joined. 14:23:37 -!- conehead_ has quit (Changing host). 14:23:37 -!- conehead_ has joined. 14:29:21 -!- atrapado has joined. 14:37:42 -!- conehead has joined. 14:40:46 -!- oerjan has joined. 14:44:42 -!- conehead has quit (Quit: Computer has gone to sleep.). 14:45:05 -!- yorick has joined. 15:01:55 -!- MindlessDrone has quit (Quit: MindlessDrone). 15:15:09 -!- mrhmouse has joined. 15:15:30 -!- atrapado has quit (Quit: Leaving). 15:25:52 -!- llamavioleta has joined. 15:43:32 `? monad 15:43:34 Monads are just monoids in the category of endofunctors. 15:43:41 `? endofunctor. 15:43:42 endofunctor.? ¯\(°​_o)/¯ 15:43:44 `? endofunctor 15:43:46 Endofunctors are just endomorphisms in the category of categories. 15:43:46 lol. 15:43:52 `? arrow 15:43:54 Arrows are just strong monads in the category of profunctors 15:44:05 `run sed -i 's/$/./' wisdom/arrow 15:44:09 No output. 15:44:11 `? arrow 15:44:13 Arrows are just strong monads in the category of profunctors. 15:44:42 Taneb: YOU JUST CANNOT PLEASE US, GIVE UP 15:46:05 -!- llamavioleta has quit (Quit: IRcap 8.71 ). 15:49:59 `run echo nixon | grep '/bu|[rn]t|[coy]e|[mtg]a|j|iso|n[hl]|[ae]d|lev|sh|[lnd]i|[po]o|ls/' 15:50:00 No output. 15:50:24 `run echo clinton | grep '/bu|[rn]t|[coy]e|[mtg]a|j|iso|n[hl]|[ae]d|lev|sh|[lnd]i|[po]o|ls/' 15:50:26 No output. 15:50:33 oh oops 15:50:41 `run echo nixon | grep 'bu|[rn]t|[coy]e|[mtg]a|j|iso|n[hl]|[ae]d|lev|sh|[lnd]i|[po]o|ls' 15:50:42 No output. 15:50:50 `run echo clinton | grep 'bu|[rn]t|[coy]e|[mtg]a|j|iso|n[hl]|[ae]d|lev|sh|[lnd]i|[po]o|ls' 15:50:51 No output. 15:51:19 wait. 15:51:29 i think munroe is bullshitting. 15:51:35 You think? :P 15:52:14 mrhmouse: i only started checking because i vaguely recalled nixon was _both_ a president and an opponent. 15:52:53 -!- nooodl has joined. 15:53:27 oerjan: I didn't know that! Either way, the regex doesn't contain an 'x' (so Nixon is right out). It's also missing an 'ob', so the current president is out as well. 15:53:29 `run echo test | grep 'e|a' 15:53:30 No output. 15:53:34 oops 15:53:53 `run echo nixon | egrep 'bu|[rn]t|[coy]e|[mtg]a|j|iso|n[hl]|[ae]d|lev|sh|[lnd]i|[po]o|ls' 15:53:54 nixon 15:54:01 !!! 15:54:06 ok i was just doing something wrong 15:54:08 :( 15:54:30 Taneb: you got closer than usual, i admit 15:54:46 Maybe next time I'll get there 15:54:52 oerjan: am I missing something about that regex, or are my eyes just too tired to read it properly? 15:54:54 `run echo obama | egrep 'bu|[rn]t|[coy]e|[mtg]a|j|iso|n[hl]|[ae]d|lev|sh|[lnd]i|[po]o|ls' 15:54:55 obama 15:55:08 mrhmouse: it's not anchored at the ends, might be it. 15:55:19 `run echo romney | egrep 'bu|[rn]t|[coy]e|[mtg]a|j|iso|n[hl]|[ae]d|lev|sh|[lnd]i|[po]o|ls' 15:55:21 No output. 15:55:22 Ahhh, it's only partially matching. 15:55:22 `run echo kerry | egrep 'bu|[rn]t|[coy]e|[mtg]a|j|iso|n[hl]|[ae]d|lev|sh|[lnd]i|[po]o|ls' 15:55:24 No output. 15:56:04 `run echo abbott | egrep 'bu|[rn]t|[coy]e|[mtg]a|j|iso|n[hl]|[ae]d|lev|sh|[lnd]i|[po]o|ls' 15:56:05 No output. 15:56:07 HMMM 15:56:19 Conclusion: Tony Abbott isn't president of the US 15:56:25 `run echo obama | egrep -o 'bu|[rn]t|[coy]e|[mtg]a|j|iso|n[hl]|[ae]d|lev|sh|[lnd]i|[po]o|ls' 15:56:26 ma 15:56:32 Yeah, that's what I was missing. 15:59:29 `run echo carter | egrep 'bu|[rn]t|[coy]e|[mtg]a|j|iso|n[hl]|[ae]d|lev|sh|[lnd]i|[po]o|ls' 15:59:30 carter 15:59:56 he of course was also an opponent, since he lost to reagan. iirc. 16:04:10 Didn't Nixon lose to Kennedy? 16:04:24 yes that's what i was remembering 16:05:56 -!- FreeFull has joined. 16:19:49 there are quite a number of presidents who were also opponents, so i imagine the list of "don't match" strings is a good bit shorter 16:21:46 `run echo ford | egrep 'bu|[rn]t|[coy]e|[mtg]a|j|iso|n[hl]|[ae]d|lev|sh|[lnd]i|[po]o|ls' 16:21:47 No output. 16:21:53 pointed out on forum 16:22:08 asdasd 16:22:42 (the only one who was an opponent, a president, but never elected as one) 16:34:01 makes sense 16:39:37 -!- oerjan has quit (Quit: Gerald Fnord). 16:59:12 -!- LinearInterpol has quit (Ping timeout: 276 seconds). 17:04:50 Can HackEgo pipe to haskell? 17:04:56 somehowe 17:04:59 -e 17:06:08 -!- Sprocklem has joined. 17:06:33 -!- fungot has quit (Ping timeout: 252 seconds). 17:07:35 -!- fizzie has quit (Ping timeout: 245 seconds). 17:10:47 -!- fizzie has joined. 17:15:10 -!- Slereah_ has joined. 17:16:06 -!- Slereah has quit (Ping timeout: 276 seconds). 17:45:01 -!- atrapado has joined. 17:50:43 -!- LinearInterpol has joined. 18:15:15 -!- tswett has joined. 18:23:48 -!- mrhmouse has quit (Read error: Connection reset by peer). 18:26:03 -!- Picky_Nurse has joined. 18:26:35 -!- Picky_Nurse has left. 18:27:17 Here's a language for you. 18:27:21 The program is a graph. 18:27:55 The memory state consists of a coloring of its nodes black or white. Initially, all nodes are black.' 18:28:34 One execution step consists of nondeterministically selecting a node that's the same color as a majority of its neighbors, and flipping its color. 18:28:44 Execution halts when there are no longer any such nodes. 18:29:00 -!- conehead has joined. 18:29:25 ("A majority", as always, means "more than half".) 18:37:47 -!- MindlessDrone has joined. 18:38:49 tswett: nondeterministically as in a nondeterminisitc automaton, or as in random? 18:39:52 Let's say nondeterministic as in "unspecified behavior". 18:40:01 Which, I suppose, isn't necessarily nondeterministic at all. 18:42:33 I mean does it pick an ideal path, or just according to some probability distribution/ 18:43:55 A valid implementation can use any method to select the node. In particular, it doesn't have to pick an ideal path. 18:46:55 ok 18:47:08 i.e. assume it's adversarial 18:48:28 tswett: How would that be used to commpute things? 18:48:31 compute* 18:49:33 FreeFull: you would have to ensure that every possible path gives you a useful result 18:49:36 this may be tricky... 18:50:04 I'm trying to think how you could propagate a signal, like you'd have to in a CA. 18:50:47 tswett: undirected graph? 18:50:52 coppro: yeah. 18:51:32 the problem I see is fanning out 18:51:40 -!- mrhmouse has joined. 18:51:42 once you have that you can propagate an arbitrary distance by shrinking at each step 18:52:06 reuse is also a problem. I don't see how most components would reset 18:52:27 Yeah, I don't immediately see how you could make something that continues running forever. 18:54:12 I don't think this is turing complete 18:58:24 i like the idea 18:58:53 i would however force it to be deterministic 19:00:55 Using a directed graph instead would make this a lot easier. 19:01:15 I think you could construct logic gates pretty trivially. 19:01:31 you start getting near petri nets now 19:02:10 Oh, that reminds me. Petri nets of song lyrics would look pretty cool. 19:02:31 what? 19:03:14 A Petri net where each transition is labeled with a fragment of a song's lyrics. 19:03:43 which should do wat? 19:03:45 The Petri net executes deterministically (because there's only one possible execution path), and the order of execution produces the song's lyrics. 19:05:27 So, imagine a net with three places, A, B, and C. Initially, A has 11 tokens, B has none, and C has I-dunno-a-bunch. 19:06:04 There's a transition labeled "NAH" taking one token from A and putting one token in B. Then there's a transition labeled "HEY JUDE" taking 14 tokens from B and one from C, and putting one in A. 19:06:14 -!- Sprocklem has quit (Ping timeout: 264 seconds). 19:06:15 s/14/11/ 19:06:27 The result is that you get "NAH NAH NAH NAH NAH NAH NAH NAH NAH NAH NAH HEY JUDE" a bunch of times. 19:11:22 tswett: I'm not sure a directed graph is TC. I'm still unsure about how resets would work 19:11:29 actually, you might be able to get away with this 19:11:56 NAND and FANOUT are all you need for TC, right? 19:12:10 or AND, OR, NOT, FANOUT? 19:12:20 FANOUT is trivial, so that's easy 19:12:47 -!- Sprocklem has joined. 19:12:56 oh wait, just need AND and NOT since that gets NAND 19:13:01 You can make NOT just by doing FANOUT to two and having both of them point at another node. 19:13:02 AND is also easy, which just leaves NOT 19:13:11 tswett: wha? 19:13:18 oh I completely forgot the semantics 19:13:20 wow, yeah 19:13:25 with directed graphs it's easily TC 19:14:23 @doc System.IO 19:14:23 http://haskell.org/ghc/docs/latest/html/libraries/base/system-io.html 19:15:13 -!- Bike has joined. 19:16:31 -!- lambdabot has quit (Quit: updating). 19:16:53 -!- rodgort` has quit (Ping timeout: 248 seconds). 19:18:34 -!- rodgort has joined. 19:20:33 -!- lambdabot has joined. 19:20:36 @doc System.IO 19:20:41 http://haskell.org/ghc/docs/latest/html/libraries/base/System-IO.html 19:21:39 So, how am I going to make this Petri net... 19:25:23 Some fragments, like "HEY JUDE", are used all over the place. So I'd probably just have a "HEY JUDE 'in' place" and a "HEY JUDE 'out' place", and the HEY JUDE transition just takes from one and puts in the other, and... yeah. 19:40:30 -!- conehead has quit (Quit: Computer has gone to sleep.). 19:50:51 are you writing a petri program that prints the hey jude lyrics 19:55:45 -!- 2JTAAB023 has quit (Ping timeout: 252 seconds). 19:55:51 I was, and then I got bored. 19:57:45 -!- myndzi\ has joined. 20:01:59 -!- Slereah has joined. 20:03:33 -!- rodgort has quit (Ping timeout: 240 seconds). 20:03:34 -!- Slereah_ has quit (Ping timeout: 240 seconds). 20:05:04 -!- rodgort has joined. 20:32:38 -!- AnotherTest has joined. 20:46:30 -!- MindlessDrone has quit (Quit: MindlessDrone). 20:48:27 kmc: you can't look up anything from this book on the google without finding spoilers :'( 20:50:31 -!- Sprocklem has quit (Ping timeout: 246 seconds). 20:59:30 How to Fix a Guitar http://youtu.be/glxAKmY8p1k 21:02:03 -!- conehead has joined. 21:02:51 shachaf, spoilers are overrated 21:07:05 http://www.techdirt.com/articles/20140106/00442525768/fbi-admits-its-not-really-about-law-enforcement-any-more-ignores-lots-crimes-to-focus-creating-fake-terror-plots.shtml 21:10:52 Ah, national security theater 21:11:50 I can't even blame them much ... the easiest way to find a terrorist plot is to make one up yourself. 21:13:10 -!- Oj742 has joined. 21:18:26 -!- Sprocklem has joined. 21:23:29 I just filed my second bug report to gcc ever. 21:24:06 I think that counts as esoteric programming work because it needed some abuse of the C++ language. 21:24:36 gcc has an asm injection bug 21:25:16 mauke: what? 21:25:26 joke failures 21:25:32 mauke: do you mean the old one that involves strange filename for #line directives? 21:25:45 http://gcc.gnu.org/bugzilla/show_bug.cgi?id=52554#c3 21:26:31 ah... 21:26:32 mauke: nice 21:27:57 the starting dollar marks an immediate number there in the assembler, right? 21:28:01 yes 21:28:07 gcc should quote or mangle it, or reject it 21:28:28 I agree it's a bug if it doesn't do any of those 21:28:48 and yes, that counts as suitably esoteric as well 21:30:12 http://gcc.gnu.org/bugzilla/show_bug.cgi?id=20140 this one was reported in 2005 and fixed in 2012 21:30:31 -!- Oj742 has quit (Ping timeout: 265 seconds). 21:32:55 I'll now try to understand the C++ overloading rules to figure out whether I can reproduce the crazyness I want without variadic functions and preferably without templates 21:34:07 what craziness is this? 21:35:26 "(void)s;" 21:35:30 What happens when you cast something to void? 21:35:36 nothing 21:35:38 tswett: nothing special. the value is lost. 21:35:46 I wish C++ supported void values. :-( 21:35:48 you can cast anything to void to get a void expression 21:35:52 no, void values don't exist 21:36:31 you can use void expressions as a statement, or as the left argument of the comma operator, or in a few other places 21:36:35 b_jonas: how did you ever discover 20140? 21:36:59 by reading this channel 21:37:04 tswett: ask mauke, that wasn't me 21:37:25 mauke: how did you ever discover 20140? 21:37:37 let's see 21:37:39 mauke: http://gcc.gnu.org/bugzilla/show_bug.cgi?id=59704 is the bug, the story is a bit complicated 21:37:48 (void)s; is used to make gcc/g++ not throw "unused variable" erros when compiling with -Werror 21:37:53 At least gcc supports void f(); void g { return f(); } 21:37:59 I don't quite remember what I used the buffers for 21:38:20 mroman: not only that. it has other uses too 21:38:27 but not void x = f(); return x; :'( 21:38:34 mroman: for example, it allows you to use the comma operator on any value without fearing of triggering an overloaded comma 21:38:37 Er, I mean void g(), of course. 21:39:20 Can you declare a void variable at all? 21:39:24 mauke: basically, Jens Gustedt has discovered a way in C to test whether an expression in compile time constant: http://gustedt.wordpress.com/2013/08/22/testing-compile-time-constness-and-null-pointers-with-c11s-_generic/ 21:39:34 tswett: no, nor a void parameter 21:39:51 mauke: but his solution uses a quirk that doesn't work in C++, so we were wondering if it's possible in C++ too 21:40:05 mauke: I think it's possible, but there seems to be a gcc bug that breaks it 21:40:34 -!- AnotherTest has quit (Read error: Connection reset by peer). 21:40:38 -!- AnotherTest_ has joined. 21:40:50 -!- AnotherTest_ has changed nick to AnotherTest. 21:41:23 tswett: it may have been for runtime code generation 21:42:16 also, cast to void can be useful to write a ?: expression where you don't care of the return value but the two arms have completely incompatible types 21:42:45 and cast to void also helps in some nice macro tricks 21:42:48 or maybe it was for the generic constructor? 21:43:00 if condition then action1 >> return () else action2 >> return () 21:43:07 Looks legit. 21:43:34 Isn't it nice how every language can be written in Haskell... 21:44:57 well, haskell is crazy in a different way than C++ is crazy 21:45:56 there might be a second gcc bug here, I'll have to examine this 21:45:59 if condition then void action1 else void action2 21:46:25 if (condition) action1; else action2; 21:51:46 wtf 21:51:48 this si wierd 21:53:59 there's something I really don't understand here 21:54:05 I'll have to ask the c++ guys 21:55:10 whoa, what's _Generic? typecase? 21:55:18 yep 21:55:20 mauke: yes 21:55:26 new in C11 iirc 21:59:18 Yep. 22:05:50 -!- atrapado has quit (Quit: Leaving). 22:08:17 -!- AnotherTest has quit (Ping timeout: 240 seconds). 22:08:56 -!- tertu3 has joined. 22:08:57 wtf 22:09:03 constexpr int v = argc - argc; compiles 22:09:05 So do all C compilers get this right? :-) 22:09:14 mauke: oh! 22:09:29 That is ... interesting. 22:09:32 but covl(0, v) says it's nonconstant 22:10:30 char *p; constexpr ptr_diff_t d = (p+4) - p; // is this supposed to work? 22:11:33 -!- ais523 has joined. 22:11:34 -!- atrapado has joined. 22:12:12 -!- Sprocklem has quit (Read error: Operation timed out). 22:12:22 too esoteric for me 22:12:29 there's no second bug, it was a misunderstanding at my part 22:12:45 mauke: no 22:12:50 mauke: covl? 22:13:04 mauke: v doesn't convert to a pointer but 1*v does, because v is an lvalue 22:13:06 elliott: http://gcc.gnu.org/bugzilla/show_bug.cgi?id=59704 22:13:10 int-e: I think p+4 may be undefined, depending on what p points to 22:13:19 mauke: only _prvalue_ constant expressions of integral type and value zero convert to a null pointer 22:13:31 (not counting nullptr_t expressions) 22:14:05 mauke: so v must not convert to a null pointer 22:14:23 not even if you say const int v = 0; 22:14:49 it's complicated 22:15:07 try.cc:5:32: error: '* &' is not a constant expression 22:15:07 const constexpr int &v = argc-argc; 22:15:07 ^ 22:15:12 u wot m8 22:15:37 mauke: good luck trying to understand C++, I must go now 22:16:45 olsner: I was speculating about why constexpr int v = argc - argc might be supposed to work. Taking the difference of pointers seems to be the most useful case where such cancellation might turn up. 22:17:13 olsner: (But I don't know whether it is supposed to work.) 22:17:26 what if argc is NaN, huh! 22:18:08 it's an int. 22:18:15 it doesn't compile if argc is a double 22:18:27 and argc-argc can't even overflow. 22:18:44 (close one!) 22:18:47 I'm testing with constexpr int v = x == x; 22:30:02 -!- callforjudgement has joined. 22:30:50 -!- ais523 has quit (Ping timeout: 264 seconds). 22:40:40 -!- oerjan has joined. 22:42:52 `run ghc -e 'putStrLn "Yes"' 22:42:59 Yes 22:44:14 `run echo 'main = putStrLn "Maybe."' | runhaskell 22:44:18 Maybe. 22:44:56 @tell mroman Can HackEgo pipe to haskell? <-- `run echo 'main = putStrLn "Yes."' | runhaskell 22:44:57 Consider it noted. 22:46:51 @tell mroman `run ghc -e 'putStrLn "This also works."' 22:46:51 Consider it noted. 22:49:36 `unidecode ‑ - 22:49:38 ​[U+0020 SPACE] [U+2011 NON-BREAKING HYPHEN] [U+0020 SPACE] [U+002D HYPHEN-MINUS] 22:56:22 -!- Sprocklem has joined. 22:58:51 -!- EgoBot has quit (Remote host closed the connection). 23:01:57 -!- EgoBot has joined. 23:02:11 -!- Gregor has quit (Read error: Operation timed out). 23:02:18 -!- Gregor has joined. 23:04:00 It definitely seems like most programming languages are subsets of Haskell. 23:04:55 tswett, what about Agda 23:05:07 Agda is one of the programming languages that is not a subset of Haskell. 23:05:30 I don't think Haskell is a subset of Agda, either. Not sure about that one. 23:05:36 They might both be subsets of Idris. 23:06:00 Anyway, I'm trying to think how E could be seen as a subset of Haskell. 23:06:20 E, esoteric, ire to see 23:06:29 My first thought, as with all my attempts to interpret a programming language as Haskell, is "use a monad!" 23:06:54 -!- zzo38 has left. 23:06:57 -!- zzo38 has joined. 23:06:57 tswett: it seems to me like your graph thing is harder to program because you have all nodes be black at the outset, which means _any_ node can change on the first step. 23:07:39 oerjan: huh, you're right. 23:09:47 need to know the twoducks subset 23:09:52 So, in E, there are these things called objects, and there are these things called references (which can be futures, as in http://en.wikipedia.org/wiki/Futures_and_promises). A fancy thing you can do with an object is to "eventual send" a message to it, with some references as arguments. 23:10:11 Bike: obviously you need the Tardis monad somewhere. 23:10:34 And a fancy thing you can do with a reference is to "wait" on it, given a function from an object to a reference; the result is a reference to the eventual result. 23:10:36 So, uh. 23:10:53 Something like this: wait :: ERef a -> (EObj a -> ERef b) -> ERef b 23:11:15 Which looks suspiciously monadic already. 23:11:28 >>= takes a continuation 23:12:07 If you drop the EObj constructor (and I see no reason not to), that's wait :: ERef a -> (a -> ERef b) -> ERef b. Very monadic-looking. 23:12:19 Yes it looks monadic, but for what category (if you don't drop the EObj)? 23:12:22 And, of course, given an object, you can make a reference to it: a -> ERef a. 23:12:41 Uh, give me a few moments to remember how monads and categories relate. 23:12:59 monoid on the category of endofunctors 23:13:13 @quote copumpkin lax 23:13:13 copumpkin says: a monad is just a lax functor from a terminal bicategory, duh. fuck that monoid in category of endofunctors shit 23:13:27 i am pwend 23:13:35 also i can't tell if Bike is saying that to be helpful or unhelpful or what 23:13:46 neither can i 23:14:06 A monad is a type of endofunctor, right? And... it sounds like the question of "what category" is just the question of what the domain of "ERef" is. 23:14:09 endomeme 23:14:48 In the case of Haskell the functor is from and to the category of Haskell functions. 23:14:56 So it maps Haskell functions to Haskell functions. 23:15:09 Proposal for a new conjunction: eqv'ly. "a eqv'ly b" asserts that "a" and "b" are the same thing, and means "a", or, equivalently, "b". 23:15:19 tswett: Yes, a monad is a endofunctor with return and join added following certain laws (or, alternatively, a Kleisli category) 23:15:32 a monad is just a free monad monad monad algebra 23:15:49 A monad is just an element of the collection of monads. 23:16:36 But a monad needs return :: forall x. x -> m x not ERef a -> (EObj a -> ERef b) -> ERef b; so it isn't quite a monad on (->) (if you drop the EObj then it might be, if it still follows the monad laws, though) 23:16:39 -!- Sprocklem has quit (Ping timeout: 240 seconds). 23:16:56 Pretty sure this follows the monad laws. 23:17:03 OK 23:17:11 -!- ^v has joined. 23:17:17 Those are what, again... 23:17:33 One way to mention the monad laws is simply to say that the Kleisli category is, in fact, a category. 23:18:35 mauke: What if argc is a trap value? 23:19:05 no such thing 23:19:09 Yeah. I'm quite sure this follows the monad laws. 23:20:13 Now, the semantics of eventual sends are really pretty complicated. 23:23:39 You have an event queue (which need not actually be a queue, but does need to have certain ordering properties). Every ERef is a reference to the result of one of these events (perhaps an event that hasn't happened yet). 23:24:14 I think that, at least to an approximation, creating an ERef is the same thing as putting an event on the queue. 23:25:14 -!- mrhmouse has quit (Quit: Leaving.). 23:25:28 This means that both return :: a -> ERef a and >>= :: ERef a -> (a -> ERef b) -> ERef b put events on the queue. It's likely that this can be done without side effects. 23:30:45 return creates a pretty boring event; this event just immediately returns a value. >>= also creates a boring event; it just waits for a first event to finish, calls a second event with the result, waits for the second event to finish, and returns the result. 23:50:08 -!- ^v has quit (Remote host closed the connection). 23:52:27 -!- ^v has joined. 23:57:30 -!- ter2 has joined. 23:58:12 Now, suppose I want to create an E object with a single method, which nominally takes a Char and returns an Int. Well, when I do that in E, my method doesn't actually necessarily get a Char; it merely gets a reference to a Char. But it doesn't have to return an Int; it merely has to return a reference to an Int. 23:58:59 So if I have a function "ERef a -> ERef b", I ought to be able to create one of those E objects with a single method. Let's call it an EFunc, how about. So the function is (ERef a -> ERef b) -> EFunc a b. 2014-01-07: 00:00:47 Then the type of the "eventual send" function is kinda scary: ERef (EFunc a b) -> ERef a -> (ERef (EFunc a b), ERef b) 00:01:00 -!- yorick_ has joined. 00:01:12 Given a reference to a function and a reference to an argument, I can send the argument to the function. The result is a reference to the result, as well as a new reference to the function. 00:02:09 If you send a message X to Alice and get a new reference Alice', then the reference Alice' has the property that any message sent to it is guaranteed not to arrive before X does. 00:02:15 -!- FreeFull_ has joined. 00:02:38 -!- Gregor` has joined. 00:02:51 -!- Gregor has quit (*.net *.split). 00:02:51 -!- tertu3 has quit (*.net *.split). 00:02:51 -!- conehead has quit (*.net *.split). 00:02:52 -!- rodgort has quit (*.net *.split). 00:02:52 -!- FreeFull has quit (*.net *.split). 00:02:52 -!- yorick has quit (*.net *.split). 00:02:59 -!- rodgort` has joined. 00:08:15 -!- FreeFull_ has changed nick to Freefull. 00:10:44 -!- conehead has joined. 00:13:34 tswett: aren't you assuming Alice is actually using X there. 00:13:52 oerjan: I'm not sure what you mean by "actually using". 00:14:07 -!- Sgeo has joined. 00:14:37 i mean, if Alice just discards X and gives you a reference back that does not use it. like haskell laziness. 00:15:51 What Alice does with X has nothing to do with the "ERef (EFunc a b)" that you get back; that reference has the same behavior regardless of what Alice does. 00:16:15 The "ERef b" can refer to whatever Alice wants it to refer to. 00:16:42 okay 00:17:05 -!- callforjudgement has changed nick to ais523. 00:17:26 Writing agda via ssh on my tablet is not particularly fun 00:20:07 -!- Gregor` has changed nick to Gregor. 00:21:02 All right, so this is four ways of getting a reference, right? You can create a reference to an object; you can use >>= to call a function on a reference, giving you a new reference; and you can eventual-send to an object, giving you both a new reference to the object, and a reference to the result of the send. 00:24:44 Then an important question is, when does an ERef a become "resolved", and what do we care... 00:27:14 -!- nooodl has quit (Ping timeout: 264 seconds). 00:50:11 All right, I guess the main operator is "send an argument reference to a target reference, yielding a result reference and a new version of the target reference". On the other side, an object is defined by one or more functions which take the state of the object and an argument reference, and return a result reference. 00:54:35 -!- FireFly has quit (Ping timeout: 245 seconds). 00:57:00 -!- myndzi\ has quit. 00:57:18 -!- myndzi\ has joined. 00:57:42 -!- myndzi\ has quit (Client Quit). 00:58:57 This is all made a bit difficult by the fact that Haskell's type system isn't really set up for object-oriented programming. 01:03:36 hey nerds, anyone know what iommu does, i have a mystery on my hands 01:04:10 Sure. It's like paging, but on DMA. 01:04:42 now riddle me this, why do i have to have it enabled for my NIC to function? 01:05:21 Hard telling. There's many possibilities. 01:05:42 Maybe your NIC can only handle 32-bit addresses, and it needs to access a buffer that the kernel's shoved above that space. 01:05:47 i ask because i've been fucking with drivers on a decapitated system all day only to find that i needed some fucking bios option 01:06:28 https://bbs.archlinux.org/viewtopic.php?pid=1294989 behold my salvation. 01:06:42 jesus has returned, as a forum thread, to save me 01:08:19 Could also be the case that the device can only deal with a single large buffer, and the kernel hands the device that by using the IOMMU. 01:08:28 I dunno, it depends on implementation details a lot. 01:08:43 it seems unlikely someone would design a card like that, because IOMMU is pretty recent? 01:08:47 I don't really know though 01:08:54 wonder if Fiora knows 01:09:02 -!- tromp has joined. 01:09:29 the motherboard is fairly new, not sure about the nic 01:09:37 i guess if the nic is part of the mobo they can assume you have it 01:09:42 i think it might be some kind of weird driver quirk. i pretty much hate all network drivers at this point 01:09:47 the nic is in the mobo, yeah 01:09:50 The NIC's a few years old, but probably newer than IOMMU. 01:09:54 very nearly bought a pci one... 01:10:06 -!- drlemon has quit (Read error: Connection reset by peer). 01:10:11 I know it's a few years old because my *last* computer had that exact kind. 01:10:15 It also had an IOMMU. 01:10:36 i'm guessing you didn't need to enable it for network. 01:10:38 ok 01:10:59 I don't know, it was on by default in the BIOS. 01:11:08 hm. 01:11:19 this is why i need to get with fucking w/ my fpga's ethernet. write some drivers. make some spite 01:13:15 -!- Phantom_Hoover has quit (Quit: Leaving). 01:15:09 note that when i say the ethernet didn't work, i mean that everything reported that the interface was fine, but i'd time out with dhcp or any kind of router communication. 01:17:35 http://tastetheburritobox.com/ 01:21:06 i'm naming this computer syadavaktavyah in honor of me not knowing what the fuck 01:24:48 Bike: jain't nothing wrong with your computer 01:25:32 very good 01:25:46 don't they have thsoe in japan 01:26:07 i thought they were more an indian thing 01:26:24 or are you referring to the burrito boxes. 01:26:40 The burrito boxes, yeah. 01:26:47 all of the vending machines I saw in Japan were pretty low tech and boring 01:26:49 I was disappointed 01:27:22 probably there's some enormous vending machine district in Tōkyō that I should have visited 01:27:24 kmc: all the advanced ones start making things almost, but not quite unlike tea and have to commit seppuku. 01:27:29 heh 01:27:44 there were claw machines that dispensed large sausages 01:27:56 and capsule machines with used panties 01:28:05 but neither of those is that interesting from a technological perspective 01:29:18 kmc: just reverse those hth 01:29:30 large panties and used sausages? 01:29:47 kmc: what about the pizza vending machines? 01:29:49 -!- Bike has quit (Ping timeout: 246 seconds). 01:29:52 haven't seen 01:29:55 kmc: syadavaktavyah 01:30:28 syadavaktavyahth 01:30:39 -!- Bike has joined. 01:42:50 -!- ais523 has quit. 01:52:34 -!- Sorella has quit (Quit: It is tiem!). 01:57:25 -!- conehead has quit (Quit: Computer has gone to sleep.). 02:18:01 -!- FireFly has joined. 02:28:53 have now moved on to uefi problems, i'm hitting some kind of cosmic checklist 02:29:22 circles of hell 02:29:44 unaligned pointer 022 02:29:47 0x22, rather 02:30:14 also my mobo has a shitty implementation of AMD-Vi apparently, whatever that means! 02:34:52 -!- yorick_ has quit (Remote host closed the connection). 02:35:26 I'm trying to think of geometric concepts that can be defined only in terms of points and lines, without talking about distance at all. 02:35:32 As far as I can tell, there pretty much aren't any. 02:36:13 Like, you can define collinearity. That's pretty much it. 02:36:41 -!- conehead has joined. 02:36:44 Circle? Nope. Triangle? Not without defining line segments, nope. 02:37:17 the dual of collinearity is three lines intersecting in a point hth 02:37:21 why are you trying to think of that 02:37:32 Angle? Maybe. 02:37:42 Bike: because the Faro plane. 02:37:55 What's the dual of an angle? 02:38:44 I guess it's three lines, one of them distinguished. 02:38:51 tswett: note that you cannot define anything that isn't preserved under linear maps and projections. 02:38:58 which excludes angles. 02:39:10 Right, I guess that's obvious in retrospect. 02:39:24 You can define parallelity. But in the Faro plane, no lines are parallel. 02:40:11 you can fix one line as infinite and define parallel as "intersect on the infinite line" 02:40:34 Yeah, but then you pretty much just get the boring four-point plane. 02:40:39 Where "line" means "set of two points". 02:40:58 wat 02:41:17 If you take the Faro plane and denote one line as the line at infinity, and then you remove that line, you're left with four points. 02:41:19 i'm just defining the usual translation from euclidean plane to projective plane here, really. 02:41:30 A four-point plane, in fact. Where the lines are precisely the sets containing two points. 02:41:40 fancy 02:41:59 No three points are collinear, because no line contains three points. 02:42:17 maybe you can define conic sections 02:42:41 probably gets something trivial in the faro plane, though. 02:43:40 but it's not really the fault of the concepts that the faro plane is too small to fit enough distinct examples of them to be interesting. 02:45:20 there are numerical expressions that are preserved under projective transformations although i cannot remember their names. 02:46:36 well hm 02:46:58 you just need four points in the usual projective plane to fix any transformation, i think. 02:50:40 -!- Sprocklem has joined. 02:51:47 Oh yeah, conic sections. 02:52:00 Maybe in the Faro plane, "conic section" just means something like "set of five points". 02:58:11 *Fano 02:58:22 (Faro is a perfect shuffle) 03:00:30 Also may be the word for "lighthouse" in some languages. 03:00:37 Portuguese? Spanish? 03:02:04 arch doesn't have sudo by default. feelin pretty ascetic here 03:02:08 took me two minutes to remember that word 03:02:42 debian doesn't either 03:02:48 if you do the barebones whatever install 03:03:13 i also forgot to put wheel in sudoers so an incident was reported 03:03:28 lol 03:03:33 sudo is pretty fucked anyway 03:03:40 does it not report anything by default? i even checked /var/spool/mail which i have never used in my life 03:03:42 for your typical linux desktop 03:03:58 well i don't want to just log in as root... 03:04:08 it has all this complexity for delegating power to run individual commands, none of which is useful to typical desktop user 03:04:18 oh. yeah. 03:04:28 and the password prompt is little more than a molly-guard, for a typical desktop install 03:04:31 it provides no real security 03:04:41 I think there are simpler sudo-replacements which take these facts into account 03:04:50 got a rec? 03:04:57 nope, haven't used them :/ 03:05:03 also i am probably going to set up an sshd on this thing and use it as a bouncer so as to stop annoying you 03:05:31 hooray 03:06:27 tswett: https://en.wikipedia.org/wiki/Lighthouse_of_Alexandria 03:07:02 it's kind of amusing how incredibly fucked i was without any internet 03:12:09 kmc: what do you mean about the password providing no security? would my set up which requires a fresh password entry for every sudo be considered "atypical" 03:13:11 I think the typical setup has a 5 minute timeout until you have to re-enter the password 03:13:32 you're probably running sudo within a shell and xterm and x session which are controlled by your user account 03:14:36 so if your account gets compromised the attacker can easily compromise one of those and get your password the next time you run sudo 03:14:37 kmc: which changes what? 03:14:43 oh 03:14:46 You're pretty much undoubtedly running it within a shell controlled by your user account. 03:14:48 well yeah 03:15:06 there's also the part where most of the stuff you'd care about an attacker doing/having is in your user account, anyway 03:15:13 yep 03:15:21 Since why would you be running it in someone else's shell. 03:15:24 good thing i don't actually care 03:19:02 yep 03:19:18 yeah, i'm not too worried about getting haxxed really 03:19:36 maybe we can have a new age of viruses, spreading on dumbass linuxers like me 03:19:56 My laptop is set to allow anyone to SSH to it as root with no password. 03:20:11 also i hate minimalism 03:20:17 that's not related i just do 03:20:29 tswett: Why? If it has no internet connection then it might not be as much of a problem, but still it doesn't seem so sensible 03:20:34 what about it Bike 03:20:56 annoyed at people trying to find the once and for all really real perfect minimal computer 03:21:01 It's behind a NAT all the time, except when I'm at school. Then it has a public IP address. 03:21:24 I look in the authorization logs, and apparently lots of people log into it. 03:21:29 I assume they're installing all sorts of malware. 03:21:30 snort 03:22:02 I mean, I know that *some* of them are, because every time I log into an account with my laptop, it gets compromised within a couple of days. 03:22:29 And my web browser is almost unusable because literally more than three quarters of the window are taken up by toolbars. 03:22:39 how joking are you exactly 03:22:47 Bike: Well, I too try to find good instructions sets that I can try to build a good computer. My criterias are to have open source program to implement it in hardware (without vendor lock or patent issues), to be simple, to support 32-bits address, to be supported target by GCC or LLVM, and it can be changed to have different features which I might want. 03:22:56 About 95% joking. 03:23:04 tswett: Then turn off all of the toolbars. 03:23:32 tswett: and here I thought you had found the ultimate "zen" approach to computer security 03:23:43 zzo38: well "simple" doesn't mean much of anything, basically. 03:23:56 zzo38: whenever I turn off a toolbar, the browser crashes. 03:24:11 i cannibalized some old computers, i should set up honeypot puters 03:24:29 attacker gains access, realizes that the machine is from 1992, gives up in disgust 03:24:30 -!- LinearInterpol has quit (Ping timeout: 276 seconds). 03:24:32 ultimate security 03:24:38 tswett: Then make a backup of non-binary files and then erase everything and reinstall everything, and then hopefully it will work 03:24:57 Bike: I doubt it; someone might be interested nevertheless 03:25:01 zzo38: also he's lying about the toolbars 03:25:04 You know how sourdough contains a specific mixture of microorganisms that result in it being completely safe to eat, and if you were to remove the wrong ones, you'd end up with some weird random mixture of bacteria that'd probably kill you? 03:25:06 It's like that. 03:25:25 I don't know about sourdough much 03:25:26 oh yeah, well how many 1992 computers used to turn on my lights have you compromised, huh 03:25:40 tswett: i don't think that's true 03:25:42 about sourdough 03:25:53 douglass_ would know for sure 03:26:02 zzo38: I've tried that, but all the non-binary files I try to copy off the computer automatically get machine translated into Portuguese for some reason. 03:26:17 Bike: Me? I expect, none. But I never tried, and don't intend to, so it doesn't matter. 03:26:25 salt-rising bread, on the other hand, is made using the bacterium which causes gas gangrene 03:26:32 so don't cut yourself while kneading it 03:26:37 you /expect/ none? 03:26:41 do you sleep-hack 03:27:19 Bike: No, but I may have inadvertently done something. 03:27:51 inadveertantly hacked my doorputer? what's wrong with you man 03:27:59 (Well, I suppose maybe I do sleep-hack, but not in the sense you probably mean) 03:27:59 And whenever I try to copy a binary file off the computer, I end up with a file that just says "ÿþ" followed by a line break, in UTF-8. 03:28:19 zzo38: you dreams about hacking eh 03:28:35 quintopia: That isn't what I mean either actually 03:28:55 zzo38: you intentionally screw with your sleep schedule? 03:29:13 And the mode ends up getting set to 7412. 03:29:27 quintopia: Well, I do do that, but I don't know if that is what I mean or not; that is why I wrote "maybe". 03:29:54 this cpu is ten years old, sweeeeet 03:29:57 zzo38: must be hard not to know what you mean 03:30:16 quintopia: That's what *you* think. 03:30:52 * quintopia shuts up 03:32:01 I have looked at a few instruction sets such as ARM2 and MMIX, both of which are supported in GCC but not in LLVM. 03:32:57 Is it possible to use GCC as a LLVM-backend? 03:36:54 `run echo ÿþ | iconv -t latin1 03:36:56 ​ 03:37:05 that didn't work much. 03:37:06 makes you think. 03:37:30 or maybe it did and it just isn't actual utf8 03:37:37 `from-8bit ÿþ 03:37:40 ​iconv: incomplete character or shift sequence at end of buffer 03:37:55 `cat bin/from-8bit 03:37:56 ​#!/bin/bash \ \ enc=$(echo "$1" | iconv -t iso8859-1 | chardet | awk '{print $2}') \ echo "$1" | iconv -t iso8859-1 | iconv -f "$enc" 03:38:52 `run echo ÿþ | iconv -f utf8 -t latin1 | iconv -f utf16le -t utf 8 | unidecode 03:38:54 iconv: conversion to `utf' is not supported \ Try `iconv --help' or `iconv --usage' for more information. 03:38:56 I have also written a program "utftovlq" which is a C program capable to do many of those things too, such as convert UTF-8 to ISO-8859-1, or other things 03:39:11 ISO 1337:1980 Wrought coppers (having minimum copper contents of 99,85 %) -- Chemical composition and forms of wrought products 03:39:13 If such program is loaded you can see if it work or not 03:39:23 very elite 03:39:27 Someone say what I just said, but such that it works. 03:39:44 ISO 420:1994. Photography -- Processing chemicals 03:40:03 "chemicals" 03:40:06 `iconv -l 03:40:06 gettin high on... i don't know what chemicals you use in darkrooms 03:40:07 437// \ 500// \ 500V1// \ 850// \ 851// \ 852// \ 855// \ 856// \ 857// \ 860// \ 861// \ 862// \ 863// \ 864// \ 865// \ 866// \ 866NAV// \ 869// \ 874// \ 904// \ 1026// \ 1046// \ 1047// \ 8859_1// \ 8859_2// \ 8859_3// \ 8859_4// \ 8859_5// \ 8859_6// \ 8859_7// \ 8859_8// \ 8859_9// \ 10646-1:1993// \ 10646-1:1993/UCS4/ \ ANSI_X3.4-1968// \ AN 03:40:14 help 03:40:16 Bike: the bad chemicals 03:40:20 What's that command to pastebin something? 03:40:39 `run echo ÿþ | iconv -f utf8 -t latin1 | iconv -f utf16le -t utf8 | unidecode 03:40:41 iconv: incomplete character or shift sequence at end of buffer 03:40:46 'bad chemicals' means 'good shit' right 03:40:59 -f utf8 -t utf8 should be the default 03:41:08 Right, not "utf 8". 03:41:38 How do you load C program into HackEgo anyways? 03:41:49 `run echo -n ÿþ | iconv -t latin1 | iconv -f utf16le | unidecode 03:41:51 No output. 03:41:59 `run echo -n ÿþ | iconv -t latin1 | iconv -f utf16le | hd 03:42:00 00000000 ef bb bf |...| \ 00000003 03:42:00 kmc: No, the default should depend on the current locale setting, isn't it? 03:42:10 zzo38: in HackEgo i meant 03:42:13 `locale 03:42:14 unidecode doesn't take stdin i thought 03:42:15 LANG=en_NZ.UTF-8 \ LANGUAGE= \ LC_CTYPE="en_NZ.UTF-8" \ LC_NUMERIC="en_NZ.UTF-8" \ LC_TIME="en_NZ.UTF-8" \ LC_COLLATE="en_NZ.UTF-8" \ LC_MONETARY="en_NZ.UTF-8" \ LC_MESSAGES="en_NZ.UTF-8" \ LC_PAPER="en_NZ.UTF-8" \ LC_NAME="en_NZ.UTF-8" \ LC_ADDRESS="en_NZ.UTF-8" \ LC_TELEPHONE="en_NZ.UTF-8" \ LC_MEASUREMENT="en_NZ.UTF-8" \ LC_IDENTIFICATION="en_NZ 03:42:21 `unidecode ä 03:42:22 ​[U+00E4 LATIN SMALL LETTER A WITH DIAERESIS] 03:42:23 (If the locale setting is UTF-8, then yes it should be UTF-8, clearly) 03:42:33 `run echo ä > unidecode - 03:42:33 en_NZ really 03:42:36 No output. 03:42:38 yeah 03:42:44 `run unidecode $(echo -n ÿþ | iconv -t latin1 | iconv -f utf16le) 03:42:46 ​[U+FEFF ZERO WIDTH NO-BREAK SPACE] 03:42:48 How to load C program into HakEgo? 03:42:56 There, finally. 03:43:06 fetch the source and compile it? fetch a binary? 03:43:36 `gcc 03:43:37 gcc: no input files 03:43:52 I have the source, I don't have binary for this computer though; how do I load a file on? 03:43:59 `wget 03:44:00 wget: missing URL \ Usage: wget [OPTION]... [URL]... \ \ Try `wget --help' for more options. 03:44:06 `pwd 03:44:07 ​/hackenv 03:44:32 `fetch 03:44:32 http://: Invalid host name. 03:44:43 `wget http://lpaste.net/raw/98076 03:44:59 You should specify output filename too 03:45:06 Who, me? 03:45:07 (I think it is -O for wget) 03:45:12 Yes, you 03:45:14 ​--2014-01-07 03:44:44-- http://lpaste.net/raw/98076 \ Connecting to 127.0.0.1:3128... Failed to connect to socket 2. \ connected. \ Proxy request sent, awaiting response... No data received. \ Retrying. \ \ --2014-01-07 03:44:45-- (try: 2) http://lpaste.net/raw/98076 \ Connecting to 127.0.0.1:3128... Failed to connect to socket 2. \ connecte 03:45:22 `wget http://lpaste.net/raw/98076 -o 98076 03:45:30 `cat unidecode 03:45:32 ​ä - 03:45:32 Right, right, the DNS thing. 03:45:33 i think there's a whitelist 03:45:51 oerjan: lol oops. 03:45:53 ​--2014-01-07 03:45:23-- http://lpaste.net/raw/98076%20-o%2098076 \ Connecting to 127.0.0.1:3128... Failed to connect to socket 2. \ connected. \ Proxy request sent, awaiting response... No data received. \ Retrying. \ \ --2014-01-07 03:45:24-- (try: 2) http://lpaste.net/raw/98076%20-o%2098076 \ Connecting to 127.0.0.1:3128... Failed to conne 03:45:56 This won't work, but: 03:46:04 `wget http://176.9.42.8/raw/98076 -o 98076 03:46:16 `fetch http://lpaste.net/raw/98076 03:47:07 ​--2014-01-07 03:46:36-- http://176.9.42.8/raw/98076%20-o%2098076 \ Connecting to 127.0.0.1:3128... Failed to connect to socket 2. \ connected. \ Proxy request sent, awaiting response... No data received. \ Retrying. \ \ --2014-01-07 03:46:37-- (try: 2) http://176.9.42.8/raw/98076%20-o%2098076 \ Connecting to 127.0.0.1:3128... Failed to conne 03:47:09 2014-01-07 03:47:08 URL:http://lpaste.net/raw/98076 [373] -> "98076" [1] 03:47:16 `cat 98076 03:47:17 ​-- Hi everyone! 03:47:25 deep 03:47:31 Huh, someone got 98076 somehow. 03:47:41 Musta been you, Bike. 03:47:51 what 03:47:55 `run cat $(which fetch) 03:48:06 i think it's builtin 03:48:11 Bike: you did it, Bike. You made it happen. 03:48:13 `type fetch 03:48:14 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: type: not found 03:48:20 Uh. 03:48:23 `run type fetch 03:48:24 bash: line 0: type: fetch: not found 03:48:26 No output. 03:48:27 tswett: `fetch is outside the sandbox. 03:48:33 Mm. 03:49:59 `unidecode 03:50:00 No output. 03:50:02 `unidecode  03:50:04 ​[U+E326 DUNNO] 03:50:16 `rm unidecode 03:50:19 No output. 03:50:33 :( 03:50:39 `unidecode yarr 03:50:40 ​[U+0079 LATIN SMALL LETTER Y] [U+0061 LATIN SMALL LETTER A] [U+0072 LATIN SMALL LETTER R] [U+0072 LATIN SMALL LETTER R] 03:51:15 `run mv $(which unidecode) unidecode- && rm $(which unidecode) 03:51:19 rm: missing operand \ Try `rm --help' for more information. 03:51:34 tswett: wat 03:51:42 rip unidecode 03:51:46 Good question. 03:51:49 `unidecode yarr 03:51:50 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: unidecode: not found 03:51:55 `run echo $PATH 03:51:56 ​/hackenv/bin:/opt/python27/bin:/opt/ghc/bin:/usr/bin:/bin 03:51:58 `revert 03:52:02 Done. 03:52:08 `unidecode BAH 03:52:09 ​[U+0042 LATIN CAPITAL LETTER B] [U+0041 LATIN CAPITAL LETTER A] [U+0048 LATIN CAPITAL LETTER H] 03:52:12 Whither does `revert revert? 03:52:40 to the previous version hth 03:52:50 tht 03:53:03 `unidecode ꙮ 03:53:05 ​[U+A66E CYRILLIC LETTER MULTIOCULAR O] 03:54:12 `fetch http://sprunge.us/UNPA 03:54:14 2014-01-07 03:54:13 URL:http://sprunge.us/UNPA [9462] -> "UNPA" [1] 03:54:28 "#esꙮteric :Illegal channel name" :( 03:54:39 lꙮl 03:54:48 `unidecode ▒▒ 03:54:50 ​[U+2592 MEDIUM SHADE] [U+2592 MEDIUM SHADE] 03:54:54 `file UNPA 03:54:55 UNPA: ASCII C program text 03:54:58 `run gcc -s -O2 -o bin/utftovlq UNPA 03:54:59 UNPA: file not recognized: File format not recognized \ collect2: ld returned 1 exit status 03:55:18 `run gcc -s -O2 -o bin/utftovlq -x c UNPA 03:55:26 No output. 03:55:36 hmm, what does -s do again? 03:55:39 `df -h 03:55:40 df: cannot read table of mounted file systems: No such file or directory 03:55:42 `utftovlq for 03:55:44 No output. 03:55:51 HackEgo: quit trying to read /proc/mount hth 03:55:58 Bike: It doesn't work like that. Download it into your own computer for documentation 03:56:01 ah, strip 03:56:02 `run echo foo | utftovlq 03:56:04 No output. 03:57:13 The parameter needs to be one character input type, one character output type, for example "utftovlq 81" is converting plain 8-bit data into UTF-8. 03:57:29 (This plain data is considered as ISO-8859-1, for purpose of Unicode encoding) 03:57:32 how is it better than iconv 03:58:08 `utftovlq 81 UNPA 03:58:23 find / | xargs -n 2 mv 03:58:39 No output. 03:59:01 you know what's cool? error messages are cool 03:59:22 kmc: It can do various other things too, such as convert endianness of files, convert overlong encodings, and support up to 64-bit numbers 03:59:25 `run LC_ALL=de_DE.UTF-8 errno -l 03:59:26 bash: errno: command not found 03:59:56 `quote de_DE.UTF-8 03:59:58 925) shachaf: LC_ALL=de_DE.utf-8 errno -l Veraltete NFS-Dateizugriffsnummer Eingabe-/Ausgabefehler "Unterbrechung während des Betriebssystemaufrufs" i think that was in the Ring Cycle 04:00:15 `run LC_ALL=de_DE.UTF-8 rm all-cats-are-cats 04:00:16 rm: Entfernen von „all-cats-are-cats“ nicht möglich: Datei oder Verzeichnis nicht gefunden 04:01:13 `run echo /hackenv/bin/past* 04:01:14 ​/hackenv/bin/pastalog /hackenv/bin/pastaquote /hackenv/bin/paste /hackenv/bin/pastefortunes /hackenv/bin/pastekarma /hackenv/bin/pastelog /hackenv/bin/pastelogs /hackenv/bin/pastenquotes /hackenv/bin/pastequotes /hackenv/bin/pastewisdom /hackenv/bin/pastlog 04:01:18 Unterbrechung während des Betriebssystemaufrufs, Brünhilde 04:01:21 `run LC_ALL=so_ET.UTF-8 rm all-cats-are-cats 04:01:22 rm: cannot remove `all-cats-are-cats': No such file or directory 04:01:28 locale game weak 04:01:34 `run locale -a | paste 04:01:36 All the convert type are: 8=8-bit, w=16-bit LE, W=16-bit BE, d=32-bit LE, D=32-bit BE, q=64-bit LE, Q=64-bit BE, 1=UTF-8, 0=Modified UTF-8, V=VLQ, v=LEB-128, u=UTF-16 LE, U=UTF-16 BE, T=translation, M=Messagepack (input only), 4=Hex. There is also other options: L=linefeed, c=carriage-return, b=BOM in, B=BOM out, t=Make translation file small-endian. 04:01:40 http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/paste/paste.1702 04:01:54 For "translation", a translation table must be given as a second argument. 04:02:00 `run LC_ALL=ar_JO.utf8 rm all-cats-are-cats 04:02:02 rm: cannot remove `all-cats-are-cats': No such file or directory 04:02:09 `run LC_ALL=so_ET.utf8 rm all-cats-are-cats 04:02:10 rm: cannot remove `all-cats-are-cats': No such file or directory 04:02:14 i don't get it. 04:02:23 `run LC_ALL=zh_CN.utf8 rm all-cats-are-cats 04:02:25 rm: 无法删除"all-cats-are-cats": 没有那个文件或目录 04:02:33 Presumably rm doesn't know so_ET. 04:03:07 Ethiopian Somali? 04:03:32 `run LC_ALL=ja_JP.utf8 rm all-cats-are-cats 04:03:34 rm: cannot remove `all-cats-are-cats': そのようなファイルやディレクトリはありません 04:03:42 yes. 04:03:52 well, the other way around, i think. 04:05:01 "Sono yōna fairu ya direkutori wa arimasen" 04:11:18 -!- oklopol has quit (Ping timeout: 272 seconds). 04:17:18 tswett: "you na", not "youna". 04:18:17 `run LC_ALL=am_ET.utf8 rm foobar 04:18:18 rm: cannot remove `foobar': No such file or directory 04:18:36 I really wanted to see the Unicode mumbo-jumbo 04:21:52 pikhq: well, I was copying and pasting from Gūguru ga hon'yaku. 04:22:48 `unidecode ﯹﯹﯹﯹﯹﯹﯹﯹ 04:22:50 ​[U+FBF9 ARABIC LIGATURE UIGHUR KIRGHIZ YEH WITH HAMZA ABOVE WITH ALEF MAKSURA ISOLATED FORM] [U+FBF9 ARABIC LIGATURE UIGHUR KIRGHIZ YEH WITH HAMZA ABOVE WITH ALEF MAKSURA ISOLATED FORM] [U+FBF9 ARABIC LIGATURE UIGHUR KIRGHIZ YEH WITH HAMZA ABOVE WITH ALEF MAKSURA ISOLATED FORM] [U+FBF9 ARABIC LIGATURE UIGHUR KIRGHIZ YEH WITH HAMZA ABOVE WITH ALE 04:22:58 Ah, "Google Translates". 04:23:11 Yes, Google Translates. 04:24:06 The example of my program would be, for example converting UTF-8 to CESU-8 will be "utftovlq 1u | utftovlq w0" 04:25:52 Hum. GT translates "テゥランスレーテゥ" as "Thuringer Lance de Lethe". 04:27:54 -!- contrapumpkin has changed nick to copumpkin. 04:29:59 http://sicb.org/meetings/2014/schedule/abstractdetails.php?id=1217 cameron, j 04:30:09 ヘyグysカニョウレアdティs 04:30:20 アッパレンtlyティシsウァチョウゲtウェニョウジュsttyペエンgィシントティシメ 04:30:22 -!- ter2 has quit (Read error: Connection reset by peer). 04:30:39 -!- ter2 has joined. 04:30:43 イフォロネカンtレアヂタタll 04:30:46 -!- oerjan has quit (Quit: nite). 04:32:41 alle Katzen sind Katzen 04:32:45 kaikki kissat ovat kissoja 04:33:19 sicb? structure and interpretation of computer brogramming? 04:34:02 Todos los gatos son gatos. 04:34:10 kmc: i'd buy it 04:34:52 -!- mauke has quit (Disconnected by services). 04:35:02 -!- mauke has joined. 04:37:11 -!- preflex_ has joined. 04:37:26 -!- preflex has quit (Ping timeout: 264 seconds). 04:37:37 -!- preflex_ has changed nick to preflex. 04:37:37 Huh, Google Translate translates "ン" as "Emissions" and "ンン" as "Unless they already exist". 04:38:21 "so" and "so-so" also mean different things :p 04:38:48 nobody actually speaks japanese it's all an elaborate hoax 04:39:10 kmc: Sou desu ne. 04:39:44 tswett: Also, yes, I can read your psuedo-Japanese. :) 04:39:54 Bike: yeah, but those say "n" and "n'n". 04:40:41 -!- conehead has quit (Quit: Computer has gone to sleep.). 04:41:12 so...? 04:41:39 のぼぢあくつある類スペアクスじゃ派寝せ逸すあるルアンえらぼら手穂悪巣 04:41:53 Bike: I'm reasonably sure neither of those is actually a Japanese word. 04:42:05 oh well probably 04:43:27 If you tell Google Translate to translate from Latin to English, then "Lorem" becomes "Business", "Lorem lorem" becomes "Business on the Internet", "Lorem lorem lorem" becomes "Chinese Internet technology", "Lorem lorem lorem lorem" becomes "Chinese Internet phone technology", and "Lorem lorem lorem lorem lorem" becomes "China China China China China". 04:43:52 @google translation party 04:43:53 http://translationparty.com/ 04:43:53 Title: Translation Party 04:45:13 "nn" is close to a Japanese utterance at least. 04:45:18 "Lorem ipsum" becomes "Product". "Lorem ipsum lorem ipsum" becomes "China's". "Lorem ipsum lorem ipsum lorem ipsum" becomes "China's Internet". "Lorem ipsum lorem ipsum lorem ipsum lorem ipsum" becomes "Of course, system design, and system design, and system design," 04:45:24 Though you would write it "un" instead. 04:46:24 "Lorem ipsum sit dolor amet" becomes "There's a lot of pain" 04:46:49 And you can convert any UTF-8 variant (CESU-8, overlong, normal, etc) into proper UTF-8 by "utftovlq 1u | utftovlq u1" 04:51:29 -!- Sprocklem has quit (Ping timeout: 240 seconds). 04:56:42 http://lpaste.net/raw/98081 04:56:54 Deep stuff. 04:57:20 "You can fill out before the arrows to get pregnant." 04:57:48 "It's easy , you will feel to the home and the great gods into labor over the mountains, instantly. There is no element of fear of the notebook of life impact." 04:58:40 "Welcome to the court of the overall development of the plant." 04:58:47 I want there to be a court of the overall development of the plant. 05:01:08 "Each warm-up , wise life is loose , or is willing to ferry a lion" 05:08:23 -!- tswett has quit (Ping timeout: 272 seconds). 05:28:44 -!- FireFly has quit (Excess Flood). 05:28:45 -!- impomatic has quit (Write error: Broken pipe). 05:29:08 -!- esowiki has joined. 05:29:12 -!- esowiki has joined. 05:29:12 -!- esowiki has joined. 05:30:04 -!- esowiki has joined. 05:30:07 -!- glogbot has joined. 05:30:08 -!- esowiki has joined. 05:30:09 -!- esowiki has joined. 05:31:25 -!- FireFly has joined. 05:31:39 -!- sebbu2 has joined. 05:31:40 -!- sebbu2 has quit (Changing host). 05:31:40 -!- sebbu2 has joined. 05:32:52 -!- Fiora_ has joined. 05:33:59 -!- mroman_ has joined. 05:38:26 -!- nisstyre has quit (Quit: Leaving). 05:38:27 -!- quintopi1 has joined. 05:38:34 -!- FireFly has quit (*.net *.split). 05:38:45 -!- Freefull has quit (*.net *.split). 05:38:51 -!- heroux has quit (*.net *.split). 05:39:02 -!- hogeyui__ has quit (*.net *.split). 05:39:38 -!- heroux has joined. 05:40:02 -!- Freefull has joined. 05:40:58 -!- hogeyui__ has joined. 05:42:24 -!- FireFly has joined. 05:42:35 google used to translate "quid pro quo" as "What happens in Vegas" 05:43:36 -!- sebbu has quit (*.net *.split). 05:43:37 -!- mroman has quit (*.net *.split). 05:43:40 -!- ineiros has quit (*.net *.split). 05:43:50 -!- aloril has quit (*.net *.split). 05:43:51 -!- Taneb has quit (*.net *.split). 05:43:55 -!- Fiora has quit (*.net *.split). 05:43:57 -!- elliott has quit (*.net *.split). 05:43:57 -!- quintopia has quit (*.net *.split). 05:43:58 -!- ion has quit (*.net *.split). 05:44:07 -!- ineiros has joined. 05:44:16 -!- Taneb has joined. 05:46:47 -!- ion has joined. 05:46:50 -!- aloril has joined. 05:50:12 -!- hogeyui___ has joined. 05:50:54 -!- elliott has joined. 05:52:19 -!- hogeyui__ has quit (*.net *.split). 05:52:21 -!- monotone_ has quit (*.net *.split). 05:52:22 -!- Bike has quit (*.net *.split). 05:53:30 -!- Bike has joined. 05:55:14 -!- oklopol has joined. 05:57:44 -!- monotone_ has joined. 06:34:55 -!- ^v has quit (Quit: http://i.imgur.com/MHuW96t.gif). 06:40:30 Why does it translate everything like that? 06:41:13 why does what 06:42:09 I mean "What happens in Vegas" and that stuff 06:42:36 (I don't live at Vegas, so I wouldn't know) 06:43:31 Oh. It's a joke. "What happens in Vegas, stays in Vegas" is a common epxression. 06:46:20 google translate works by data mining the web, so it can get strange ideas about things 06:46:41 for example people use "lorem ipsum" as filler text on lots of different kinds of pages 06:47:07 O, so that's why it doesn't work. (A lot of other things also don't work on Google translation; there are better ones) 06:50:59 which are better? 06:51:12 I forget now, but I did see better ones before 06:51:24 well i'm convinced 06:51:33 I have also seen worse ones 06:51:38 is vdpau good 06:51:50 I don't know 06:51:59 darn 06:59:37 -!- tromp has quit (Remote host closed the connection). 07:00:12 -!- tromp has joined. 07:02:46 anyway, all this cra kind of makes me interested in gpu driver stuff... probably i can't do anything good for the projects though :/ 07:03:43 -!- Fiora_ has changed nick to Fiora. 07:04:42 -!- tromp has quit (Ping timeout: 265 seconds). 07:08:37 -!- Freefull has quit. 07:12:50 Medicine One is such an unimaginative name for a chemical that cures a fictitious poison (ATP decoupler) 07:13:12 where does that come from 07:13:34 the Creatures series 07:13:46 http://creatures.wikia.com/wiki/ATP_Decoupler 07:13:49 -!- quintopi1 has quit (Remote host closed the connection). 07:14:37 does creatures have proper neurotoins 07:14:41 toxins 07:15:32 There are some chemicals that can cause mental issues if they can be made to stay in the system long enough 07:15:35 -!- quintopia has joined. 07:16:05 But the only examples I can think of normally have a very quick half-life in a normal norn's bloodstream 07:16:48 Punishment and Reward 07:17:04 I made a norn that had Punishment constantly pumped into it 07:17:20 It would start doing random things, and eventually refuse to do anything at all 07:20:38 `echo 가 | utftovlq 1u 07:20:40 ​가 | utftovlq 1u 07:20:44 ...wel.. 07:20:46 `run echo 가 | utftovlq 1u 07:20:48 ​. \ . 07:20:58 cool 07:21:01 so... what happened? 07:21:14 zzo38: customer service! 07:21:21 actually I don't know how utftovlq works 07:21:27 Such command is converting UTF-8 (type "1") to UTF-16 LE (type "u") 07:21:29 i was about to investigate some strange thing sgeo said before i crashed my client 07:21:41 zzo38: aha, so U is UTF-16 BE and so on? 07:21:46 he told you that the fictitious poison is from Creatures. 07:21:47 lifthrasiir: Yes. 07:21:54 `utftovlq 07:21:55 No output. 07:21:58 hmm! 07:22:04 is there a source code for it? 07:22:14 lifthrasiir: Yes, there is a source code for it. 07:22:27 http://sprunge.us/UNPA 07:22:28 `cat UNPA 07:22:29 ​/* \ UTF-to-VLQ \ Public domain \ */ \ \ #include \ #include \ \ #ifdef _WIN32 \ #include \ #endif \ \ typedef unsigned char byte; \ typedef unsigned long long ULL; \ \ typedef ULL(*in_func_t)(void); \ typedef void(*out_func_t)(ULL); \ \ char in_mode; \ char out_mode; \ int options[128]; \ ULL translation[ 07:22:30 hth 07:23:35 `run cat UNPA | egrep '.'\]=write_ 07:23:36 ​ ['8']=write_8bit_raw, \ ['w']=write_16bit_le_raw, \ ['W']=write_16bit_be_raw, \ ['d']=write_32bit_le_raw, \ ['D']=write_32bit_be_raw, \ ['q']=write_64bit_le_raw, \ ['Q']=write_64bit_be_raw, \ ['1']=write_utf8, \ ['0']=write_utf8, \ ['V']=write_vlq8, \ ['v']=write_leb128, \ ['u']=write_utf16_le, \ ['U']=write_utf16_be, \ 07:23:54 Well, that's most of them, anyways. 07:24:18 zzo38: what's a difference between 1 and 0? 07:24:18 There is also 'T' for translate (needs a file containing a translation table), and '4' for hex. 07:24:33 There is a typo in the normal norn genome 07:24:38 lol 07:24:46 Pain gets converted into hunger for protein backup instead of pain backup 07:25:03 lifthrasiir: The '0' is only different for output; it makes no difference for input. For output, '0' causes a code number zero to be overlong encoded (which some programs require). 07:25:35 (The "write_utf8" function checks if it is invoked with type '0' or '1' in this case) 07:27:01 There are also a few other options dealing with line breaks and byte order marks. 07:32:08 Hopefully this explains it enough? Using pipes, you can do many more things than just what is specified here, though. 07:34:17 Unlike iconv, utftovlq is capable of working on binary files too; it doesn't have to work on text files. Also, it supports VLQ, overlong UTF-8, codepoints up to 64-bits (or 36-bits for UTF-8), etc, but it doesn't have translation tables for various character sets built-in; you need to use external files. Also, utftovlq does not support UTF-7 and that stuff either. 07:35:04 So they are really two different programs for different purposes, although some of the purposes are shared between them. 07:35:36 zzo38: actually, I'm quite confused why 0 and 1 makes differences while the source code seems to be same for both. 07:35:40 otherwise I got it 07:36:23 lifthrasiir: Like I said, the "write_utf8" function checks this; instead of duplicating the function except for the difference, it just has a condition to check this specific case. 07:36:38 aha! 07:37:14 (Both types are the same for input, though.) 07:37:16 you'd rather have a simple usage when the program is called without any args... ;) 07:37:34 I could do that, but I didn't put any in (yet). 07:37:53 The program is public domain anyone can make whatever variation of the program you want to. 07:38:02 yeah, and it seems to ignore any UTF-8 errors (including overlong sequences) naturally. 07:38:17 lifthrasiir: Yes, that is on purpose. 07:38:57 I like how `conv_cr` etc is handled :) 07:39:07 OK 08:11:52 Is anyone able to help to make 8x8 graphics for some computer game? 08:12:13 There is 32 kind of pieces, 16 for tiles and 16 for sprites. 08:13:28 -!- Yonkie has joined. 08:13:48 how much are you paying :D 08:14:10 Zero (too bad!) 08:21:27 But, the software is public domain so other people are allowed to sell it too. 08:22:27 (But, if you want to do that, it is recommended that you will make the box art too. It is not a requirement, however.) 08:31:27 -!- impomatic has joined. 08:36:20 zzo38: Have you already searched for public domain game graphics? 08:36:45 mroman_: They aren't suitable. 08:40:15 What kind of graphics are you looking for then? 08:41:19 They are specialized for a specific kind of computer game, for one thing; also, the tiles are mono, and sprites are three colors + transparency (the same three for each one, or up to two different palettes for sprites) 08:43:44 oh. ok 08:44:33 I was seriously considering a minimalistic VM suited for 2D (or limited 3D) game programming 08:44:59 lifthrasiir: Yes, and I was considering a way to make the program fit in a QR code, too. 08:45:01 to use or to make? 08:45:11 (But none of this has to do with the game I am making now) 08:45:22 zzo38: which is for me a non-issue though :) 08:45:32 rather, I seek for simple and relatively performant implementations 08:45:39 without sacrificing features 09:06:32 -!- LinearInterpol has joined. 09:20:14 -!- Sorella has joined. 09:31:46 mauke: I forgot to mention yesterday that the rules for conversion to null pointer are also different in every edition of the standards. just saying. 09:33:11 unsigned overflow in C is defined behaviour, right? 09:33:26 i.e (uint8_t)(255+1) == (uint8_t)0? 09:33:56 mroman_: yes 09:34:10 I vagely remember an assume wraparound option, but afaik that applies only to signed overflows 09:40:53 -!- LinearInterpol has quit (Ping timeout: 272 seconds). 09:57:59 I had a dream where I was watching a Pirates of the Caribbean movie and it opened with Legolas telling the fourth wall how he killed Gilderoy Lockhart to become the new Dread Pirate Roberts 10:01:21 actual Legolas, or the guy who plays Legolas? 10:01:22 Actually Legolas 10:01:30 I think my brain was aiming for Will Turner and missed 10:01:31 what's Will Turner? 10:01:52 mroman_: unsigned integral types in C and C++ always wrap around as if they used modulo a two power, yes 10:02:11 olsner, the guy Orlando Bloom played in PotC 10:02:34 mroman_: you can still get an undefined behaviour from them if you shift by too large shift count, or if you divide by zero 10:02:39 but never from addition 10:02:39 right, and he's the one who plays legolas 10:02:51 Yes 11:01:12 I think in LLVM you can specify whether or not you get undefined behaviour for some arithmetic operations 11:15:46 -!- zzo38 has quit (Remote host closed the connection). 11:17:44 -!- atrapado has quit (Quit: Bye). 11:51:59 -!- LinearInterpol has joined. 12:06:49 -!- ggherdov has quit (Changing host). 12:06:49 -!- ggherdov has joined. 12:06:49 -!- ggherdov has quit (Changing host). 12:06:49 -!- ggherdov has joined. 12:31:48 -!- LinearInterpol has quit (Ping timeout: 276 seconds). 12:59:57 -!- boily has joined. 13:00:04 -!- metasepia has joined. 13:05:18 -!- LinearInterpol has joined. 13:11:39 -!- yorick has joined. 13:19:25 -!- Sgeo has quit (Read error: Connection reset by peer). 13:26:39 -!- ion has quit (Excess Flood). 13:27:23 -!- ion has joined. 13:31:09 -!- ais523 has joined. 13:32:31 good CYUL morning! 13:32:45 @messages-lóód 13:32:45 Unknown command, try @list 13:32:47 @messages-lóud 13:32:47 oerjan said 2d 13h 25m 53s ago: norway is warmer this time of the year. <-- incidentally i saw in the newspaper that the night before yesterday was the fourth hottest january night ever measured (by minimum temperature) in trondheim. (it was 5.1 celsius.) 13:32:47 oerjan said 2d 13h 24m 25s ago: http://www.adressa.no/vaeret/article8897643.ece 13:34:02 @tell oerjan the next logical step is to learn Norwegian. 13:34:02 Consider it noted. 14:21:54 -!- atrapado has joined. 14:28:09 -!- monotone_ has changed nick to polytone. 14:32:16 `relcome atrapado 14:32:16 ​atrapado: 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.) 14:35:52 thanks boily and HackEgo :) 14:37:06 -!- LinearInterpol has quit (Ping timeout: 265 seconds). 14:37:33 -!- `^_^v has joined. 14:38:44 -!- oerjan has joined. 14:40:48 god mørjangen. 14:42:18 goily ettermiddag 14:43:16 @messages-foul 14:43:17 boily said 1h 9m 14s ago: the next logical step is to learn Norwegian. 14:43:39 jepp! 14:47:18 -!- mrhmouse has joined. 14:50:18 "Lorem ipsum" becomes "Product". <-- heh when i think about it it makes complete sense that google translate would go haywire on variations of this phrase. 14:51:08 because it is often used as a temporary replacement for text that hasn't yet been written. so if google finds both the before and after versions... 14:51:29 it would think one is a translation of the other. 14:51:36 google translate autodetects "lorem ipsum" as latin, then translates it into fr:Chine. 14:52:26 boily: btw case matters in these things. 14:54:07 Lorem ipsum dolor sit amet consectetuer adipiscing elit sed diam -> This page is designed to explore a computer program to implement the 14:54:37 i had to remove the commas in it, otherwise it started breaking it up. 14:55:09 lorem ipsum is apparently an actual passage of Latin altered to have a frequency distribution of letters/word lengths matching English 14:55:30 la:Lorem → en:Business, la:lorem → en:Internet, la:Ipsum → en:the, la:ipsum → en:it, la:lorem ipsum → en:China, la:lorem Ipsum → en:Product, la:Lorem ipsum → en:Product, la:Lorem Ipsum → en:NATO. 14:55:32 and thus the result makes no sense 14:55:47 ais523: no, i doubt that's what's happening. 14:56:15 ais523: as i understand it, google translate works by finding pages that it thinks are translations of each other, no? 14:56:16 `run echo 'Business Internet the it China Product Product NATO' >wisdom/'lorem ipsum' 14:56:16 oerjan: I didn't mean to suggest it was 14:56:18 just bringing up trivia 14:56:24 No output. 14:56:34 it's clear why Google Translate is so confued 14:57:59 boily: i think the translations of [Ii]psum alone are fairly correct. it's a pronoun after all. 14:58:19 not exact, but something that can often make sense in context. 15:00:41 Latine loqui coactus sum, non. 15:01:27 * oerjan boilym coactat 15:02:45 apparently, "coactat" is “confined”. 15:03:02 * boily mapoles his way out of oerjan's confinement 15:03:22 boily: i don't think gt finds the right verb 15:03:48 http://en.wiktionary.org/wiki/coacto is what i was going for 15:03:56 (only guessing it existed.) 15:04:35 “to hide”??? 15:04:56 where do you find that? 15:05:21 from your coacto wiktionary page → descendants → french «cacher». 15:05:23 oh the french descendant 15:05:57 this may be a shock to you, but words change meanings. 15:06:50 hm so the computer term "cache" also derives from this. 15:12:44 also, there aren't any official quotation rules for Latin. 15:14:49 just use the quotative case 15:15:55 oerjan: you made that up, right? 15:16:21 you got me. 15:16:34 https://en.wikipedia.org/wiki/Quotative 15:17:54 once again, reality trumps fiction. 15:17:56 -!- LinearInterpol has joined. 15:18:43 -!- nooodl has joined. 15:20:34 “Do not meddle in the affairs of linguists, for you are instrumental and taste good with oblique mustard.” 15:21:28 i'm pretty sure instrumental is a case, though. 15:22:20 instrumental is quite common → https://en.wikipedia.org/wiki/Instrumental_case 15:23:08 (strangely, wikipedia doesn't mention Japanese's 「で」) 15:23:47 で's more general than the instrumental case 15:24:54 looks like it doesn't list e.g. latin's ablative either, so i guess it's that 15:26:21 at least, the article refers to the comitative. 15:33:19 I had a dream where I was watching a Pirates of the Caribbean movie and it opened with Legolas telling the fourth wall how he killed Gilderoy Lockhart to become the new Dread Pirate Roberts <-- with his sled, i assume. 15:34:22 speaking of the Fourth Wall, I made a grave mistake yesterday night. I began reading OOTS. 15:34:31 ooh 15:34:57 -!- conehead has joined. 15:39:07 boily: I used to pay actual money at cybercafés to read OOTS 15:39:19 before I had friends with Internet connections I could borrow 15:39:52 Well, this is the first time I've cried at the end of a main-series pokemon game 15:40:01 Taneb: X/Y, I take it? 15:40:30 Yup 15:40:36 do you need a membership card to borrow friends? 15:41:06 http://deeperdesign.wordpress.com/2010/02/26/is-iron-man-made-of-lego/ 15:41:14 bon matintopia! 15:41:18 ais523, I specify main-series because I probably cried at Mystery Dungeon Red 15:41:19 sup boily 15:41:38 Or at least I would if I reached it for the first time as I am now 15:41:39 -!- LinearInterpol has quit (Ping timeout: 264 seconds). 15:41:55 (I could also guess the gen 4 Pokémon Mystery Dungeon games, but those probably don't count as main series) 15:41:59 PMD is better with its stories, really 15:42:46 hurray the temp is back up to 12F 15:42:50 quintopia: back in Montréal. 15:42:50 ~metar CYUL 15:42:51 CYUL 071535Z 24015G26KT 4SM -SHSN BKN026 BKN035 M14/M18 A2978 RMK SC6SC1 SLP088 15:43:01 also I have 73-second ping for some reason 15:43:13 ~metar KATL 15:43:13 KATL 071452Z 33014KT 10SM FEW250 M12/M21 A3050 RMK AO2 SLP348 T11171206 51021 15:43:14 boily: this time i win 15:43:48 quintopia: bleh :p 15:44:12 also, what's the proper translation for fr:verglas? 15:44:26 boily, describe verglas? 15:46:30 Taneb: when temperature goes over 0 °C, it rains or snow melts, then gets back under zero and you get ice everywhere. 15:46:36 we call it black ice here 15:47:09 when it is on roads 15:47:16 same thing here. «glace noire» is the sneaky ice you get on roads and you can't see until your car's spinning every possible way. 15:47:32 ah 15:47:40 #define __rol__(x) (x << 1u) | (x >> ((sizeof(x) * CHAR_BIT) - 1)) 15:47:46 ^- that's probably as good as it can get? 15:47:47 i'm not sure there is a perfect translation 15:48:02 what is the french for frost or hoarfrost? 15:48:20 frost is «givre». let me check on hoarfrost... 15:48:21 -!- Sprocklem has joined. 15:49:47 hoar frost is «gelée blanche». 15:50:10 -!- Phantom_Hoover has joined. 15:50:30 shnifty 15:51:19 sournouillard. 15:58:39 -!- ter2 has quit (Read error: Connection reset by peer). 16:05:28 #define NULL (sizeof "\??/" / sizeof "?/\?") 16:07:17 ahww shoot. 16:07:34 Yeah. 16:07:38 Didn't account for that. 16:08:17 mroman_: what the trigraphing-fungot are you #defining? 16:08:19 I can't do an absolute jump to a 16bit address with an 8bit register and a Code Segment Register 16:08:31 because I can't update the Code Segment Register 16:08:40 and I obviously can't update *before* I take the jump 16:08:47 boily: A generic rotate left. 16:09:12 hm unless 16:09:34 damn. 16:10:38 couldn't you, I don't know, like, maybe, #define NULL (0)? 16:11:26 oh whait 16:11:31 boily: You meant mauke 16:12:12 once again foiled by the tab. yes, I meant mauke. 16:12:17 -!- LinearInterpol has joined. 16:12:22 * boily mapoles mauke “you vile #definer!” 16:13:57 man 16:14:03 having only two registers sucks . 16:16:30 fizzie: FUNGOT! 16:17:01 brave sir fungot ran away 16:22:43 NULL is 0, but not really. 16:24:55 -!- fungot has joined. 16:26:50 fungot: is NULL 0 or not 0? 16:26:50 boily: that's some complicated glass code? :p. ugh i need to install slime. 16:26:52 mroman_: so, what is it, then? 16:28:18 It's an "implementation-defined null pointer constant" hth 16:28:43 ... NULL is null. tdnh. 16:29:09 #define (funny_type *) 0 16:29:17 Does it help if I add that a null pointer constant is an integer constant expression with the value 0, or such an expression cast to type void *. 16:29:17 arg. #define NULL etc. 16:29:37 fizzie: yes. 16:30:40 so NULL is zero. 16:31:04 Or a zero cast to a void *. 16:31:14 If it's the latter, "int i = NULL" is not guaranteed to give you a zero in i. 16:31:43 oh. I think I now understand the nuance. 16:32:03 -!- FreeFull has joined. 16:32:05 And if it's the former, then printf("%p", NULL); might be undefined. 16:32:06 but then, you still can #define NULL (0) and get a non-zero (void *), can you? 16:32:40 #define NULL '\0' 16:32:44 If you mean a "not-all-bits-zero (void *)", sure. 16:33:00 It will compare equal to zero if it's a null pointer, of course. 16:33:18 I retract my understanding. 16:39:09 -!- oerjan has quit (Quit: null understanding, constantly). 16:40:38 printf("%p", NULL) should be undefined, yes 16:40:48 Depending on the implementation, it's not required to be undefined, though. 16:41:10 Yeah. 16:41:14 But afaik 0 is a "pointer" literal only at compile time 16:41:26 it's actual value at runtime is something else 16:42:43 0 isn't an actual value; it's source code 16:49:27 fizzie: isn't that the idea of "undefined"? 16:49:57 mrhmouse: There's quite a difference between implementation-defined and undefined. 16:50:39 In printf("%p", NULL), depending on the implementation-defined choice of how to define NULL, the behaviour is either defined or undefined. 16:51:10 it isn't undefined by specification? 16:51:48 printf("%p",0) is undefined; printf("%p",(void *)0) is defined. 16:52:36 is NULL in the C specification, or is it just something that some implementations choose to add? 16:52:37 And the choice of NULL is implementation-defined, which means the implementation must document its choice. 16:52:53 It's in the specification. 16:52:53 -!- FreeFull has quit (Ping timeout: 252 seconds). 16:52:54 NULL is in the C standard. 16:53:22 "Common definitions -- The macros are NULL which expands to an implementation-defined null pointer constant; and --" 16:53:40 ah, but it isn't defined in the specification. excuse my ignorance, it's early yet :) 16:54:38 When you get down to the details, C is not a very sane programming language. 16:55:07 "implementation-defined behavior: unspecified behavior where each implementation documents how the choice is made" "unspecified behavior: -- behavior where this International Standard provides two or more possibilities and imposes no further requirements on which is chosen in any instance" "undefined behavior: behavior -- for which this International Standard imposes no requirements" 16:55:57 fizzie: thank you :) that's a bit clearer 16:56:19 printf("%p",0) *is* allowed to obtain your GPS coordinates and send a missile your way. 16:56:23 Rust is though. 16:56:34 LinearInterpol: sane, or allowed to send missiles? 16:56:39 sane. 16:56:55 been looking into it lately. for a systems programming language, it boasts some crazy shit. 16:57:17 I only briefly looked at Rust before being distracted by D 16:57:37 DMD uses an outdated object format, that's enough to make me not use it. 16:57:45 Outdated how? 16:57:59 (I don't use D, I just tried it out for a bit) 16:58:01 it uses OMF. 16:58:08 run the other way. 16:58:19 as fast. as you can. 16:58:34 because it's terrible. 16:58:40 And LDC, the LLVM compiler? 16:58:41 OMF is short for OMFG 16:58:46 LOL. 16:58:54 mrhmouse: I haven't used that. 16:59:03 it's probably just become available. 16:59:08 I used D in like 2011. 16:59:56 Oh, so you probably used D1? 17:00:19 ...No. 17:00:30 I used D2. 17:00:57 Ah. Hrm. I don't know enough about OMF to know what is so bad about it :P 17:01:03 -!- Sprocklem has quit (Ping timeout: 272 seconds). 17:01:26 Nor do I care strongly about D.. But I am interested now, since it's apparently terrible :P 17:02:07 OMF is microsoft's Object Module Format. 17:02:13 it's outdated as fuuuuuuuuuuck. 17:02:52 LinearInterpol: You'd be surprised by how many people still fuck to this very day. 17:03:08 I know, right. 17:03:20 rust, however, looks.. and feels interesting. 17:03:27 optional garbage collection? safe borrowed pointers? 17:03:41 a bitchin' haskell-like type system? 17:03:47 I'm too lazy for optional garbage collection. 17:03:55 hurrr. 17:04:03 it's as simple as adding a sigil in front of a value. 17:04:03 But Rust's pointer are glorious. 17:04:13 s/er/ers 17:04:31 lol. 17:05:37 their structure of ownership for objects is orgasmic. 17:05:38 The macros also interest me. That's about as much as I remember about Rusy 17:05:50 s/sy/st 17:05:52 macros in my eyes look like lisp macros. 17:06:03 a much, much better alternative than C's preprocessor macros. 17:06:08 Agreed. I prefer Scheme macros to Lisp macros, though. 17:06:17 agreed. 17:06:17 (Assuming you mean CL) 17:06:23 Scheme is just cleaner in general. 17:06:29 CL is full of legacy industrial shit. 17:06:41 I never got around to actually using all of it. 17:06:45 My thoughts exactly, That's what got me using Scheme in the first place. 17:06:55 racket's gotta be my favorite dialect. 17:07:12 I'm using Chicken at the moment, simply because it's the one I learned with. 17:07:41 LinearInterpol: http://docs.racket-lang.org/unstable/2d.html 17:08:11 Isn't it awesome?! 17:09:14 It is. It really is. 17:15:21 -!- conehead has quit (Quit: Textual IRC Client: www.textualapp.com). 17:21:05 -!- conehead has joined. 17:22:26 I am trying to learn Rust 17:22:30 I am not very good at it 17:23:08 -!- LinearInterpol has quit (Ping timeout: 252 seconds). 17:23:15 -!- MindlessDrone has joined. 17:33:41 -!- contrapumpkin has joined. 17:34:07 -!- nooodl_ has joined. 17:34:33 -!- copumpkin has quit (Ping timeout: 246 seconds). 17:37:07 -!- nooodl has quit (Ping timeout: 240 seconds). 17:44:49 -!- qlkzy_ has joined. 17:47:57 -!- CADD_ has joined. 17:52:07 -!- qlkzy has quit (Ping timeout: 240 seconds). 17:52:18 -!- metasepia has quit (Ping timeout: 240 seconds). 17:52:25 -!- myndzi has quit (Ping timeout: 240 seconds). 17:52:36 -!- CADD has quit (Ping timeout: 240 seconds). 17:53:12 -!- CADD_ has changed nick to CADD. 17:53:16 -!- myndzi has joined. 17:54:10 -!- ais523 has quit (Remote host closed the connection). 17:55:01 -!- LinearInterpol has joined. 17:55:05 -!- LinearInterpol has quit (Read error: Connection reset by peer). 17:55:07 -!- LinearInterpol has joined. 17:55:11 -!- ais523 has joined. 17:55:23 -!- ais523 has quit (Changing host). 17:55:23 -!- ais523 has joined. 17:58:55 -!- LinearInterpol has changed nick to {}. 17:59:01 -!- {} has changed nick to LinearInterpol. 18:01:20 -!- AnotherTest has joined. 18:06:26 -!- callforjudgement has joined. 18:09:18 -!- ais523 has quit (Disconnected by services). 18:09:20 -!- callforjudgement has changed nick to ais523. 18:10:01 -!- myndzi has quit (Ping timeout: 240 seconds). 18:11:05 -!- esowiki has joined. 18:11:09 -!- esowiki has joined. 18:11:10 -!- esowiki has joined. 18:11:38 -!- esowiki has joined. 18:11:42 -!- esowiki has joined. 18:11:43 -!- esowiki has joined. 18:12:11 -!- esowiki has joined. 18:12:15 -!- esowiki has joined. 18:12:16 -!- esowiki has joined. 18:13:05 -!- esowiki has joined. 18:13:06 -!- glogbot has joined. 18:13:09 -!- esowiki has joined. 18:13:10 -!- esowiki has joined. 18:47:57 LinearInterpol: the @-boxes in Rust aren't actually garbage collected, yet 18:48:01 they are just reference-counted 18:48:15 kmc: oh? 18:48:37 in the future it's likely that Gc, Rc, and Arc will coexist in the language (the latter is "atomic reference counting" that can be shared between threads) 18:48:42 and there are mutable versions of each, too 18:48:54 -!- metasepia has joined. 18:49:03 any box with automatic memory management is an ownership root and so determines the mutability of its contents 18:49:17 yep. 18:49:52 the new dynamically sized types are a great concept. 18:50:08 they would come in handy for some things I'm doing, for sure 18:50:29 like making a generic linked list which can hold trait objects without an additional indirection 18:51:18 it sounds like owned vectors and slices won't be subsumed by DSTs though... that is ~[T] and &[T] will still be special even if [T] is now a valid type 18:51:27 i haven't been following the details that closely 18:52:28 -!- Sprocklem has joined. 18:53:20 -!- conehead has quit (Ping timeout: 252 seconds). 18:57:10 Do we have any Lispbots in the channel? 18:57:22 fizzie: what other systems have undefined behavior, besides C? 18:57:27 what's a lisbot 18:57:36 C++, LLVM, electronic components 18:57:50 Bike: a bot that exthecutes Lipth code 18:58:24 the worst joke 18:58:30 mostly CPU architectures don't, modulo errata 18:58:47 Bike: I do try 18:58:54 there are those undocumented instructions on the NMOS 6502 18:59:07 that's not defined to be undefined, though :p 18:59:16 Bike: a lisbot is also the main protagonist of a Scandinavian book series. hth. 18:59:20 maybe it is now!! 18:59:31 also i'm going to try playing portal on my linux computer 18:59:35 this gonna be good 18:59:36 boily: I finally learned what hth stands for. 18:59:48 I suppose POSIX has undefined behavior 19:00:24 man I need to publish that blog post before somebody scoops my trick of using read() into .text to do self modifying code 19:00:41 because really, who doesn't want to do that. 19:01:18 -!- metasepia has quit (Ping timeout: 240 seconds). 19:01:20 -!- myndzi has quit (Ping timeout: 240 seconds). 19:01:34 i noticed that the LED lights in my living room will glitch when somebody's using the electric stove lighter in the kitchen 19:03:35 not fair. "An ActionScript error has occurred: TypeError: Error #1009: Cannot access a property or method of a null object reference. at BotaniculaLinux/invokeHandler()" 19:03:50 goddamn types 19:04:31 is that a null pointer error? i think it is 19:05:25 It is 19:06:12 kmc: what is an electric stove lighter? 19:06:17 -!- myndzi has joined. 19:06:31 er, yeah, I guess that's a bit ambiguous 19:07:06 the stove is gas-powered but there's a circuit which makes a spark near each burner to light them 19:07:12 " Female presenters at scientific mtgs increase 72%, when even one convener is a woman" wow 19:07:23 convener? 19:08:19 oh it's a typo for convener, lol. 19:08:37 looks like the same word to me, but anyway ,what does it meen? 19:08:41 mean* god 19:09:01 person convening the meeting 19:09:32 oh, i thought it says 'covener' but it doens't. go me 19:10:14 (http://mbio.asm.org/content/5/1/e00846-13.full) 19:11:26 http://www.dailydot.com/politics/mpaa-joins-world-wide-web-consortium-w3c/ 19:12:29 aw. 19:16:19 -!- ais523 has quit. 19:18:56 -!- conehead has joined. 19:22:35 ... interesting. it starts up on my netbook. 19:22:37 -!- ais523 has joined. 19:24:59 it also starts inside vnc, wtf. 19:49:52 wow, that was weird 19:50:22 before I rebooted, shortcut keys were working, but I couldn't enter text 19:50:53 like, the part of the system that translated keypresses to Unicode was broken, but the keyboard driver itself was fine 19:52:24 you seem to have a special ability with keyboard problems 19:52:51 yeah 19:53:01 that was system-wide, though 19:53:09 oh, gksudo and Unity could still understand me typing 19:53:13 presumably because they capture the keyboard 19:57:58 I wonder who of ais523 or zzo38 has the weirdest setup... 19:58:22 definitely zzo38 19:59:29 I thought so. 20:00:49 OpenERP lesson of the day: it's not because something is called sequence that it is a sequence, or it is called sequence. it is priority, when not being a sequence called sequence. 20:04:40 boily: what are you using OpenERP for 20:06:48 kmc: current job. 20:07:29 erp erp erp 20:10:18 * boily records kmc's call on a cassette recorder 20:10:54 :O 20:12:54 com'ere birdie birdie poot poot! ?! 20:13:28 wat http://youtu.be/aeaPanpU-iw 20:28:45 Yay, botanicula works properly now. I had managed to disable the RANDR X11 extension. 20:29:50 (Which is odd; the extensions that I tried to disable was XINERAMA. Oh well, the mysteries of bad software.) 20:30:44 it's probably AMD's fault somehow :) 20:40:44 RANDR exports the multi-screen geometry via the Xinerama protocol, so it's not like those are completely separate things. 20:49:56 -!- Sprocklem has quit (Ping timeout: 252 seconds). 21:02:51 -!- augur has quit (Remote host closed the connection). 21:04:22 -!- MindlessDrone has quit (Quit: MindlessDrone). 21:08:38 -!- AnotherTest has quit (Ping timeout: 252 seconds). 21:12:14 -!- Sprocklem has joined. 21:20:16 fizzie: it's still AMD's fault. 21:20:32 -!- metasepia has joined. 21:23:41 ~metar CYUL 21:23:41 CYUL 072100Z 23024G38KT 15SM SCT080 SCT130 BKN240 M14/M23 A2982 RMK AC3AC1CI3 SLP103 21:23:47 bleh. still windy. 21:30:19 -!- metasepia has quit (Remote host closed the connection). 21:30:19 -!- boily has quit (Quit: DOUBLE CHICKEN). 21:31:03 -!- atrapado has quit (Quit: Leaving). 21:36:06 -!- atrapado has joined. 21:36:56 -!- FreeFull has joined. 21:39:37 The weather people are saying that winter will come here on Friday. 21:43:29 -!- augur has joined. 21:52:02 ~metar KBGR 21:52:15 aww 21:55:18 -!- oerjan has joined. 22:00:16 -!- ais523 has quit. 22:07:51 http://kingjamesprogramming.tumblr.com/post/71646704753 22:16:09 :D 22:19:04 this one is still my favorite: http://kingjamesprogramming.tumblr.com/post/71300641964/the-truth-of-the-matter-is-that-in-a-language 22:21:38 "And the God of the Hebrews, How long wilt thou refuse to go forth, this is the normal state of affairs in conventional compiler-based language systems such as C." 22:21:46 Oh why hast thou forsaken me god! 22:21:51 -!- Sprocklem has quit (Remote host closed the connection). 22:22:22 somebody should do this for KJV and ISO 9899 22:22:47 The Quran and Gravitation by Misner Wheeler and Thorpe 22:22:54 haha 22:22:56 The Book of the Dead and the Origin of Species 22:23:24 * oerjan recalls Gravitation as that book with the suspiciously self-describing name 22:23:26 whenever I saw that (impressively thick) _Gravitation_ book in the campus bookstore I would pick it up and drop it a few feet 22:23:32 a-yep 22:23:41 Gravitation is pretty thick 22:23:48 Though not the thickest science book around 22:23:50 fucking gravity, how does it work? 22:23:54 turns out nobody's quite sure 22:23:56 It's no Handbook of Physics and Chemistry 22:24:06 -!- nisstyre has joined. 22:24:07 the quran, on the other hand, is not so big iirc 22:24:25 http://en.wikipedia.org/wiki/Gravitation_(manga) I guess it is impressively thick? 22:24:30 maybe do the talmud instead. 22:25:07 Fiora: wrong reference hth 22:25:16 "impressively thick" brings something else to mind when we're talking about yaoi 22:25:29 Yaoi has impressively big hands 22:25:43 eh think yaoi is a pretty cool guy 22:25:52 http://bigyaoihandsyndrome.tumblr.com/ 22:25:59 not clicking that at work 22:26:07 Eh 22:26:12 There isn't much naughtiness 22:26:18 Though there are barechested dudes 22:26:21 And much gayness 22:26:25 With huge hands 22:27:31 "And Jacob called the name of the variable, preceded by a question mark." 22:27:33 heheheh 22:28:20 Slereah, I know the chap who runs King James Programming 22:28:33 Is it Moses 22:29:05 Taneb: say hi for me, also tell him to do King James ISO 9899 22:29:30 * kmc wonders if "chap" and "bloke" would ever be gender-neutral the way that en_US "guy" sometimes is 22:29:57 I'm starting to use "chap" more and more gender neutral 22:30:03 i believe ladies are "hags" in good ol' britain 22:30:13 Wot wot 22:30:15 Slereah, he says he doesn't have evidence that he isn't Moses 22:30:17 Pardon me guvnahs 22:30:28 who wants a banger in the mouth 22:30:40 ARE YOU THREATENING ME 22:30:54 Slereah, either that, or asking if you'd like a sausage 22:31:19 Take that as you will 22:32:22 Gravitation is a great book 22:32:27 but it is a terrible textbook 22:32:34 It's even worst than a Feynman book 22:32:44 *worse hth 22:32:50 i'm just quoting a TV show 22:33:11 It's the kind of textbook with no fucking structure 22:33:18 much like spacetime 22:33:34 Spacetime has so much fucking structure man 22:33:37 It is the structuriest 22:40:45 kmc: whoaaaaa 22:40:51 > 5 *  2 22:40:52 10 22:41:26 * oerjan wraps up kmc in a ricci tensor 22:42:03 wat 22:42:08 > 5 * -2 22:42:09 Precedence parsing error 22:42:09 cannot mix `GHC.Num.*' [infixl 7] and prefix `-' [infixl 6] in the same ... 22:42:12 thought so 22:42:23 `unidecode > 5 *  2 22:42:27 ​[U+003E GREATER-THAN SIGN] [U+0020 SPACE] [U+0035 DIGIT FIVE] [U+0020 SPACE] [U+002A ASTERISK] [U+0020 SPACE] [U+1680 OGHAM SPACE MARK] [U+0032 DIGIT TWO] 22:42:31 > generalCategory ' ' 22:42:32 Space 22:42:34 this is the best Space 22:42:47 > text (filter isSpace ['\0'..]) 22:42:48   ᠎               22:42:51 ouch. 22:43:10 `unidecode ⁢ 22:43:12 ​[U+2062 INVISIBLE TIMES] 22:43:29 but where's INVISIBLE THAMES 22:43:31 > let f x = x^2; x = 3 in f x 22:43:32 9 22:43:52 VISIBLE SPACE 22:46:41 `unicode MULTIOCULAR O 22:46:42 Unknown character. 22:47:02 `unicode CYRILLIC LETTER MULTIOCULAR O 22:47:04 ​ꙮ 22:47:39 /whois mauke 22:47:50 You monster 22:48:01 some scoundrel 22:48:11 `unidecode / 22:48:13 ​[U+002F SOLIDUS] 22:48:38 `unidecode \ 22:48:40 ​[U+005C REVERSE SOLIDUS] 22:48:55 `quote ꙮ 22:48:57 1143) A Swede who was in #esoteric / Thought his rhymes were a little generic. / "I might use, in my prose, / ꙮs, / But my poetry's alphanumeric." 22:49:31 obligatory complaint that ꙮ is Letter, Other 22:49:39 but still that's an awesome poem :) 22:49:47 reminds me of my unicode poetry days 22:49:53 yeah I was looking that up the other day 22:49:59 `quote HIRAGANA 22:50:01 No output. 22:50:03 wanted to see if `unidecode had all the characters but it hasn't :( 22:50:09 "you can't spell sweden without wede" 22:50:20 @wn wede 22:50:22 No match for "wede". 22:50:34 `unicode MAHJONG TILE AUTUMN 22:50:36 ​🀨 22:50:40 `unicode HIRAGANA LETTER YA 22:50:41 ​や 22:50:45 `unicode SNOWMAN WITHOUT SNOW 22:50:47 ​⛄ 22:50:53 i guess if chaucer did weed he might spell it that way 22:51:24 i don't know the limerick anymore. something about mathematical bold digit seven 22:52:13 SNOWMAN WITHOUT SNOW is the best code point 22:52:50 it really is. as if it was made to be the last line of a haiku 22:52:55 so "zen" 22:52:56 the SNOWMAN WITHOUT SNOW lived in INVISIBLE TIMES 22:53:14 18:13 < nooodl> HEXAGRAM FOR THE CREATIVE HEAVEN 22:53:14 18:13 < nooodl> MATHEMATICAL BOLD DIGIT SEVEN 22:53:14 18:13 < nooodl> KANGXI RADICAL WHITE 22:53:14 18:13 < nooodl> VERTICAL TRAFFIC LIGHT 22:53:15 18:13 < nooodl> NEGATIVE CIRCLED NUMBER ELEVEN 22:53:29 "may you live in invisible times" 22:53:56 kmc: that's what i think every time 22:54:09 `unidecode 򯀨や⛄ 22:54:11 ​[U+DA7C DUNNO] [U+DC28 DUNNO] [U+3084 HIRAGANA LETTER YA] [U+26C4 SNOWMAN WITHOUT SNOW] 22:54:18 fucking screen 22:54:55 `unidecode 🀨や⛄ 22:54:57 ​[U+D83C DUNNO] [U+DC28 DUNNO] [U+3084 HIRAGANA LETTER YA] [U+26C4 SNOWMAN WITHOUT SNOW] 22:55:09 that didn't help. 22:55:14 http://mauke.hopto.org/stuff/javascript/unicode.html?q=%F0%9F%80%A8%E3%82%84%E2%9B%84 22:55:40 oh so `unicode supports characters `unidecode doesn't 22:55:50 unicode.html does both 22:55:59 -!- tertu has joined. 22:56:18 mauke: i think the point was to try to get HackEgo to cite the poem 22:56:34 * kmc realizes that "tile" is only debatably one syllable 22:56:40 stupid english 22:56:52 if we were writing in Hangul we wouldn't have this problem!!!! 22:57:27 oerjan: I though it failed because I'm IRCing through GNU Screen which doesn't do non-BMP chars 22:57:47 have you considered using something that isn't GNU Screen 22:58:12 kmc: well you did not paste the right character, but `unidecode didn't handle the right character either. 22:58:25 /bin/sh: 1: Syntax error: EOF in backquote substitution 22:59:02 /exec -o is always a game of Russian roulette 22:59:12 `unidecode ䷀𝟕⽩🚦⓫ 22:59:14 ​[U+4DC0 HEXAGRAM FOR THE CREATIVE HEAVEN] [U+D835 DUNNO] [U+DFD5 DUNNO] [U+2F69 KANGXI RADICAL WHITE] [U+D83D DUNNO] [U+DEA6 DUNNO] [U+24EB NEGATIVE CIRCLED NUMBER ELEVEN] 22:59:24 yeah, those are surrogate pairs 22:59:33 /exec -ꙮ 22:59:41 $`unidecode \xf0\x9f\x80\xa8\xe3\x82\x84\xe2\x9b\x84 22:59:45 rage face 22:59:55 oh i bet my sh isn't bash or some shit 23:00:09 kmc: btw i'm irc'ing through tmux and am having no problem. 23:03:00 http://andrej.com/fan.html 23:03:17 maybe i'll create an andrej bauer fan club 23:03:39 maybe i'll create an andrej bauer fan club creators fan club 23:10:38 -!- mrhmouse has quit (Quit: Leaving.). 23:14:15 http://www.cs.cmu.edu/~cangiuli/sigbovik/unintentional.pdf 23:16:45 Γ ⊢ FIXME: are these equal? 23:18:32 see also cited http://www.cs.cmu.edu/~rjsimmon/random/bovik2007.pdf 23:19:57 good introduction and elimination rules 23:31:21 http://kjprejects.tumblr.com/ 23:32:10 :D 23:32:19 Just created 23:32:34 King James ISO 9899 doooo it 23:32:47 I'm not in charge! 23:32:52 but you Know A Guy 23:33:03 I Know A Chap 23:33:10 There's... not any difference 23:34:25 and so it came to pass that signed overflow?? 23:36:28 -!- Sprocklem has joined. 23:41:57 ... 23:52:33 -!- gwinbee has joined. 23:53:51 -!- gwinbee has left ("The last Metroid is in captivity. The Galaxy is at peace."). 2014-01-08: 00:00:44 -!- Sgeo has joined. 00:04:44 "Video: The Essence of C++ (Stroustrup)" 00:04:48 C++ has an essence? 00:05:19 It has an evil spirit 00:05:49 I'm starting to think I should use Eclipse 00:05:57 There are Eclipse plugins for Haskell, Erlang 00:06:04 Probably a lot of other languages 00:06:51 "An Eclipse plugin, currently available with CLISP (for WinXP, Macos, Linux) and SBCL (Macos, Linux). It supports the developer with syntax analyses 'as you type' (limited), syntax highlighting, code completion, parenthesis matching, apropos and a listener." 00:07:00 Why is SBCL so stereotyped as being anti-Windows? 00:07:20 dunno, it's been relatively nice to me. 00:13:03 because when you booted it it said shit about evil cats 00:14:56 which was in the runtime for some absurd reason, so you couldn't remove it 00:22:58 `cat cat 00:23:00 Meow~~ 00:55:54 -!- Phantom_Hoover has quit (Quit: Leaving). 00:56:25 -!- Sorella has quit (Quit: It is tiem!). 00:57:07 -!- zzo38 has joined. 01:01:51 -!- nooodl_ has quit (Quit: Ik ga weg). 01:19:52 -!- yorick has quit (Remote host closed the connection). 01:33:32 Sgeo: it does!! 01:34:35 this is why I say that C++ is a bad language that's bad in a way opposite to most bad languages 01:35:48 PHP bad is certainly different from C++ bad 01:35:49 it's a elaborate and conceptually cohesive design by some very smart people attempting some very ambitious goals (which few others have even attempted) and it kinda collapses under its own weight 01:35:57 but it's not just a bunch of unrelated crap thrown together, although that's all most people learn it as :( 01:36:24 C++ is definitely too big 01:36:38 PHP is definitely just a bunch of crap thrown together 01:36:51 a lot of the problems with C++ follow from a small number of onerous design requirements 01:36:54 some of which are questionable 01:37:14 but there's a reason behind everything 01:37:30 it's not like PHP where you ask "why is it done this way" and rasmus lerdorf just flips you off 01:38:20 "Within C++, there is a much smaller and cleaner language struggling to get out. " — Bjarne Stroustrup 01:38:36 Is it called C? 01:38:40 no 01:38:52 it might be called Rust, at least that's the most credible choice I know of 01:39:06 Rust is nice 01:39:10 I think D is more C++ though 01:39:18 yeah 01:39:25 D doesn't aspire to memory safety the way C++ does 01:39:47 er, the way Rust does 01:39:56 Rust aspires to memory safety, but not quite in the way C++ does either 01:40:00 although C++ does aspire to memory safety to a much greater degree than is realized by the "C with crap thrown in" crowd 01:40:11 RAII? 01:40:33 people say things like "C arrays and std::vector are feature duplication!" but really, you use the former to implemen the latter 01:40:43 or to implement other more specialized memory-safe containers 01:40:45 except 01:40:50 you can't really make it memory safe 01:40:56 because of iterator invalidation and related issues 01:41:01 and there's where Rust has to pull in some research ideas 01:41:27 Well, C++ *is* C with crap thrown in, it's just a bit more complicated than "we wrote stuff that's like C, but different". 01:41:47 That depends on what you mean by "C arrays". 01:41:50 Are you counting new[]? 01:42:13 yeah 01:42:29 Instead it's "we've got a bunch of desired semantics, and we've got to make it work on something that's different from C in only trivial ways." 01:42:57 pikhq: my point is that idiomatic C++ is a completely different beast from idiomatic C. it's not like "write C but also use these other random features when they seem useful" 01:43:01 except that's what ~everybody does in practice 01:43:27 Oh, yes, idiomatic C++ is a very different beast from C++ in-the-wild. 01:43:43 because doing things The C++ Way requires mastering too many concepts and has too many unfortunate practical consequences 01:43:53 Particularly with C++11, which makes it reasonable to actually The C++ Way. 01:44:02 Does idiomatic C++ exist? 01:45:37 somewhere 01:45:48 parts of Boost might be considered "idiomatic C++" by definition 01:46:04 it's hard to tell where "idiomatic C++" ends and "terrifying abuse of the language" begins, which is part of the problem 01:46:30 But yes, kmc, you're definitely right. C++ is bad because of having design goals that result in something awful when combined, rather than hardly being designed. 01:46:40 Which is pretty unique. 01:46:51 Boost has a lot of nice stuff, though, and it's not fair how people judge this large, heterogenous collection of libraries by its most excessive parts 01:47:00 pikhq: yep 01:47:12 and I would argue that you can do much better if you remove just one or two of those design goals 01:47:42 the first ones I would drop are syntactic (near-)compatibility with C, and total compatibility with a C-style build incl. header files etc 01:47:44 Just making it not have to pretend to be C would probably help matters decently. 01:47:47 yep 01:48:08 Unfortunately that feature is probably what made it successful. :P 01:48:24 you can use Rust as basically that, and still do unsafe crap everywhere if you like 01:48:40 but you still lose some powerful C++ features 01:49:09 I was thinking more in terms of marketing in this... 01:49:11 (note that I say "powerful" and not "nice". those C++ features are Not Your Friend but they can do amazing stuff) 01:49:19 foremost, templates 01:49:41 The idea that C++ is "C version 2" probably helped a lot. 01:49:47 yeah 01:49:51 lies are very effective for marketing 01:49:59 Yup. 01:50:07 Especially ones that aren't obvious. 01:50:32 I mean, C++ looks a lot *like* it's C version 2. (by design) 01:51:13 yep 01:51:16 so do Java and C# 01:51:30 despite being fundamentally different 01:51:35 To a lesser extent, but yeah. 01:51:54 Java was successfully marketed as a "C++ replacement" because people were using C++ for the wrong kinds of things (but for lack of alternatives, so was it really "wrong"?) 01:52:49 clearly they should have been using ANSI Common Lisp all along. 02:05:03 Did you lose templates? 02:06:21 What I don't like about C++ templates is using < > for delimiters for the template syntax; it can cause a lot of confusion 02:06:55 Rust has generics, but they act much more like traditional parametric polymorphism (with typeclass bounds), rather than the... exotic mixture of polymorphism, macros, and type introspection that is C++ templates 02:07:23 Rust has macros too but likewise 02:07:39 you can do things with C++ templates that you can't easily do with polymorphism + macros, even together 02:07:55 What kind of things, for example? 02:08:30 type introspection, data structures that ask if the parameter type is a pointer or a reference or whether it has a virtual destructor and does different things 02:08:54 Ah, OK 02:09:09 -!- tromp has joined. 02:09:42 this kinda stuffs http://www.cplusplus.com/reference/type_traits/ 02:09:55 But how much does it really help? 02:10:03 i dunno 02:10:04 it's cool tho 02:10:20 It doesn't seem so helpful. 02:10:52 Some of those things might be useful, but some doesn't seem like very good. 02:11:21 well, as an example, the Rust compiler has a special case to represent Option (which is like Haskell's Maybe T) as one word, when T is a non-nullable pointer (so NULL can be used for None) 02:11:32 and it seems like you could do that in C++ purely in library code 02:11:39 i haven't tried, though 02:12:06 The special case is for any ADT that's obviously like Option, isn't it? 02:12:12 right 02:12:26 it's not for Option by name, but for any type with the same structure 02:12:30 E.g. I think you get it automatically for the equivalent of Either () T 02:12:33 maybe 02:12:44 it doesn't generalize out to n-ary enums where n-1 of the ctors are nullary, though :/ 02:13:11 reserve the first page of addresses for nullary enum discriminants! 02:13:12 If it is only for optimization then such a special case is probably OK, if it is controlled by the optimization setting. 02:13:30 zzo38: I don't think it's controlled by the optimization setting, because it's part of the ABI? 02:13:36 anyway i have to go, ttyl though 02:13:46 O, it is part of the ABI. 02:13:46 did you know that ghc ignores {-# UNPACK #-} with -O0 02:19:05 GNU C supports a "typeof" operator, which can do some of kind of things, such as typeof(*(X)0) might make the type of what X is being pointed to, but it won't do much with the normal C codes, although it still would have a few uses in macros. 02:19:50 Some of the C++ type adjustments stuff can be done in this way. 02:21:40 Therefore I have made up the (draft) specification which has struct/union with parameters, so using this, typeof becomes more useful, and so do many other things. Does Rust have "typeof" operator? Haskell doesn't seem to have, although perhaps similar things can be done in other ways, using the GHC extensions. 02:23:44 C++ type traits seems to have a lot of things, much seems not so useful, or can cause confusion in some cases. 02:23:55 But, maybe there is a use of it. 02:24:43 It does seem to me like a lot of these features could be simplified by using typeof instead. 02:28:07 -!- nisstyre has quit (Quit: Leaving). 02:30:01 -!- drlemon has joined. 02:32:12 Some of the features may seem to be useful for optimization though; maybe it would help to define another file which is used to specify which optimizations are possible, and if applicable (inside of a #master block) which modules it is applicable to. 02:35:04 shachaf: yes, Either<(),T> does get optimized by rustc. 02:35:42 I didn't know that. 02:35:47 and more generally, it may optimize enum Foo { Null, NonNull(uint, uint, uint, ~uint, uint) } since the NonNull variant has a non-nullable field 03:07:49 oh, i didn't know about that 03:10:04 kmc: and the gotcha is that Option<(uint,uint,uint,~uint,uint)> does not get optimized currently (though it's isomorphic to Foo above) ;) 03:10:12 I think there is an issue about it 03:11:02 #9378. 03:24:37 -!- LinearInterpol has quit (Ping timeout: 265 seconds). 03:59:21 -!- Yonkie has quit (Ping timeout: 276 seconds). 04:05:00 -!- Yonkie has joined. 04:06:47 -!- tertu has quit (Ping timeout: 272 seconds). 04:09:12 -!- conehead has quit (Quit: Computer has gone to sleep.). 04:11:06 -!- tertu has joined. 04:23:20 -!- tertu has quit (Ping timeout: 246 seconds). 04:24:34 -!- contrapumpkin has changed nick to copumpkin. 04:33:41 -!- mauke has quit (Disconnected by services). 04:33:51 -!- mauke has joined. 04:35:17 -!- preflex has quit (Ping timeout: 248 seconds). 04:36:09 -!- preflex has joined. 04:44:54 So, I finally got an electric kettle. 04:44:58 How did I live previously. 04:45:41 steam-powered, obviously. 04:45:46 :t ContT 04:45:47 ((a -> m r) -> m r) -> ContT r m a 04:46:00 Would be nice if IO came with a ContT-like function 04:46:07 So IO instead of ContT r IO 04:46:11 (they are not a common thing in the US.) 04:46:44 Sgeo: You would have to do it yourself, but Haskell lacks the macros to do it conveniently. 04:47:35 Hmm, maybe not 04:48:01 A single ContT r IO a is basically ... one marker that the continuation is delimited at 04:48:14 I think 04:48:48 http://www.reddit.com/r/haskell/comments/1b8wzp/my_shot_at_cont/c94v11y 04:50:06 an electric kettle is not as good for making moonshine 04:50:44 ContT can be used for other things too, like this example: http://esolangs.org/wiki/Talk:Bruijndejx A lot of other similar things can be done too, with continuation monads. 04:52:13 -!- karlenarencibia has joined. 04:52:53 -!- karlenarencibia has left. 04:53:33 kmc: Yeah, but who cares? 04:53:55 Here in Missouri we don't need surreptitious distilling. 04:54:11 People who have electric kettles and who want to make moonshine, would care. If you don't want to make any such things, then you shouldn't care. 04:54:16 Stills are perfectly legal for personal use. 04:56:13 distilling your own booze sounds fun tho 04:56:25 There's a J monad. I do not know what it does. 04:56:48 Sgeo: Where is it in? If you have its definition, then you can learn. 04:56:50 And of course searching for it gives hits regarding J's different use of the term 'monad' 04:56:54 Yup. And you can do up to 100 gallons of it. 04:56:58 can't be as cool as the OMEGA MONAD 04:56:59 http://www.reddit.com/r/haskell/comments/9clsr/wanted_applications_of_the_j_monad/ 04:57:09 100 gallons of azeotropic ethanol? Sure! 04:58:43 i got an electric kettle for christmas, after trying and failing to boil water in a microwave 04:58:44 that's about 8 × 10^9 joules 04:58:50 and british people on irc asked me what the fuck i was doing 04:59:03 british people on irc ask me what the fuck i'm doing every day 04:59:07 That's the typical American thing to do. 04:59:09 Sgeo: Well, there it is; furthermore, it is the same as (CodensityAsk (Op r)) which I think I might have proven. 04:59:18 Turns out boiling water in the microwave is shitty. 04:59:24 yes. yes, it is 04:59:26 I have even less idea what CodensityAsk is 04:59:30 (Therefore, the Escardo's S monad is also same as CodensityAsk Predicate) 04:59:42 Hence why I am wondering how I lived. 05:00:03 well good to know it will be all my boiling water-related dreams and more 05:00:08 newtype CodensityAsk f x = CodensityAsk (forall r. f r -> (x -> r) -> r) 05:00:19 Oh, infinite search in finite time 05:01:20 http://math.andrej.com/2008/11/21/a-haskell-monad-for-infinite-search-in-finite-time/ 05:01:25 Some of those functions already have names 05:02:03 search is the only one I don't recognize as either being Monad or ... there's another typeclass that union makes me think of, MonadPlus? 05:02:14 One feature of CodensityAsk is that if (Comonad f), then (MonadPlus (CodensityAsk f)). 05:06:32 "This forces the sets to be non-empty, but has a defect: it also forces the find operator to tell lies when there is no correct element it can choose. " 05:06:33 ew 05:15:12 I seriously need to compare and contrast Rebol PARSE with monadic parsing 05:15:23 Don't know enough about the former 05:17:54 Rebol tends to suffer the same way as concatenative languages from being difficult to read when there are unfamiliar functions present :/ 05:18:33 Also from its love of doing exactly what I hate about dynamic typing culture 05:19:58 I think I once decided though that Rebol strictly > Tcl 05:23:35 -!- oerjan has quit (Quit: Nit). 05:23:42 http://www.red-lang.org/2013/11/041-introducing-parse.html claims that PARSE is composable 05:23:48 Well, that the rules are 05:24:46 -!- FreeFull has quit (Read error: Operation timed out). 05:25:55 yeah 05:29:11 -!- FreeFull has joined. 05:31:03 hrmph, I don't think I agree with this slideshow's assessment of Rebol as having "dynamic binding" 05:31:15 Oh, .... I confused binding and scoping 05:31:26 It says definitional scoping. Which... ok 05:34:35 Self-hosting reminds me of nomic. If you have a bug before you self host, that bug could stay there forever and be unfixable without anyone even noticing 05:34:38 -!- FreeFull has quit (Read error: Operation timed out). 05:37:59 Oh, rebol's approach to Internet protocols is.... icky 05:38:03 Global names for schemes 05:38:20 Being able to type irc:// is SO valuable, let's give up modularity 05:38:28 I don't know if Red will fix things like that 05:53:07 -!- tertu has joined. 05:55:18 zzo38: CodensityAsk should just be called Free or something. 05:55:39 shachaf: I know the name "CodensityAsk" is not so good, but "Free" refers to something else. 05:56:04 Yes, Free monad. 05:56:15 But that's a big abuse of the name Free. So many things are free. 05:56:20 -!- tromp has quit (Remote host closed the connection). 05:56:27 Yes, I know that 05:56:55 -!- tromp has joined. 06:01:23 -!- tromp has quit (Read error: Operation timed out). 06:06:59 -!- ter2 has joined. 06:08:18 -!- myndzi has quit (Ping timeout: 240 seconds). 06:08:41 -!- tertu has quit (Read error: Connection reset by peer). 06:17:04 -!- augur has quit (Read error: Connection reset by peer). 06:17:52 -!- augur has joined. 06:20:24 -!- myndzi has joined. 06:29:15 -!- FreeFull has joined. 06:51:40 -!- Sprocklem has quit (Ping timeout: 245 seconds). 06:59:15 -!- tromp has joined. 07:19:49 ahaha, there was a big security incident in South Korea which exposed at least 130 million records of personal records from three credit card companies. 07:23:04 and stupidly enough that was because they out-sourced the fraud detection system development to the other company and employees can easily access those informations 07:23:32 seriously, the whole company is a great test bed for crackers :S 07:28:18 -!- Slereahphone has joined. 07:30:41 -!- tromp has quit (Ping timeout: 252 seconds). 07:48:04 -!- FreeFull has quit (Ping timeout: 246 seconds). 07:50:02 -!- FreeFull has joined. 07:52:04 -!- Slereahphone has quit (Quit: Colloquy for iPhone - http://colloquy.mobi). 08:11:19 -!- tromp has joined. 08:18:29 -!- ter2 has quit (Ping timeout: 265 seconds). 08:18:51 -!- MindlessDrone has joined. 08:32:24 -!- LinearInterpol has joined. 08:42:33 -!- tromp has quit (Ping timeout: 252 seconds). 08:59:28 -!- FreeFull has quit. 08:59:32 -!- tromp has joined. 09:03:24 -!- tromp has quit (Read error: Operation timed out). 09:04:01 -!- LinearInterpol has quit (Ping timeout: 246 seconds). 09:13:57 -!- hogeyui___ has quit (Ping timeout: 276 seconds). 09:22:37 There's some nondeterminism in my sox. :/ 09:23:42 -!- rntz^2 has quit (Ping timeout: 252 seconds). 09:24:08 No! You have to put a question mark so that you can question yourself? 09:26:08 There's some nondeterminism in my sox? 09:30:42 OK 09:31:19 Is "Ouch" a proper name for a magical familiar in case they need to have a proper name (for any reason)? 09:32:08 ew, people actually write "concat [[x], xs]" 09:33:41 They do? 09:33:48 -!- zzo38 has quit (Quit: zzo38). 09:34:03 well, at least some of the students here 09:36:06 myname: can you fail them for that? 09:36:30 sadly not 09:37:05 i also got [x] ++ xs sometimes 09:37:38 and even worse: foo (x:xs] | x:xs == [] = [] 09:37:54 *) 09:38:50 myname: winners 09:40:37 i kind of doubt they did proper testing 09:41:24 dock all the grades 09:42:00 but worst thing i have seen so far is 09:42:03 2^4 - 2^3 09:42:06 = 10 - 0 09:42:07 = 8 10:05:52 oerjan: (or someone else) do you know a proof that a countable subshift has 0 entropy other than stuff about the variational principle? 10:07:15 (with the variational principle: for subshifts, you can always find a measure of maximal entropy. such measures form a compact simplex so there's an extremal point. but an extremal point is clearly a periodic orbit.) 10:07:51 (and periodic orbits quite obviously have 0 entropy) 10:08:31 the first occurrence of "entropy" in my message being topological 10:17:35 -!- hogeyui has joined. 10:35:42 2^4 - 2^3 is 8 10:36:33 -!- stuntaneous has joined. 10:37:01 mroman_, look at the intermediate step 10:38:15 Meh. Happens. 10:39:03 My brain is capable of assuming 4 - 0 = -4 10:39:30 if you are reading from right to left 10:39:44 -!- impomatic has quit (Ping timeout: 260 seconds). 10:40:27 I remember a statistics exam where all my intermediate results were correct 10:40:40 but I failed to write the end result correctly 10:40:46 how are the odds 10:41:24 stuff like sqrt(80) = 9.38 10:41:40 someone needed to make sqrt(2.25) 10:42:04 i told him "hey, try writing it as a fraction. hint: .25 may be quarters" 10:42:13 he wrote sqrt(9/4) in the end 10:42:22 uhm 10:42:25 it was kinda disappointing 10:42:29 that makes sense 10:42:35 it's not wrong 10:42:45 except it's 3/2 10:42:48 but i assume, you should be able to calculate sqrt(9/4) 10:43:06 how does one multiply fractions again? 10:43:12 a/b * c/d = ac/bd? 10:43:45 yeah 10:43:47 then 3/2 10:45:53 I'm pretty bad at math, especially with numbers 10:46:23 but luckily most stuff that's actually required if you're not actually studying math is pretty straight forward 10:48:42 What's the worst grade in the US required to still pass an exam? 10:49:08 D? 10:50:30 > (60/100*5)+1 10:50:31 4.0 10:50:45 sounds about right. 11:20:02 -!- atrapado has quit (Quit: Bye). 11:31:39 -!- LinearInterpol has joined. 11:54:45 WeeChat doesn’t handle joining a channel with 45365 users too well. 12:02:15 I did not realise such channels existed 12:04:06 Eevee 3 caught 12:09:54 Eevee 4 caught 12:09:59 Now for breakfast 12:10:02 -!- nortti has changed nick to nortticat. 12:10:24 -!- nortticat has changed nick to nortti. 12:10:39 taneb: #speeddemosarchivesda on irc.twitch.tv, i.e. the chat backend for http://de.twitch.tv/speeddemosarchivesda 12:12:09 Right, makes sense 12:12:22 A not-really-meant-to-be-used-as-an-IRC-channel IRC channel 12:19:44 Oh, it's AGDQtime. 12:20:00 -!- stuntaneous has quit (Ping timeout: 256 seconds). 12:20:09 (I did not even know.) 12:22:01 -!- yorick has joined. 12:28:20 -!- LinearInterpol has quit (Ping timeout: 252 seconds). 12:35:50 -!- conehead has joined. 12:55:04 -!- LinearInterpol has joined. 13:01:22 -!- LinearInterpol has changed nick to {}. 13:01:43 -!- {} has changed nick to {|}. 13:01:57 -!- {|} has changed nick to {^}. 13:02:12 -!- {^} has changed nick to {I}. 13:02:21 -!- {I} has changed nick to {L}. 13:02:37 -!- {L} has left ("Hack the planet."). 13:04:38 -!- boily has joined. 13:04:42 -!- metasepia has joined. 13:09:01 -!- {C} has joined. 13:12:29 -!- Sgeo has quit (Read error: Connection reset by peer). 13:13:02 -!- MindlessDrone has quit (Read error: Operation timed out). 13:24:58 {C}: just how many different nicks do you have? 13:26:15 <{C}> boily: the max that's allowed. 13:26:39 -!- hogeyui has quit (Ping timeout: 240 seconds). 13:27:12 -!- hogeyui has joined. 13:29:09 -!- MindlessDrone has joined. 13:30:37 Huh. There's this technology-themed event (short lectures intended for non-specialist audiences etc.) at the nearby conference place soonishly. There's one lecture that's just listed as "Laser". 13:33:08 Clerical error? 13:34:47 Well, I don't know. There's a subheading of approximately "technology of light" above that, and something about natural light. 13:35:19 But it's kind of unclear what to expect. 13:35:28 Perhaps they'll burn the attendees with lasers. 13:35:58 do you smell different if you get burned by different laser colours? 13:36:33 More research is clearly needed. 13:43:22 -!- ais523 has joined. 13:51:58 -!- jix has quit (Remote host closed the connection). 13:52:49 -!- jix has joined. 14:03:53 `run printf "%2x%2x%2x" 71 108 108 14:03:54 476c6c 14:07:37 -!- Phantom_Hoover has joined. 14:08:53 fungot: What do you think of #476c6c as, say, a wall paint color? 14:08:54 fizzie: it's a common reaction that you seem to be a fnord but good link on simplifying the metaobject stuff i think :p but neighbour might've woken up), 3) 14:12:02 fizzie: that color is used as a colorkey for transparent in NetHack 4 14:12:10 I'm not sure transparent wall paint would be such a good idea 14:12:14 perhaps it would be 14:12:21 hmm, as a color, that seems a bit dark. 14:12:22 you get the benefit of paint but can still see the wall 14:13:24 fungot: Enumerate the non-colorrific benefits of wall paint, please. 14:13:24 fizzie: i think that specifing relative heading sizes is not only a disassembler :) 14:13:26 (I'm sure I'll get something relevant out of there if I'm just patient enough.) 14:14:08 fungot is about fun, not relevance, or is it? 14:14:08 int-e: do you have a picture that actually highlights all of the 14:14:49 Now fungot stopped in mid sentence leaving me wondering how it ends. How rude. 14:14:50 int-e: i wonder why that restriction was imposed. i wanted to try 14:15:02 And again. 14:19:34 fungot: I think there's something screwed up in your hardwired sentence length mechanism. 14:19:34 fizzie: are you considering implementing a lang with that syntax? 14:19:53 fungot: Well, no. I can't even see how that makes sense. 14:19:53 fizzie: my bot has been down for quite awhile since i've been on sine a few times. i knew i could change it 14:20:22 #esoteric -- the channel where even the bots have bots. 14:22:58 -!- Phantom__Hoover has joined. 14:26:35 -!- Phantom_Hoover has quit (Ping timeout: 260 seconds). 14:30:30 -!- {C} has quit (Read error: Connection reset by peer). 14:30:56 -!- {C} has joined. 14:40:21 -!- metasepia has quit (*.net *.split). 14:40:21 -!- boily has quit (*.net *.split). 14:40:24 -!- preflex has quit (*.net *.split). 14:43:06 -!- metasepia has joined. 14:43:06 -!- boily has joined. 14:43:06 -!- preflex has joined. 14:45:07 -!- boily has quit (Quit: Poulet!). 14:45:15 -!- boily has joined. 14:45:37 that was the most impressivest netsplit I ever seen. 14:45:48 -!- metasepia has quit (Remote host closed the connection). 14:45:56 -!- metasepia has joined. 14:47:58 boily: you were on the small side 14:48:06 it looked really minor to me 14:50:56 I was on the miniature side. only my bot, that preflex karmic bot, and I were on it. 14:58:52 -!- `^_^v has quit (Quit: Leaving). 14:58:52 -!- mrhmouse has joined. 15:15:50 -!- ter2 has joined. 15:18:31 -!- `^_^v has joined. 15:32:19 -!- {C} has quit (Ping timeout: 272 seconds). 16:09:06 fungot: who's your bot? 16:09:06 FireFly: they take an argument that i call with a selector function to get them started at a young audience. 16:12:25 -!- {C} has joined. 16:18:40 -!- FreeFull has joined. 16:26:33 -!- augur has quit (Ping timeout: 252 seconds). 16:27:37 -!- augur has joined. 16:29:58 -!- augur_ has joined. 16:30:01 -!- augur has quit (Read error: Connection reset by peer). 16:32:50 oh, we have fungot again? 16:32:51 mrhmouse: are you new to scheme, exporting functions such as map. 16:33:37 oh neat, Keymaker proved Forte TC 16:33:53 and with a horrendously slow construction, it's always great when that happens 16:34:49 -!- augur_ has quit (Read error: Connection reset by peer). 16:35:18 -!- augur has joined. 16:41:29 Keymaker is still alive? 16:42:06 boily: he avoids the IRC channel even more than I do 16:42:14 I think we both care about esolangs more than the social stuff 16:49:54 Sounds reasonable. In the time that I've spent on #esoteric, I've seen more talk about traditionalangs, Unicode, and Finnish ball alcohol than esolangs. 16:51:17 -!- FreeFull has quit (Read error: Connection reset by peer). 16:52:55 -!- ter2 has quit (Read error: Connection reset by peer). 16:53:07 -!- ter2 has joined. 16:54:51 ais523: i was wondering whether continued fraction arithmetic was turing-complete 16:55:20 Well continued fraction and what else 16:55:30 quintopia: huh, I don't know how it works 16:55:33 Like a functional language with continued fraction as a function? 16:55:43 ais523: for instance, whether one could do arbitrary computation by adding up a list of real numbers in continued fraction representation 16:56:04 If you allow real numbers, then yes 16:56:17 Because you can always find a real number containing exactly what you want 16:56:33 Find the real number containing the solution, divide it by 1 16:56:36 Bam! 16:56:38 yeah but you might not be able to define it 16:56:53 actually, I guess that's where the "computable" in "computable reals" comes from 16:56:58 Well that is the problem 16:57:04 computable reals are TC, bounded-storage reals aren't 16:57:06 Some are not even definable! 16:57:09 Slereah: that part is obvious. the less obvious part is whether you can find real numbers which don't require a turing-complete generator to add up to the real number you want 16:57:31 quintopia : "real numbers that don't require a TC generators" are basically integers 16:57:41 Computable reals have a cardinality of aleph naught 16:58:03 If you allow more than integers, you get additions and such 16:58:07 Slereah: i can generate e with a sub-turing complete system. its continued fraction is a dead simple pattern 16:58:12 And additions plus some functional apparatus are already almost TC 16:58:39 Well 16:58:39 Slereah: "almost" 16:58:42 If you want 16:58:53 Markov did a nice article on how to generate computable numbers 16:59:27 Basically you need three computable integer functions 16:59:33 f, g and h 16:59:58 And you get x = (f(n) - g(n))/h(n) 17:00:12 And this will converge to x with n going to infinity 17:01:09 wow 17:01:54 Errr 17:02:02 x = (f(n) - g(n))/(h(n) + 1) 17:02:03 but f, g, and h might require a TC underlying system to compute them, yes? 17:02:05 To avoid PROBLEMS 17:02:19 Well yes, he defined them with µ-recursive functions 17:02:44 But 17:02:51 if you want to do continued fractions 17:03:06 This will imply some sort of loop 17:03:20 You might be able to replace the µ function with it maybe I guess? 17:03:34 Since it is also at heart the way of looping 17:04:29 -!- conehead has quit (Quit: Computer has gone to sleep.). 17:11:36 Slereah: i was thinking a way of generating continued fractions where each new term can depend on a constant number of previous terms, with basic arithmetic 17:12:06 Slereah: say, just addition, subtraction, and multiplicatio 17:12:07 n 17:12:30 Well you can just do addition and multiplication of relative integers 17:13:08 okay just that then 17:13:34 which means that every continued fraction one can generate this way is nondecreasing 17:13:56 obviously not turing-complete 17:14:30 well, maybe not obvious 17:14:52 but it's clear you can't generate an arbitrary computable number this way 17:15:19 -!- conehead has joined. 17:15:49 -!- Bike has quit (Ping timeout: 248 seconds). 17:16:37 -!- {C} has quit (Ping timeout: 252 seconds). 17:17:42 -!- Bike has joined. 17:30:45 -!- Phantom_Hoover has joined. 17:33:15 -!- Phantom__Hoover has quit (Ping timeout: 260 seconds). 17:39:21 -!- LinearInterpol has joined. 17:40:55 -!- Sprocklem has joined. 17:48:53 -!- nooodl has joined. 18:06:21 -!- FreeFull has joined. 18:11:47 Y'know, for a program called "Impress", LibreOffice Impress sure doesn't. 18:12:39 *rimshot* 18:12:55 @tell oerjan Oh? What does glogbackup say in !logs? 18:12:55 Consider it noted. 18:19:46 -!- ais523 has quit. 18:44:19 -!- LinearInterpol has quit (Ping timeout: 246 seconds). 18:44:24 -!- zzo38 has joined. 18:46:16 Gregor: Excel also doesn't. So they're in good company. 18:48:30 -!- Phantom_Hoover has quit (Ping timeout: 252 seconds). 18:48:44 -!- Sprocklem has quit (Ping timeout: 265 seconds). 18:56:14 Is "Impress" the presentation one? 18:57:12 uyyes. 18:57:25 funny (I'm lagging). yes. 18:57:55 (But at least this is good old-fashioned network lag, not a UI problem.) 19:25:13 -!- LinearInterpol has joined. 19:29:45 -!- LinearInterpol has quit (Ping timeout: 252 seconds). 19:32:46 -!- impomatic has joined. 19:39:52 -!- Sprocklem has joined. 19:56:31 I want to add Dan Hibiki into the Puzzle Strike game. (However, in Puzzle Fighter they only send red gems, and Puzzle Strike doesn't have any red gems; it has only green.) 20:17:23 -!- zzo38 has quit (Remote host closed the connection). 20:41:29 what is the puzzle striker game? 20:45:13 -!- Sprocklem has quit (Ping timeout: 265 seconds). 20:58:31 Street Fighter spinoff, I believe 21:08:01 -!- Sprocklem has joined. 21:44:20 -!- ter2 has quit (Read error: Connection reset by peer). 21:44:40 -!- ter2 has joined. 21:50:20 -!- ter2 has quit (Ping timeout: 260 seconds). 21:51:00 -!- MindlessDrone has quit (Quit: MindlessDrone). 21:59:04 -!- oerjan has joined. 22:00:17 @messages-ludo 22:00:17 Gregor said 3h 47m 22s ago: Oh? What does glogbackup say in !logs? 22:01:37 @tell Gregor iirc it says something like that its logs will be quickly merged once glogbot returns. 22:01:37 Consider it noted. 22:02:32 !logs 22:06:30 does anybody know if it's possible to get an input mode (in Windows) like Vim's digraphs? The chorded one is what I'm after (e.g. ^k l *) 22:08:32 -!- FreeFull has quit (Ping timeout: 260 seconds). 22:08:33 kmc, as someone in the US interested in rail travel, what are your thoughts on http://www.telegraph.co.uk/news/worldnews/asia/japan/10555330/Japan-offers-to-lend-US-half-the-cost-of-Super-Maglev-train-between-Washington-and-Baltimore.html 22:09:19 -!- Sorella has joined. 22:09:41 my first thought is "lol you can't build a bike shed for $8 billion in the US" 22:09:53 the japanese clearly aren't used to accounting for our beyond-ridiculous capital construction costs 22:10:07 There's some nondeterminism in my sox. :/ <-- either use the axiom of choice, or use shoes instead hth 22:10:25 also don't be 7 hours idle. 22:10:37 maglev has a lot of problems, it needs totally different infrastructure everywhere 22:10:55 they can't run high speed trains DC-Baltimore and continue them on to NYC 22:11:18 and they aren't that much faster than high speed conventional rail 22:11:24 i thought the japanese were deep in depth already. 22:11:40 @tell Gregor iirc it says something like that its logs will be quickly merged once glogbot returns. // Depends on your definition of "quickly" 22:11:49 I consider "before the heat death of the universe" pretty quick. 22:11:55 let's start with America getting some high speed rail of the form that existed in Japan and France 40+ years ago 22:12:00 Gregor: it did almost certainly not use those exact words 22:12:14 and that now exists in practically every other developed nation 22:12:34 America is just not the place to innovate in rail in any form 22:12:43 except norway. we also have ridiculous rail. 22:12:49 kmc: It was before everybody else beat us :) 22:13:11 the only innovation we do is rebuilding things that exist elsewhere from scratch because they aren't american enough 22:13:26 You spelled "they don't have enough Jesus" wrong. 22:13:30 like CA High Speed Rail could use ERTMS but ewwww, it has "european" in the name, let's invent our own signalling system from scratch at incredible cost 22:13:55 Gregor: in Japan they call him Annual Gift-Giving Man and he lives on the moon. 22:16:49 "Conventional Maglev technology is already in use on a number of short routes around the world, but is limited to a speed of around 267mph." 22:16:52 uh 22:17:22 there is ONE maglev in the world with passenger service meeting that description 22:17:45 it connects Shanghai Pudong International Airport to the outskirts of the Shanghai Metro 22:18:51 as in there's only one limited to 267 mph, or only one on a short route 22:18:58 the only other "maglevs" in the world are things in the style of airport people movers that get up to 60 mph at most 22:19:19 Bike: there's only one that gets anywhere near 267 mph or even a speed that would be impressive in 1900. 22:19:30 kmc, so, you're saying that a newspaper can exaggerate!? Wow! 22:19:40 Also 22:19:42 you asked my opinion and there it is :) 22:19:49 Yeah, the article does make it seem futurey 22:19:53 I like future-y 22:20:12 Americans love futurey sounding transport crap that will never get built 22:20:22 because we are abject failures at implementing technology that was already proven in 1970 22:21:10 hence HYPERLOOP 22:21:27 the design documents for hyperloop don't hold up to even slight scrutiny 22:21:59 -!- FreeFull has joined. 22:22:02 Look, maglev is perfectly viable in Transport Tycoon, you just apply the conversion tool to the tracks. 22:22:12 but thinking that a Silicon Valley billionaire will singlehandedly save us all with UFO technology is more plausible than thinking that the government and the railroad regulators could get their act together and join the 1970s 22:22:18 fizzie has a point 22:22:21 :D 22:24:59 -!- Sprocklem has quit (Ping timeout: 252 seconds). 22:45:20 -!- oeh has joined. 22:50:39 -!- FreeFull has quit (Quit: Rebooting into Linux). 22:50:40 -!- oeh has left. 22:53:10 -!- FreeFull has joined. 22:56:37 -!- TodPunk has quit (Read error: Connection reset by peer). 22:56:50 -!- TodPunk has joined. 23:33:42 -!- mrhmouse has quit (Read error: Connection reset by peer). 23:54:01 -!- LinearInterpol has joined. 23:54:20 -!- LinearInterpol has changed nick to {C}. 2014-01-09: 00:16:40 -!- Sgeo has joined. 00:17:24 -!- nooodl has quit (Ping timeout: 265 seconds). 00:21:47 -!- Phantom_Hoover has joined. 00:50:26 PARSE isn't _quite_ monadic yet 00:51:19 PARSE? 00:52:36 -!- Sprocklem has joined. 00:54:23 -!- tromp has joined. 00:54:30 what's with the word "noetherian" 00:54:42 http://www.red-lang.org/2013/11/041-introducing-parse.html 00:57:17 you got a problem with noether 00:58:11 no 00:58:19 k 00:58:25 but what's wrong with "terminating" 00:58:58 shachaf: um terminating does not indicate _what_ terminates. 01:00:02 if you terminate in the other direction you get artinian instead of noetherian hth (btw i don't remember which is which. or for that matter what that chains are made of.) 01:00:27 *the 01:00:31 help 01:00:35 i was talking about rewriting systems 01:00:46 what. 01:00:57 i was talking about rings. 01:01:34 and possibly modules. as i said, i don't remember exactly what terminates. 01:01:39 "Noetherian rewriting system, an abstract rewriting system that has no infinite chains" huh 01:02:15 hm i have some doubts noether actually investigated those. 01:02:22 but then maybe she did. 01:02:38 ok i guess noetherian means a zillion things 01:02:54 well they mostly have to do with infinite chains, probably. 01:03:02 although not quite as many zillions as eulerian. 01:12:14 -!- EgoBot has quit (Ping timeout: 264 seconds). 01:12:41 -!- EgoBot has joined. 01:22:05 -!- tswett has joined. 01:22:33 All right, all right, I've got it. 01:23:29 The fundamental unit of computing could essentially be a region of memory tied to some pieces of code manipulating it, right? Call this whole assembly an "object". 01:23:42 Programming could consist simply of combining objects in certain ways. 01:24:15 <{C}> the fundamental unit of computing is the symbol. 01:25:01 <{C}> computation is symbols with rules. 01:25:28 the fundamental unit of computation is the string, from which i shall make the ultimate programming language, snobol 01:25:38 <{C}> Bike: thank you, we needed that. 01:25:55 It turns out the fundamental unit of computing is actually the troy pound. 01:25:56 you always do 01:26:08 <{C}> pffthahaha. 01:26:22 this is why computing feathers is harder than computing gold. 01:26:49 wait should it be lead. 01:26:53 So, now I'm thinking. 01:28:03 apparently it can be gold as well. 01:28:13 <{C}> it can. gold is incredibly dense. 01:28:30 Suppose we have a "beep" object. The object must be invoked exactly once. The object has no memory, takes no input and produces no output. When the object is invoked, the system beeps. 01:28:34 * oerjan swats {C} -----### 01:28:34 What is the type of the object? 01:29:01 <{C}> the type of the object is a beep, derived from noise, derived from a call. 01:29:23 (Which system beeps? The Dwight D. Eisenhower National System of Interstate and Defense Highways, obviously.) 01:29:35 <{C}> and you just lost me. 01:30:21 none of you were ever found anyway. 01:31:19 what the hell is a type 01:31:46 "C 01:31:50 help 01:31:52 oh 01:31:53 A type is a property of an abstract object determining the contexts in which it can be meaningfully used. 01:32:02 shachaf: stick a colon in front of each of your messages! 01:32:05 Like this! 01:32:05 what's "abstract" and "context" and "meaning" 01:32:17 what are all these shockingly unfundamental things! 01:32:32 Bike: everything hth 01:32:41 whoa 01:32:50 Bike: consult the Blue Book. 01:32:54 <{C}> zooba wha. 01:33:09 <{C}> blue book? wazzat? 01:33:19 <{C}> what're all of these marvelous things?! 01:33:33 i think that was a touhou fan comic 01:34:04 the fundamental unit of computing is the volt 01:34:11 The Blue Book is also known as "Fundamentals of Philosophy", published by David Zeittler in 2018. 01:34:42 <{C}> fuckin' lol. 01:35:10 He describes a complete philosophical framework within which most major philosophical problems can be solved. 01:35:31 <{C}> I'm fully convinced that tswett is insane. 01:35:31 It's quite the book. You should read it. 01:36:36 `? mad 01:36:42 ​"But I don't want to go among mad people," Alice remarked. "Oh, you can't help that," said the Cat: "we're all mad here. I'm mad. You're mad." "How do you know I'm mad?" said Alice. "You must be," said the Cat, "or you wouldn't have come here." 01:37:09 hm never heard of that 01:37:54 So, where were we. I was trying to figure out the type of an object which must be invoked exactly once, and then returns control. 01:38:40 Isn't linear logic supposed to have such a thing... 01:38:49 i think trying to find a fundamental unit of computing always flops. 01:38:53 {C}, sacrifice Linear Interpol: You get an emblem with "Creatures you control get +4/+4 and have double strike and trample." 01:39:01 <{C}> friggin' lol. 01:39:04 what does {C} even mean 01:39:09 <{C}> I don't even know. 01:39:12 Copyright lemon. 01:39:16 <{C}> LOL. 01:39:22 <{C}> I'm keeping that. 01:39:35 no one's buying the act, oklopol 01:41:07 Lessee, one lolly one is bottom par one which, in the waiting state, is... some thing, who the hell knows... 01:41:45 just use chu spaces to figure it out 01:41:46 How the hell is it determined which of the things in a par is... eh, best not to think about it. 01:41:57 The object I mentioned has type Unit -> Unit. 01:41:58 the chu space calculator will even do it 01:42:22 http://chu.stanford.edu/live/ 01:42:23 You invoke it using a Unit as input. It replies with a Unit as output. 01:43:47 Yes, yes. 01:45:16 How about an "int" variable? !((Int -> Unit) & (Unit -> Int)), of course. 01:46:41 But perhaps an int variable is best seen as an object that can be gotten and set an unlimited number of times. 01:46:55 But then I suppose that really, an int variable ought to be destroyed exactly once. 01:49:51 -!- Sprocklem has quit (Ping timeout: 252 seconds). 01:53:12 Someone claimed that Rebol PARSE and Parsec are in the same class 01:53:46 What's Rebol PARSE? 01:54:13 A DSL that Rebol comes with for parsing 01:54:50 http://www.red-lang.org/2013/11/041-introducing-parse.html 02:04:07 Hmm, this is the first time I've heard of Rascal 02:04:33 Or... hmm, looks familiar, just the page I mean 02:08:18 The full BF impl is 404ed 02:08:18 :( 02:09:01 Night, all. 02:09:05 -!- tswett has quit (Quit: Page closed). 02:14:27 -!- SirCmpwn_ has joined. 02:15:00 -!- SirCmpwn has quit (Ping timeout: 272 seconds). 02:16:19 -!- SirCmpwn_ has changed nick to SirCmpwn. 02:19:02 In order to do closures in Rebol you need to specify that the environment you're closing on (if a function) is a closure when you define it 02:19:16 :/ 02:20:15 «@me_irl: i'm going to have a "for dummies" series of technical guides but with names like From Hell's Heart I Stab At... Microsoft SQL» 02:25:14 -!- yorick has quit (Read error: Connection reset by peer). 02:26:43 kmc: http://www.rebol.com/r3/docs/concepts/modules-loading.html 02:26:55 Check out the section "Validating modules with a hash checksum" 02:27:23 Seems more thoughtful than you'd expect from a language that's ok with running code directly from the Internet 02:29:01 cool 02:32:06 Lots of languagesw are fine with that. 02:32:13 I mean, curl | sh is an idiom, right? 02:32:38 well, i for one don't think of shell as "thoughtful" 02:33:14 a thoughtful, minimalist, artisinal shell, done right 02:33:23 a shell that celebrates craftsmanship 02:33:23 hand-crafted 02:33:39 "the slow fourier transform movement" 02:37:21 transforming while you eat carefully prepared food and watch the next norwegian real-time documentary on grass growing. 02:37:42 (no, i don't think that documentary has been made yet, although it's inevitable.) 02:38:07 i'm sick of documentaries about grass growing, i want a gritty antihero drama about grass growing 02:38:12 ...... probably been done fsvo "grass" 02:38:18 developmental biology is cool :< 02:38:55 i mean, just focusing a camera on it isn't going to be any better than focusing a camera on hitler as he goes on and on about music 02:43:01 -!- boily has quit (Ping timeout: 272 seconds). 02:43:02 -!- metasepia has quit (Ping timeout: 240 seconds). 02:44:56 -!- Phantom_Hoover has quit (Read error: Connection reset by peer). 02:51:04 "A function that is used as an infix operator. Examples are +, -, [bad-link:functions/z-gtb-lt.txt] and /." 02:51:52 dee 02:51:52 p 03:09:29 -!- Sprocklem has joined. 03:41:30 -!- {C} has quit (Ping timeout: 252 seconds). 03:53:13 -!- Sorella has quit (Quit: It is tiem!). 04:03:52 -!- conehead has quit (Quit: Computer has gone to sleep.). 04:16:08 are there fullwidth versions of æ and Æ and such? 04:17:30 Doesn't seem to be. 04:17:35 :'( 04:17:44 also they should have them for ☹ and ☺ 04:18:22 Bike: I would buy From Hell's Heart I Stab At Microsoft SQL 04:19:16 So would many of my coworkers. 04:19:31 I've never dealt with microsoft sql ... is it bad? 04:19:33 Bike: also I was confused about the weird way you were quoting yourself, before I figured it out 04:19:38 olsner: it's software, so yes 04:19:44 Yup. 04:19:54 Microsoft somehow is amazing at hardware. 04:20:26 i wasn't quoting myself 04:20:30 pikhq: I think it's because they don't make it themselves 04:20:41 i don't joke 04:20:59 Bike is serious like a heart attack 04:23:28 sneak attack, bike 04:32:20 -!- mauke has quit (Disconnected by services). 04:32:30 -!- mauke has joined. 04:34:36 -!- preflex_ has joined. 04:34:38 -!- preflex has quit (Ping timeout: 240 seconds). 04:35:01 -!- preflex_ has changed nick to preflex. 04:36:06 -!- tromp has quit (Remote host closed the connection). 04:36:38 -!- tromp has joined. 04:41:11 -!- tromp has quit (Ping timeout: 252 seconds). 04:43:31 til there's a band named The Internet 04:55:23 -!- FreeFull has quit (*.net *.split). 04:56:11 but still no Main Page? 04:57:10 -!- FreeFull has joined. 04:57:48 afaik 04:57:55 larry page should have a kid and name them Main Page 04:58:11 -!- FreeFull has changed nick to Guest1649. 04:58:21 itt we recommend people how to get sued by their kids 04:59:32 i know at least one person who named their kid after an anime character, the future is weird 04:59:51 i know siblings named Zarathustra and Galadriel 05:02:36 hm my hands are covered in glitter 05:07:30 -!- myndzi has quit (Ping timeout: 245 seconds). 05:07:38 -!- TodPunk has quit (Read error: Connection reset by peer). 05:08:12 -!- TodPunk has joined. 05:13:21 -!- myndzi has joined. 05:14:46 kmc: i can disconfirm that saying Zarathustra and Galadriel causes this effect in general hth 05:14:54 (darn) 05:25:05 -!- oerjan has quit (Quit: Najt). 05:34:15 -!- Sprocklem has quit (Ping timeout: 252 seconds). 05:39:07 -!- tromp has joined. 06:03:41 -!- oklopol has quit (Read error: Connection reset by peer). 06:04:33 -!- oklopol has joined. 06:05:04 so i switched from xp to linux mint since it's going to explode soon, and since i had some trouble getting internet to work in chile 06:05:22 now every morning starts with 10 minutes of waiting for it to wake up or with a restart 06:06:08 is this a particularly bad linux or is xp just a particularly good os? 06:07:14 (to be fair, apart from the morning sickness, this is much faster than xp) 06:07:47 computers are often tested and made to work with windows, less often with linux 06:10:28 yeah this is not even one of the few linuxes they list on their webpage 06:10:36 i mean the manufacturer or whatevererer 06:11:01 -!- tromp has quit (Ping timeout: 272 seconds). 06:11:04 it's a lenovo thinkpad and i was a bit skeptical how well linux would work because they seemed to have made some hacks on top of windows 06:11:31 thinkpads have pretty good linux support generally 06:11:40 because for example the list of available networks was always empty, and instead you used this magical black thinkpad window to connect 06:11:50 did you check out thinkwiki for your model 06:11:55 nope 06:12:20 holy crap there's a wiki dedicated to this. 06:12:27 why do i ever do anything without asking here first 06:13:03 (or googling) 06:15:29 (although it's a bit hard to google much when the reason you are installing linux is that you cannot access the internet) 06:15:34 (or ask here) 06:15:40 (or fucking live?!?!?) 06:16:28 it's annoyingly common that the first thing you need internet for is downloading network drivers 06:20:19 god, yes. 06:20:33 * Bike spent a whole day doing so gggghggh 06:20:38 good thing we all have backup computers eh 06:26:37 fun fact: Eureka (the tv series) had a cure for the common cold, but allegedly it was simply too expensive to make 06:27:27 whoa, whoa, whoa, new catsters videos 06:27:47 whoa, whoa, whoa! what are catsters videos? 06:28:39 http://www.youtube.com/user/TheCatsters 06:40:49 If "waiting for it to wake up" means some sort of suspend mode, those are often remarkably flaky on Linux. 06:41:15 I don't think I've personally ever had a laptop with an entirely working suspend-resume behavior in Linux. 06:44:44 Do you mean suspend-to-disk or just regular suspend? 06:56:05 -!- tromp has joined. 07:00:16 Either, really. But maybe suspend-to-disk has been slightly more reliable, IME. 07:00:33 regular suspend works fine for me 07:00:48 and also worked fine on N previous laptops 07:00:49 Some people just have all the luck, I guess. 07:02:35 i do keep a rabbit's foot in the same bag i put the computer in 07:03:36 it is connected to a rabbit 07:03:45 the previous two statements are false 07:14:10 -!- pikhq has quit (Ping timeout: 245 seconds). 07:16:06 -!- Guest1649 has quit. 07:28:31 -!- tromp has quit (Ping timeout: 260 seconds). 08:24:43 fizzie: i don't have any suspend mode 08:24:56 not even anything resembling a screensaver 08:37:00 it just gets lonely i guess 08:39:44 -!- pikhq has joined. 08:40:27 -!- rodgort` has quit (Ping timeout: 264 seconds). 08:41:57 -!- rodgort has joined. 09:13:26 -!- MindlessDrone has joined. 09:23:41 -!- {C} has joined. 09:42:24 -!- {C} has quit (Ping timeout: 265 seconds). 10:07:42 -!- Sorella has joined. 10:20:19 -!- impomatic has quit (Ping timeout: 260 seconds). 11:11:35 -!- impomatic has joined. 11:29:04 -!- LinearInterpol has joined. 11:35:31 -!- Taneb has changed nick to Maybe. 11:35:37 -!- Maybe has changed nick to Taneb. 11:55:11 -!- Zerker has joined. 11:55:39 -!- impomatic has quit (Ping timeout: 252 seconds). 11:58:43 -!- conehead has joined. 12:06:09 -!- Zerker has quit (Quit: Colloquy for iPad - Timeout (10 minutes)). 12:06:52 -!- yorick has joined. 12:17:32 -!- conehead has quit (Quit: Computer has gone to sleep.). 12:18:34 -!- Taneb has quit (Read error: Connection reset by peer). 12:19:13 -!- clog has quit (Ping timeout: 246 seconds). 12:20:03 The Awful Games Done Quick part is up. Next up: Attack of the Killer Tomatoes and E.T. http://de.twitch.tv/speeddemosarchivesda 12:25:54 -!- LinearInterpol has quit (Ping timeout: 265 seconds). 12:37:26 -!- pikhq has quit (Ping timeout: 264 seconds). 12:47:48 -!- Taneb has joined. 12:51:54 -!- LinearInterpol has joined. 12:57:46 -!- conehead has joined. 13:01:59 -!- Sgeo has quit (Read error: Connection reset by peer). 13:03:20 -!- boily has joined. 13:05:04 good unidling morning! 13:06:10 What sort of a dling is a uni-dling? 13:07:19 it's the Whole Entire Uni-Versal Dling of Them All. 13:10:51 -!- mtve has joined. 13:13:33 -!- metasepia has joined. 13:39:19 -!- conehead has quit (Quit: Computer has gone to sleep.). 13:41:04 -!- tromp has joined. 13:42:30 -!- tromp has quit (Remote host closed the connection). 13:43:04 -!- tromp has joined. 13:46:58 -!- Sorella has quit (Ping timeout: 265 seconds). 13:47:39 -!- tromp has quit (Ping timeout: 272 seconds). 13:51:55 -!- Sorella has joined. 14:30:21 -!- clog has joined. 14:59:35 -!- nooodl has joined. 15:05:13 -!- mrhmouse has joined. 15:30:09 Shaun! http://youtu.be/0t0uCWjQ6Og 15:30:39 shaun, as in the sheep of the same name? 15:32:09 -!- LinearInterpol has quit (Ping timeout: 272 seconds). 15:39:04 -!- AnotherTest has joined. 15:52:54 -!- HackEgo has quit (Ping timeout: 252 seconds). 15:54:07 -!- esowiki has joined. 15:54:11 -!- esowiki has joined. 15:54:12 -!- esowiki has joined. 16:00:08 -!- esowiki has joined. 16:00:12 -!- esowiki has joined. 16:00:12 -!- esowiki has joined. 16:00:29 -!- glogbot has joined. 16:00:32 -!- HackEgo has joined. 16:06:08 -!- esowiki has joined. 16:06:12 -!- esowiki has joined. 16:06:13 -!- esowiki has joined. 16:06:53 -!- esowiki has joined. 16:06:58 -!- esowiki has joined. 16:06:58 -!- esowiki has joined. 16:07:10 -!- glogbot has joined. 16:08:37 :( 16:08:37 -!- Guest96869 has quit (Ping timeout: 265 seconds). 16:09:45 -!- Phantom__Hoover has joined. 16:10:01 I found a shop that sells typewriter ribbon so I bought some but it isn't compatible with my typewriter 16:11:45 An excellent video in which a professional corrects some common misunderstandings about digital audio. (Those 192 kHz/24 bit music downloads are just a waste of disk space.) http://xiph.org/video/vid2.shtml 16:12:12 -!- Effilry has joined. 16:12:24 -!- LinearInterpol has joined. 16:18:27 -!- mroman_ has changed nick to mroman. 16:20:50 quintopia: I watched it during the holidays. it was an ok movie. 16:21:02 Taneb: buy a new typewriter? 16:23:32 boily: :\ but it's hilarious! 16:25:29 oh, a simon pegg movie I haven't seen 16:29:03 boily, expeeensiiiiibe 16:29:12 *-ve 16:30:24 that much? I don't know what's the average MSRP for a middle-end typewriter? 16:30:42 s?\?$?.? 16:35:50 No idea 16:35:59 But I got this one for £5 at a charity shop 16:37:17 -!- drlemon has quit (Ping timeout: 252 seconds). 16:48:30 -!- Gregor has joined. 16:51:44 -!- Effilry has changed nick to FireFly. 16:57:05 -!- Phantom__Hoover has quit (Ping timeout: 252 seconds). 17:00:31 -!- SirCmpwn has quit (Max SendQ exceeded). 17:00:42 -!- SirCmpwn has joined. 17:07:10 -!- qlkzy_ has changed nick to qlkzy. 17:10:41 -!- Phantom__Hoover has joined. 17:10:57 -!- Sprocklem has quit (Ping timeout: 258 seconds). 17:28:26 -!- sebbu2 has quit (Read error: Connection reset by peer). 17:28:56 -!- sebbu has joined. 17:29:30 -!- sebbu has quit (Changing host). 17:29:30 -!- sebbu has joined. 17:30:48 I am feeling very stupef now. 17:30:49 Ordered a replacement DVD drive, because the old one had started to make this every-now-and-then-about-once-a-day series of seeking/"bootup" noises (even with no disc), and no longer read anything. 17:30:54 The new drive arrived today; after opening up the box to install it, discovered that the SATA data cable was kinda-sorta half-loose. 17:30:57 After plugging that in, the old drive seems to work just fine. :/ 17:46:26 -!- LinearInterpol has quit (Ping timeout: 264 seconds). 17:54:03 Damn :( Well, now you can watch _two_ DVDs! 17:55:43 Actually I was thinking I'm going to take advantage of the guaranteed 14-day for-free return period for internet shopping. But I'm still a bit ashamed to be wasting the shop's money. 17:56:51 Oh well. I bought my last graphics card from them, let's hope it had enough of a profit margin to cover mailing a small box around a bit. 18:01:31 -!- Phantom__Hoover has quit (Ping timeout: 252 seconds). 18:02:09 this orange juice is enriched with "one of the most studied species of bacteria" 18:02:22 (luckily not e. coli) 18:03:09 "this tea is enriched with one of the most studied species of microscopic flatworm" 18:03:29 -!- tswett has joined. 18:03:35 So what's with Chu spaces? 18:04:14 C h u 18:06:00 *audience laughter* 18:06:19 -!- ais523 has joined. 18:11:15 Whoa, what? This says bottom times bottom is top. 18:13:45 quintopia: I'm not a fussy eater, I'll gladly eat just about anything, and drink stuff that may have been somewhat liquid in its distant past but now evolved to a new phase, but... flatworms??? 18:17:15 oh. you were being biologically sarcastic. 18:17:56 -!- Bike has quit (Ping timeout: 252 seconds). 18:19:31 -!- Bike has joined. 18:19:56 * boily ties Bike to a hopefully stable connection 18:21:48 -!- LinearInterpol has joined. 18:27:01 ~metar CYUL 18:27:01 CYUL 091800Z 26008KT 15SM FEW030 M09/M16 A3059 RMK SC1 SC TR SLP361 18:28:53 ~metar EFHK 18:28:53 EFHK 091820Z 06003KT 9999 FEW015 BKN023 03/02 Q0997 NOSIG 18:29:25 ~metar VHDK 18:29:26 --- Station not found! 18:29:45 ~metar KLHS 18:29:45 --- Station not found! 18:29:56 ~metar LMCP 18:29:57 --- Station not found! 18:30:07 ~metar ICMP 18:30:08 --- Station not found! 18:30:27 ~metar TLHA 18:30:27 --- Station not found! 18:30:34 ~metar OBLC 18:30:34 --- Station not found! 18:30:59 I now have statistically significant evidence that if I ~metar an arbitrary string of four letters, there's less than a 50% chance I'll have hit a real station. 18:31:52 ~metar ZUUU 18:31:52 ZUUU 091800Z 02005MPS 7000 SCT050 06/02 Q1023 NOSIG 18:34:18 -!- impomatic has joined. 18:38:21 Eh? I asked Wolfie for a confidence interval, with a confidence level of 0.95, given a sample size of 5 and a sample proportion of 0. 18:38:43 It says the actual chance of hitting a real station is probably less than 2.2*10 18:38:54 2.2*10^-308. 18:39:13 (The actual chance of hitting a real station is certainly less than 2.2*10.) 18:40:08 > 26^4 18:40:09 456976 18:41:01 boily: also the fact that C. elegans is awesome (or is that a roundworm?) 18:41:58 yes, that's a roundworm 18:43:29 oh, c. elegans caused a nobel prize, that's not bad for a wee roundworm 18:43:48 Okay, Clopper-Pearson gives a more realistic answer. It says the probability is probably at most 0.5218. 18:44:37 Jeffreys says it's probably at most 0.3794. Oddly, it also says it's probably at least 9.342*10^-5. 18:44:38 -!- LinearInterpol has quit (Ping timeout: 264 seconds). 18:46:56 `quote statistics 18:46:58 608) Yeah, statistics with 2 data points is science. Statistics with one data point is crap. You measure a third point if you need an error estimate. \ 1130) everything is either zipf, branford, poisson, gamma, or uniform. outside of that, it's a weird curve invented by sadistic statistics teachers. 18:47:38 Statistics with one data point is mathematics. 18:48:05 If I pick a random person from the world population, and that person is female, I can conclude that there exists at least one female. 18:49:09 I find that conclusion presumptuous, you vile cishet male! check your privileges! 18:51:07 (meanwhile, I received the manga I ordered! :D) 18:52:16 -!- tswett has quit (Quit: Page closed). 18:52:35 boily: dumb 18:52:53 elliott: what am I dumbing? 19:01:53 * boily , undertaking great risks with such a dangerous gesture, mapoles elliott 19:08:59 -!- stuntaneous has joined. 19:12:26 `relcome stuntaneous 19:12:29 ​stuntaneous: 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.) 19:12:52 `ello stuntaneous 19:12:54 hellstuntaneous 19:13:07 sure, close enough 19:21:11 -!- impomatic has quit (Ping timeout: 260 seconds). 19:27:50 -!- LinearInterpol has joined. 19:28:00 is there a shm-script? 19:28:41 like s/([^aeiou]+)(.*)/\1\2 shm\2/ 19:29:33 -!- impomatic has joined. 19:30:58 boily: i find it strange that your list of common continuous distributions did not include normal 19:31:07 `run echo -e '#!/bin/sh\nsed -e \'s/([^aeiou]+)(.*)/\1\2 shm\2/\' "$@"' >bin/shmify 19:31:09 bash: -c: line 0: syntax error near unexpected token `(' \ bash: -c: line 0: `echo -e '#!/bin/sh\nsed -e \'s/([^aeiou]+)(.*)/\1\2 shm\2/\' "$@"' >bin/shmify' 19:31:32 quintopia: it's something that irks me to no end, to have a statistics `quote without that PDF. 19:31:41 also, there needs to be ^ and $ 19:31:43 -!- Sprocklem has joined. 19:32:02 ^([^aeiou]+)(.*)$ 19:32:07 myname: please do it. my '"'"'"'-fu is weak today. 19:32:10 -!- LinearInterpol has quit (Ping timeout: 246 seconds). 19:32:26 erm 19:33:42 boily: \ in ' does nothing, so \' is a literal backslash and the end of the quoted string 19:34:46 fun way to put a literal ' in a '-quoted string: '"'"' 19:34:59 oh dear 19:35:13 that's even worse than what visual basic does 19:36:19 ('\'' might be more readable, but less fun) 19:37:38 `run echo -e '#!/bin/sh\nsed -e '"'"'s/^([^aeiou]+)(.*)$/\1\2 shm\2/'"'"' "$@"' >bin/shmify 19:37:42 `run echo -e '#!/bin/sh\nsed -e '"'"'s/^([^aeiou]+)(.*)$/\1\2 shm\2/'"'"' "$@"' >bin/shmify 19:37:45 No output. 19:38:03 `run shmify baby 19:38:05 bash: /hackenv/bin/shmify: Permission denied 19:38:11 ~~ 19:38:11 --- Possible commands: dice, duck, echo, eval, fortune, metar, ping, yi 19:38:27 `shmify baby 19:38:28 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: /hackenv/bin/shmify: Permission denied \ /home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: /hackenv/bin/shmify: cannot execute: Permission denied 19:38:42 `run chmod 0755 bin/shmify 19:38:45 No output. 19:38:51 `shmify mogrify 19:38:52 sed: -e expression #1, char 31: invalid reference \2 on `s' command's RHS 19:39:04 what 19:41:22 -!- impomatic has quit (Ping timeout: 245 seconds). 19:42:22 hmm, "$@" as an argument to sed? did you mean echo | sed, or should it be used like \? "$@" | shmify? 19:47:14 hmm, maybe 19:52:50 -!- impomatic has joined. 19:59:44 Would the regex for all the names of Ghaddafi be ^[^qgk]h?add?h?af?fi$ 20:00:02 there's a stacoverfluw qusetion about that 20:00:05 can't be bothered to spell sorry 20:00:31 http://stackoverflow.com/questions/5365283/regular-expression-to-search-for-gadaffi 20:00:35 Indeed there is 20:01:13 \b[KGQ]h?add?h?af?fi\b 20:01:26 Yesss 20:01:30 Perfect score 20:02:23 but are all combinations for each choice valid, or are there just three or something different transliteration schemes? 20:03:38 I doubt that "Qhaddhaffi" gets much use, but if it ever appeared at all, I expect it would be Gadaffi. 20:03:44 hmm, not that people would follow any given scheme consistently anyway 20:04:02 olsner : http://abcnews.go.com/blogs/headlines/2009/09/how-many-different-ways-can-you-spell-gaddafi/ 20:04:10 Apparently Kaddafi just did not give a fuck 20:04:28 Qadthafi 20:04:30 whaaat 20:05:25 oh, and are there many spellings in arabic too, or is there a single correct original spelling? 20:06:50 -!- stuntaneous has quit (Ping timeout: 264 seconds). 20:07:29 `unidecode القذافي 20:07:31 ​[U+0627 ARABIC LETTER ALEF] [U+0644 ARABIC LETTER LAM] [U+0642 ARABIC LETTER QAF] [U+0630 ARABIC LETTER THAL] [U+0627 ARABIC LETTER ALEF] [U+0641 ARABIC LETTER FEH] [U+064A ARABIC LETTER YEH] 20:08:02 qaf thal? 20:08:11 oh right. vowels. 20:10:02 I think those are the names of the letters, not the pronunciation 20:10:31 so... qthafy? 20:11:04 al-qafthalaleffehyeh. ← I prefer that version. 20:21:52 -!- Bike has quit (Ping timeout: 246 seconds). 20:23:41 -!- Bike has joined. 20:29:44 -!- nortti has changed nick to minirrti. 20:29:56 -!- minirrti has changed nick to nortti. 20:52:37 -!- Sprocklem has quit (Ping timeout: 252 seconds). 21:15:35 -!- AnotherTest has quit (Ping timeout: 252 seconds). 21:25:58 -!- MindlessDrone has quit (Quit: MindlessDrone). 21:30:28 -!- boily has quit (Quit: CHICKEN ALIGNMENT!). 21:30:31 -!- metasepia has quit (Remote host closed the connection). 21:40:31 -!- mrhmouse has quit (Quit: Leaving.). 21:41:57 -!- mrhmouse has joined. 21:42:08 -!- mrhmouse has quit (Client Quit). 21:54:43 Are there any command line tools or python libraries or similar to easily extract data from HTML pages. Lets say, finding new posts on some web site without RSS feeds, that sort of stuff. 21:55:15 I don't particlarly enjoy parsing HTML, and I doubt an XML parser would like this particular HTML either 21:56:23 Beautiful Soup is a good Python library for web scraping 21:57:03 it deals with the kind of terrible HTML found in the wild 21:57:14 the other approach I would suggest is PhantomJS / CasperJS, which runs a real (headless) WebKit browser instance and lets you interrogate it with javascript 21:57:29 that lets you scrape even very dynamic sites 22:04:44 -!- tromp has joined. 22:05:07 kmc, thanks 22:05:50 -!- tromp has quit (Read error: Connection reset by peer). 22:06:05 I'll avoid the js path if possible since I don't really know js all that well 22:06:13 -!- tromp has joined. 22:06:52 looks like you can use PhantomJS from Python as well: http://www.realpython.com/blog/python/headless-selenium-testing-with-python-and-phantomjs/#.Us8db5WVthE 22:07:36 JavaScript is a fairly shitty language but it's also simple, especially if you're just writing "scripts" and not trying to architect a large application 22:08:02 my main advice is to get a program like jslint or jshint and pay attention to its warnings, even if you end up disabling some 22:08:34 Basically I discovered that the feeds provided by youtube behind the scenes (not easy to find) lags behind, and the web site I normally used (youtube video deck) recently started missing a few posted videos. And do not even speak of the subscription list on youtube, it is terrible. I haven't seen the channel pages fail though 22:09:08 So my plan is to scrape them for all my subscriptions and diff the result (plus add in some system to mark videos as watched) 22:09:49 Then I'll probably throw this up on my nginx web server running on my RPi so I can use it from my tablet as well. 22:10:45 Not sure how to best do the page generation on the RPi though... cron script is probably easiest? 22:11:08 if you run nginx on an RPi does it become an ЯPi 22:12:10 good point 22:12:18 thx 22:12:38 I run ssh, nfs, samba, ipv6 tunnel, openvpn tunnel and a few other things on it too 22:12:55 512 MB RAM goes a long way when you don't use a GUI 22:13:57 yep 22:16:01 -!- ^v has joined. 22:18:53 -!- tswett has joined. 22:19:04 Hey guys. 22:20:15 So it seems like first-order logic is a lot more popular than second-order logic. Why is this? Is it because of its simplicity and Gödel's completeness theorem? 22:21:15 -!- Phantom__Hoover has joined. 22:39:04 -!- oerjan has joined. 22:39:24 -!- tromp has quit (Ping timeout: 272 seconds). 22:55:34 -!- ais523 has quit. 22:58:31 kmc, wrt js being for scripts, so is python to quite a large degree 23:04:04 `cat bin/shmify 23:04:05 ​#!/bin/sh \ sed -e 's/^([^aeiou]+)(.*)$/\1\2 shm\2/' "$@" 23:04:34 `shmify maechtig 23:04:35 sed: -e expression #1, char 31: invalid reference \2 on `s' command's RHS 23:04:55 i was wondering about that 23:06:05 `cat bin/thanks 23:06:06 ​#!/usr/bin/perl \ $_ = (join " ", @ARGV) || `words`; s/^\s+|\s+$//g; print "Thanks, $_. "; if (/[aeiouyAEIOUY]/) { s/^[^aeiouyAEIOUY]*/Th/; } else { s/^./T/; } print "$_."; 23:06:20 hm different method. 23:07:13 `run echo sed | sed -e 's/^([^aeiou]+)(.*)$/\1\2 shm\2/' 23:07:14 sed: -e expression #1, char 31: invalid reference \2 on `s' command's RHS 23:07:23 `run echo sed | sed -e 's/^([^aeiou]\+)(.*)$/\1\2 shm\2/' 23:07:25 sed: -e expression #1, char 32: invalid reference \2 on `s' command's RHS 23:07:33 `run echo sed | sed -e 's/^([^aeiou]+)(.*)$/\1\2 shm/' 23:07:34 sed: -e expression #1, char 29: invalid reference \2 on `s' command's RHS 23:07:52 `run echo 's/^([^aeiou]\+)(.*)$/\1\2 shm\2/' 23:07:54 s/^([^aeiou]\+)(.*)$/\1\2 shm\2/ 23:08:47 `run echo sed | sed -e 's/^([^aeiou]+)(.*)$/\1/' 23:08:48 sed: -e expression #1, char 23: invalid reference \1 on `s' command's RHS 23:08:56 `run echo sed | sed -e 's/^\([^aeiou]\+\)\(.*\)$/\1\2 shm\2/' 23:08:58 sed shmed 23:09:27 ah it was all that non-perly syntax 23:09:49 `cat bin/shmify 23:09:50 ​#!/bin/sh \ sed -e 's/^([^aeiou]+)(.*)$/\1\2 shm\2/' "$@" 23:09:51 Vorpal: I didn't say that either is "for scripts" 23:09:58 I said that there's less to learn if you're only using them for scripts 23:10:02 that's probably true of any language 23:10:11 that "$@" is also obviously wrong. 23:10:21 but it's especially true of JavaScript, because the design patterns for large applications are just design patterns and not things built into the language 23:11:30 `run (echo '#!/bin/bash'; echo 'echo "$@" | sed -e '\''s/^\([^aeiou]\+\)\(.*\)$/\1\2 shm\2/'\'' >bin/shmify 23:11:31 bash: -c: line 0: unexpected EOF while looking for matching `'' \ bash: -c: line 1: syntax error: unexpected end of file 23:11:35 `run (echo '#!/bin/bash'; echo 'echo "$@" | sed -e '\''s/^\([^aeiou]\+\)\(.*\)$/\1\2 shm\2/'\'') >bin/shmify 23:11:36 bash: -c: line 0: unexpected EOF while looking for matching `'' \ bash: -c: line 1: syntax error: unexpected end of file 23:12:00 `run (echo '#!/bin/bash'; echo 'echo "$@" | sed -e '\''s/^\([^aeiou]\+\)\(.*\)$/\1\2 shm\2/'\') >bin/shmify 23:12:04 No output. 23:12:12 `shmify fnord 23:12:13 fnord shmord 23:12:58 `shmify maechtig 23:12:59 maechtig shmaechtig 23:13:22 `shmify oerjan 23:13:23 oerjan 23:13:51 `run (echo '#!/bin/bash'; echo 'echo "$@" | sed -e '\''s/^\([^aeiou]*\)\(.*\)$/\1\2 shm\2/'\') >bin/shmify 23:13:53 `shmify oerjan 23:13:55 No output. 23:13:56 oerjan shmoerjan 23:14:51 yeah i was also thinking it should be * 23:14:54 -!- LinearInterpol has joined. 23:19:47 that's probably true of any language <-- well yeah 23:20:57 good night 23:21:15 'night 23:29:02 -!- FreeFull has joined. 23:35:33 -!- tromp has joined. 2014-01-10: 00:00:35 -!- ^v has quit (Quit: http://i.imgur.com/MHuW96t.gif). 00:09:03 -!- tromp has quit (Ping timeout: 272 seconds). 00:10:59 -!- w00tles has joined. 00:12:04 -!- Sgeo has joined. 00:33:39 Vorpal: finished Botanicula (is trying to collect all cards worthwhile? I got 115/123) 00:34:42 Anyway, fun little game. 00:36:26 -!- nooodl has quit (Quit: Ik ga weg). 01:04:18 Never mind, aunt Google says that 3 boxes is all. So it's just the cards themselves. 01:05:28 -!- tromp has joined. 01:21:14 -!- Bike has quit (Ping timeout: 264 seconds). 01:22:49 -!- Bike has joined. 01:30:38 -!- Phantom__Hoover has quit (Quit: Leaving). 01:36:25 -!- tromp has quit (Remote host closed the connection). 01:36:38 -!- tromp has joined. 01:36:41 -!- tromp has quit (Read error: Connection reset by peer). 01:37:08 -!- tromp has joined. 01:37:19 -!- Bike has quit (Ping timeout: 260 seconds). 01:37:57 -!- Sorella has quit (Quit: It is tiem!). 01:39:12 -!- Bike has joined. 01:41:42 i am trying my hand at reading driver source. this may have been a mistake 01:43:24 http://www.skbuff.net/ eg 01:43:43 -!- pikhq has joined. 02:10:33 -!- Bike has quit (Ping timeout: 272 seconds). 02:11:30 -!- Sprocklem has joined. 02:11:55 -!- Bike has joined. 02:27:37 -!- LinearInterpol has quit (Ping timeout: 245 seconds). 02:56:50 -!- yorick has quit (Remote host closed the connection). 03:09:49 -!- Bike has quit (Ping timeout: 272 seconds). 03:10:35 -!- Bike has joined. 03:16:22 -!- ^v has joined. 03:22:05 -!- FreeFull has quit (Remote host closed the connection). 03:26:44 -!- conehead has joined. 03:35:31 -!- Bike has quit (Ping timeout: 272 seconds). 03:37:13 -!- Bike has joined. 03:51:41 -!- tswett has quit (Quit: Page closed). 03:52:40 -!- Bike has quit (Ping timeout: 246 seconds). 03:54:41 -!- Bike has joined. 04:02:38 -!- Bike has quit (Ping timeout: 264 seconds). 04:14:01 `quote 04:14:02 50) So... copyright doesn't really apply to God. 04:14:05 `quote 04:14:06 306) Top universities now employ people to watch infomercials all day to find the latest mysteries. 04:14:10 `quote 04:14:11 564) l;le;ler;le;lr;e;ler;ler;le;lerr;le;le;erle;e;rler;lere;er;lerrelrrerererlanggt 04:14:13 `quote 04:14:14 726) elliott: Apparently Rowan Williams is Primate of All England. CHECKMATE CREATIONISTS 04:14:16 `quote 04:14:17 182) Maybe they should just get rid of Minecraft. If more people want it someone can make using GNU GPL v3 or later version, with different people, might improve slightly. 04:31:06 -!- mauke has quit (Disconnected by services). 04:31:16 -!- mauke has joined. 04:32:18 -!- conehead has quit (Quit: Computer has gone to sleep.). 04:33:12 -!- preflex has quit (Ping timeout: 260 seconds). 04:33:31 -!- preflex_ has joined. 04:33:56 -!- preflex_ has changed nick to preflex. 04:35:11 -!- ^v has quit (Remote host closed the connection). 04:55:52 -!- qlkzy has quit (Quit: ZNC - http://znc.sourceforge.net). 04:56:22 -!- qlkzy has joined. 04:56:36 -!- elliott has quit (Ping timeout: 260 seconds). 05:17:19 -!- tromp has quit (Remote host closed the connection). 05:17:56 -!- tromp has joined. 05:22:41 -!- tromp has quit (Ping timeout: 265 seconds). 05:25:01 -!- copumpkin has quit (Remote host closed the connection). 05:25:59 -!- copumpkin has joined. 05:26:01 -!- oklopol has quit (Read error: Connection reset by peer). 05:26:26 -!- oklopol has joined. 05:35:18 -!- oerjan has quit (Quit: leaving). 05:36:40 -!- elliott has joined. 05:37:04 -!- elliott has changed nick to Guest38863. 05:37:36 -!- Guest38863 has quit (Client Quit). 05:37:48 -!- elliott_ has joined. 05:45:07 -!- Sprocklem has quit (Ping timeout: 245 seconds). 05:46:32 -!- prooftechnique has joined. 06:42:27 Rebol seems... unsafe 06:42:40 In a similar way to Kernel, except possibly worse 06:56:08 -!- tertu has joined. 07:10:44 apparently england has a new primate 07:13:59 -!- tertu has quit (Quit: Leaving). 07:15:47 Someone or some animal was born there??? 07:16:04 i'm a primate 07:16:13 primate' 07:37:16 -!- tromp has joined. 07:42:55 -!- tromp has quit (Ping timeout: 252 seconds). 08:09:45 -!- LinearInterpol has joined. 08:45:05 -!- LinearInterpol has quit (Ping timeout: 252 seconds). 08:49:16 -!- elliott_ has changed nick to elliott. 08:54:39 -!- prooftechnique has quit. 09:01:47 " We don't tell someone to take out the garbage and then they shoot the cat if you don't say "Oh... wait... I meant ONLY take out the garbage"!" 09:31:05 Sgeo: what are those? they're not on the wiki 09:32:23 Not sure the best URL to link for Rebol 09:32:34 Kernel: http://web.cs.wpi.edu/~jshutt/kernel.html 09:32:47 http://en.wikipedia.org/wiki/Rebol 10:19:11 "I'm submitting a patch where basically every function has /only. If you don't specify it, it will open a pop up window that plays Tetris." 10:33:54 wait, so rebol isn't actually an esolang? so that's why it wasn't on the wiki! 10:35:01 yes 10:35:25 Instead it's on the other wiki 10:45:42 I can't get the Rebol Core War to run :-( 10:45:59 ** Script Error: Invalid path value: 1 ** Where: redrag ** Near: pane/1/size: val: size - (2 * edge/size) :-( 10:48:29 It's here http://akson.sgh.waw.pl/~pg23193/corewars/ also on Github https://github.com/paweu/rebol-corewars 11:16:29 how come everyone seems to think that ioccc 8086 emulator is so amazing? I think it might be nice obfu, but it goes against the ioccc spirit because it stores important data (tables for interpreting instructions) in an aux file outside the source code, thus subverting the code size limit. 11:17:28 hmm, can it emulate other architectures by replacing the data file? 11:17:53 DRM is preventing the Surgeon Simulator speedrun on http://de.twitch.tv/speeddemosarchivesda :-D. The video streaming device they’re using says something like “no signal” when no video output is connected. Now it says “HDCP”. 11:17:59 olsner: of course it can. the data file is a bios, so as long as you can write an emulator of the other arch in x86_16, it can emulate it. 11:18:18 olsner: well, all of it has to fit in less than 1M of memory obviously 11:18:31 but that's easily doable 11:19:19 a BIOS doesn't have to count against the emulator's code size, I think that's reasonable 11:20:47 but "tables for interpreting instructions" doesn't sound like the bios 11:21:13 olsner: exactly, it's not a stock bios, it emulates some of the io devices of the machine too 11:21:26 I got the impression that the "bios" file is still plain 8086 assembly. 11:21:33 fizzie: sure 11:21:51 most of it 11:21:52 So the C code is a proper 8086 CPU emulator. I don't think anyone's begrudging it for not emulating devices. 11:22:05 but it also has tables for decoding the x86 instructions 11:22:09 (Disclaimer: I've only looked at the hint file.) 11:22:10 that's what the hint file claims 11:22:29 Oh, I see. 11:22:35 So there's some look-up tables in there. 11:22:41 I guess that's a little bit shady. 11:23:04 I mean, putting support to an extra file is completely normal for such an emulator, whether in a production or in obfu, but the ioccc is about the size limit 11:23:28 Arguably, it's also about rule abuse. 11:23:51 I think that's definitely against the rules 11:23:53 let me look it up 11:24:05 "Legal abuse of the rules is somewhat encouraged." 11:24:09 That's in the rules. 11:24:40 I tried to look up something more explicit about the source length the other day, but I might've missed something. 11:25:00 hmm 11:25:09 there used to be a rule or guideline saying that the program must work without the info files 11:25:12 but now I can't find it 11:25:14 did they remove that? 11:26:00 here: 11:26:09 in the guidelines, "We really dislike entries that make blatant use of including large data files to get around the source code size limit." 11:26:53 so it's not technically against the rules, 11:27:02 but it's definitely discouraged in the guidelines 11:27:37 Well, it's a value judgement. I guess they liked it otherwise enough. 11:28:06 "Entries that violate the guidelines but remain within the rules are allowed." 11:28:11 Today I have decided to draw 11:28:22 On the basis that if I never draw I will never be able to draw well 11:28:39 fizzie: sure, it's not the ioccc judge's decision that is my problem 11:28:46 it's other people's reaction in twitter 11:29:05 who all claim "a 8086 emulator in 4000something bytes" or similar 11:30:08 "We prefer programs that don't require a fish license for pet fish." I wonder if/how that particular guideline has come up. 11:30:26 mind you, Cable is definitely clever for fooling all those people by hiding the tables this way 11:34:45 -!- LinearInterpol has joined. 11:37:44 Oh, how nasty; matlab-mode in emacs (at least this version) rebinds M-; to "matlab-comment" from comment-dwim, and therefore can't be used to comment-or-uncomment-region if a region is active. 12:16:16 this property name makes me chuckle: browser.safebrowsing.malware.enabled 12:24:24 Who wouldn't want to enable malware. 12:26:14 `run echo '123' | ghc -e 'main=interact$reverse' 12:26:21 ​ \ :1:5: parse error on input `=' 12:26:37 `run echo '123' | ghc -e 'interact$reverse' 12:26:42 ​ \ 321 12:26:46 k. 12:26:48 thanks. 12:33:41 `run echo '@REVERSE\ARG:1' | ploki - 123 12:33:42 321 13:01:03 Has anyone ever created an esolang in front of a live audience 13:01:52 No. 13:02:06 But seeing as most languages were invented in five minutes it can't be that hard to do 13:02:11 given that you have an audience. 13:02:28 Like, with audience participation 13:02:41 In fact, I'm surprised there isn't a metal-tool which can create brainfuck derivatives automatically 13:02:45 *meta-tool 13:02:54 and create an interpreter for it automatically too 13:03:02 -!- boily has joined. 13:03:07 -!- Sgeo has quit (Read error: Connection reset by peer). 13:03:09 -!- metasepia has joined. 13:03:22 "Automatic brainfuck derivatives construction" sounds like an awesome paper . 13:04:06 I may actually do this 13:05:04 tr "$1" '.,+-[]<>' 13:06:54 ook 13:09:10 Taneb: Remember to have it on video. 13:09:21 It will be 13:09:28 But it won't be for a couple of months if it happens 13:09:28 Taneb: Then you can post it online, and it can be a part of the wiki entry of the language. 13:10:01 Well, the next slot is the 20th of February 13:11:53 good breakfast morning! 13:12:44 Right, it looks like it is happening 13:24:45 Taneb: where? 13:34:12 b_jonas, York 13:35:28 I wonder if the audience can prepare suggestions that make your task more difficult 13:36:37 implement it with one hand. 13:48:23 -!- tromp has joined. 13:48:54 -!- Phantom_Hoover has joined. 13:53:57 -!- MindlessDrone has joined. 13:58:13 -!- w00tles has quit (Quit: quit). 14:03:50 -!- tromp has quit (Remote host closed the connection). 14:04:24 -!- tromp has joined. 14:08:51 -!- tromp has quit (Ping timeout: 272 seconds). 14:12:54 -!- yorick has joined. 14:24:16 LinearInterpol: more specifically, I'd like to see suggestions that seem a good idea at first so the presenter can agree to them, but he finds out later that they're making it difficult. 14:24:28 if you suggest something that's obviously hard for him, he might not agree 14:27:03 -!- Bike_ has joined. 14:28:59 -!- mrhmouse has joined. 14:33:21 -!- Bike_ has changed nick to Bike. 14:35:59 -!- tromp has joined. 14:44:55 http://lists.x.org/archives/xorg-announce/2014-January/002389.html hm, this sounds bad 14:45:55 "checked in on 1991/05/10" hahaha 14:47:32 -!- Phantom__Hoover has joined. 14:48:32 Hurray for static code analysis... 14:50:01 -!- Phantom_Hoover has quit (Ping timeout: 272 seconds). 14:53:31 has anyone defined a C++ attribute that sets the color (and font etc) of an identifier for syntax coloring? 14:55:34 like, say, int frobnicate[[syntax_hilite(bold red)]](const char *foo); and then whenever anyone calls that function its name will be shown in bold red. 14:55:57 if the compiler doesn't support this, then you macro syntax_hilite to expand to nothing. 14:58:50 b_jonas: wouldn't syntax highlighting a single word like that vary between editors? 14:59:28 mrhmouse: yes, maybe this should specify a css-like class for syntax hiliting instead which you can match from syntax hilite rules 15:00:16 what I mean is, how would you have it work across all editors? I don't think it would be feasible. 15:00:41 like, int frobnicate[[syntax_hilite(dangerous-function)]](const char *foo); and you'd have a css rule somewhere saying .dangerous-function { color: red; font-weight: bold; } 15:00:42 The editors would opt-in to support it I guess 15:01:03 FireFly: exactly, if your editor doesn't support this you can macro it out to a noop 15:01:46 I think you'd have to expand it to a nop anyways, since the compiler really doesn't care about the text of its source code.. right? 15:02:18 I guess potentially the compiler could use the information for warnings/errors if it wants to 15:02:22 unless you intend for, say, debug messages to highlight that function name 15:02:51 FireFly: beat me to it :) 15:03:23 b_jonas: would the idea be to highlight things that are semantically related using the same colours? 15:03:53 As opposed to highlight based on type or syntax, like editors currently do typically 15:04:54 also, if the idea is that it's just for the editor, why not have the indicator in a comment above the method (or inline with /**/ like your current one)? 15:05:02 FireFly: no, for warnings you have other attributes. some compilers already have attributes for marking deprecated functions, marking functions whose return value you shouldnát ignore, etc. 15:05:34 if you want to combine both, define a macro that does both, like #define mydeprecated deprecated,syntax_hilite(deprecated) 15:05:46 or ask the syntax hiliter to recognize and color deprecated functions 15:05:50 int frobnicate /* !syntax_highlight(danjah-danjah) */ (const char *foo) { ... } 15:05:58 this would be a low-level interface to ask the syntax hiliter and only that 15:06:18 mrhmouse: huh? why magic comments? we already have attribute syntax. (in fact, we have like three different attribute syntaxes.) 15:06:32 mrhmouse: you can't get magic comments from the preprocessor 15:06:51 b_jonas: I meant for when the compiler prints out the line to which a warning/error relates 15:06:53 whereas you can generate identifiers using preprocessor tricks and attach attributes to those 15:06:53 b_jonas: are attributes part of the preprocessor? I not a C++ programmer, sorry 15:07:04 mrhmouse: not the preprocessor 15:07:17 mrhmouse: but the preprocessor passes them through unchanged just like most code 15:07:25 they're part of the compiler syntax 15:07:37 it just seems odd to me to place information about the color of text in the code. 15:07:56 of course it's odd, we're in #esoteric 15:08:02 -!- tromp has quit (Ping timeout: 245 seconds). 15:08:03 imo colorforth 15:08:04 I don't actually like syntax hiliting at all 15:08:27 I prefer plain white over black text, and have the code be clear as is 15:08:34 instead of a hiliter having to parse it for me to understand 15:08:56 but that's a religious debate and some people swear that syntax hiliting is a good idea 15:09:00 well, I like pretty colors because they're shiny. they don't help me parse the text at all. 15:09:55 would an attribute that describes the function be acceptable? like your CSS class idea 15:10:15 mrhmouse: do you mean you like to look at the code in pretty colors, or you like to show the code to managers in pretty colors? 15:10:29 int frobnicate [[describe(dangerous)]] (const char *foo) { ... }; 15:10:48 b_jonas: I don't show code to managers, I show solutions to managers 15:10:50 * FireFly would put himself in the former of those sets 15:10:57 my managers don't read code 15:11:10 mrhmouse: of course, they don't read the code, they look at the pretty colors 15:11:34 b_jonas: I don't think they care about what color it is.. they don't even look at the code, is what I'm saying. 15:11:36 and like I said, I'm asking about a low-level hook for coloring, not a high level one 15:11:46 if you want a high level one, you could define a macro that sets the color and something else 15:12:11 ok, that answers my question, so you like the pretty colors for yoruself 15:12:22 yes :) merely because they are pretty colors. 15:12:50 white text on black is also fine. (bright background hurts my eyes after a while) 15:15:48 I only suggested describing the function with an arbitrary word like that because it's close to your CSS idea but not strictly tied to the display of the text 15:16:09 you could, for instance, have it show an alert to the user or something when they write a call to some such function 15:16:38 I don't know of any low-level coloring hooks :( you can probably find something close that's specific to your editor, though 15:17:48 for marking a function to warn whenever you reference it, that's what the deprecated attribute does in some compilers. 15:18:00 I think you can even give a custom warning. 15:19:50 -!- Sprocklem has joined. 15:27:12 -!- augur has quit (Ping timeout: 276 seconds). 15:35:21 I prefer syntax highlighting 15:35:32 sadly, most editors don't provide smart syntax highlighting :( 15:36:29 Most don't highlight typedefs in C for example 15:36:47 so int is blue, but int32_t isn't. 15:42:29 mroman: http://www.vim.org/scripts/script.php?script_id=2646 15:42:39 if you're a vim user 15:44:24 -!- Bike has quit (Quit: leaving). 15:46:48 mrhmouse: the c highlighting included in vim highlights builtin typedefs like int32_t already 15:49:22 olsner: does it highlight user-defined typedefs? that's what I thought mroman was referring to 15:50:16 it's unlikely, it only does lexical analysis afaik, which means it has no idea which typedefs are defined 15:50:37 "unlikely" ... I know that it doesn't 15:52:27 ah :) I didn't think it did, but I don't really use C beyond occasional bytebeat 16:00:39 Yeah @userdefined typedefs 16:11:05 -!- AnotherTest has joined. 16:12:23 An IDE is supposed to help me. 16:12:54 Ok. vim isn't really an IDE 16:13:04 * boily lightly mapoles mroman 16:13:14 vim is and IDE! 16:13:14 !define mapole 16:13:20 `? mapole 16:13:22 A mapole is a thwackamacallit built from maple according to Canadian standards. 16:13:31 An IDE has auto completion, parameter hints, type info, smart syntax highlighting 16:13:40 browsing through code by clicking on function names and stuff 16:13:48 vim has them all. 16:13:50 otherwise I might as well use nano. 16:14:07 And yes, nano is the crapiest editor I know 16:14:11 maybe ed 16:14:38 so you may replace nano with the carpiest editor you know 16:18:45 -!- nooodl has joined. 16:20:16 I like ed. 16:20:32 yeah, vim has all of that (with plugins). if you don't want to learn vim, I hear emacs has a couple of features. 16:20:45 ed is nice but a bit limited 16:26:49 -!- glogbot has quit (Ping timeout: 272 seconds). 16:26:55 -!- esowiki has joined. 16:26:57 -!- glogbot has joined. 16:27:00 -!- esowiki has joined. 16:27:00 -!- esowiki has joined. 16:34:49 See, that's the thing.. probably the thing I value the most with vim (after the whole modal editor thing) is easy access to shell commands 16:35:16 Piping a selection through an arbitrary shell oneliner is powerful IMO 16:37:31 -!- olsner has quit (Quit: Leaving). 16:47:06 FireFly: it's very powerful. that's what I do to slurp in quotes into the PDF. 16:52:28 -!- conehead has joined. 16:55:25 -!- conehead has quit (Remote host closed the connection). 16:55:46 -!- conehead has joined. 17:08:46 http://en.m.wikipedia.org/wiki/List_of_sexually_active_popes 17:08:50 -!- conehead has quit (Remote host closed the connection). 17:08:59 bah, http://en.wikipedia.org/wiki/List_of_sexually_active_popes 17:09:09 ?? 17:09:17 -!- conehead has joined. 17:13:17 -!- everfreeq has joined. 17:17:19 mroman, needs no further explanation imo 17:19:39 Are there any living sexually active popes 17:21:00 -!- w00tles has joined. 17:22:32 Taneb: "There have been 266 popes. Since 1585, no pope is known to have been sexually active before, during or after election to the Papacy" 17:23:52 Okay 17:24:01 nortti, will you come to my live esolang creation 17:25:38 Please don't it's gonna be awful 17:27:30 hmm, where? 17:27:34 York 17:27:41 when? 17:27:53 TBD, probably 20th of February at 19:30 17:28:03 most probably not 17:28:09 Okay 17:28:15 Anyway, I have an exam to get to 17:28:16 Goodbye! 17:28:20 question. which esolangs have first-class functions with lambda-like syntax that are closure, but only nullary so they don't take arguments? 17:29:08 I know none 17:29:34 if there's none, then that toy interpreter I wrote ages ago that wasn't intended as an esolang is unique in something! 17:29:45 mind you, I did intend to have functions with arguments, just never implemented it 17:30:00 ploki doesn't have functions but they take arguments 17:30:08 heh 17:30:13 how does that work? 17:31:26 there's a unary operator called @OMFG 17:31:42 instead of evaluating its operand, it returns the expression itself 17:31:57 it also replaces all variables in the expression by their current value 17:32:29 the other part is the . infix operator 17:33:11 @OMFG FOO . BAR evaluates FOO, setting the pseudo-constant \@ to the result of BAR 17:33:12 Unknown command, try @list 17:33:27 wait... maybe they weren't closure in that language? 17:33:34 if they weren't, I should make such a language 17:33:47 trying to understnad the source code now 17:34:26 where's the rule for function calling in this? 17:34:35 hmm? 17:34:43 I'm reading my own old code 17:34:48 http://www.math.bme.hu/~ambrus/pu/geo-snapshot.tgz 17:34:50 ah 17:35:09 or maybe http://www.math.bme.hu/~ambrus/pu/scan-snapshot.tgz 17:35:13 '@OMFG @foo \@' is effectively a function pointer to foo 17:35:13 I always confuse the two 17:35:18 but I think geo definitely had functions 17:35:36 hmm... 17:35:44 ploki only has a call instruction and labels 17:35:45 maybe it doesn't? 17:35:53 mauke: that's no problem 17:36:16 mauke: some basic variants also only have no explicitly declared functions, only syntax to call function at a label, and a return statement 17:36:28 you could say x86_* cpu does that too 17:36:51 yeah, I was inspired by both 17:39:43 scan has nullary non-closure functions 17:40:30 and geo has no functions at all 17:40:43 ok, this opens the place for a future esolang that has nullary closure lambda functions 17:46:51 -!- networknot has joined. 17:49:57 -!- everfreeq has quit (Ping timeout: 248 seconds). 17:51:07 -!- w00tles has quit (Quit: quit). 17:51:26 -!- networknot has quit (Ping timeout: 252 seconds). 17:59:55 -!- everfreeq has joined. 18:04:33 -!- FreeFull has joined. 18:18:47 -!- Phantom__Hoover has quit (Ping timeout: 260 seconds). 18:19:28 -!- schernova has joined. 18:24:10 parse this /lol 18:24:12 lol 18:24:17 -!- everfreeq has left. 18:24:49 what 18:31:18 `relcome schernova 18:31:20 ​schernova: 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.) 18:31:26 kmc: we are Friday. 18:38:47 -!- augur has joined. 18:39:42 -!- Sprocklem has quit (Ping timeout: 245 seconds). 18:45:11 -!- schernova has quit (K-Lined). 18:48:01 k-line? and here I had `relcomed them :( 18:51:22 look what you did 18:53:21 not my fault! it was... uhm... eh... 18:53:29 * boily points randomly over to Taneb 18:53:55 I didn't know a mapole could cause K-lines 18:54:12 k-line bottles 18:56:30 -!- mrhmouse has quit (Quit: Leaving.). 19:46:19 -!- FreeFull has quit (Ping timeout: 272 seconds). 19:47:00 -!- olsner has joined. 19:49:34 -!- MindlessDrone has quit (Quit: MindlessDrone). 20:01:49 -!- w00tles has joined. 20:06:59 `relcome w00tles 20:07:01 ​w00tles: 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.) 20:11:22 hoily 20:11:25 happy friday 20:26:09 hintopia 20:26:21 happy Friday to you too. are you wearing an orange shirt? 20:26:24 ~metar CYUL 20:26:24 CYUL 102000Z 01006KT 10SM -SN OVC018 M06/M09 A3028 RMK SC8 SLP255 2014-01-11: 00:00:43 -!- Sgeo has joined. 00:36:09 -!- w00tles has quit (Quit: quit). 00:36:13 Is Cola dead? 00:39:00 not according to their share price 00:39:57 http://piumarta.com/software/cola/ 00:48:05 r562 | piumarta | 2008-10-10 03:41:56 +0200 (Fri, 10 Oct 2008) | 1 line 00:48:24 5 years. it does look pretty dead. 00:50:58 -!- tromp has joined. 00:52:59 -!- ais523 has joined. 00:55:16 -!- Phantom_Hoover has joined. 00:57:58 -!- Phantom__Hoover has quit (Ping timeout: 252 seconds). 01:19:40 -!- Bike has joined. 01:26:49 -!- Sorella has quit (Quit: It is tiem!). 01:36:14 -!- Taneb has changed nick to LordAgda. 01:36:30 -!- _46bit has changed nick to LordPRNG. 01:37:16 -!- LordPRNG has changed nick to _46bit. 01:38:04 -!- LordAgda has changed nick to Taneb. 01:48:40 -!- nooodl has quit (Quit: Ik ga weg). 01:48:59 -!- nooodl has joined. 01:55:25 -!- tromp has quit (Remote host closed the connection). 01:55:59 -!- tromp has joined. 02:01:08 -!- tromp has quit (Ping timeout: 276 seconds). 02:09:41 -!- nooodl has quit (Quit: Ik ga weg). 02:18:52 -!- yorick has quit (Read error: Connection reset by peer). 02:27:03 -!- tromp has joined. 02:59:37 -!- LinearInterpol has joined. 03:01:27 -!- Chillectual has joined. 03:02:09 -!- LinearInterpol has quit (Disconnected by services). 03:02:12 -!- Chillectual has changed nick to LinearInterpol. 03:18:58 -!- LinearInterpol has changed nick to Lebowski. 03:19:16 -!- Lebowski has changed nick to LinearInterpol. 03:23:23 -!- Sprocklem has joined. 03:27:23 -!- Phantom_Hoover has quit (Read error: Connection reset by peer). 03:29:52 -!- w00tles has joined. 03:33:53 -!- zzo38 has joined. 04:07:55 -!- LinearInterpol has quit (Ping timeout: 260 seconds). 04:32:09 -!- mauke has quit (Disconnected by services). 04:32:17 -!- mauke has joined. 04:32:57 -!- preflex_ has joined. 04:33:29 -!- preflex has quit (Ping timeout: 252 seconds). 04:33:41 -!- preflex_ has changed nick to preflex. 05:02:23 -!- Bike has quit (Ping timeout: 245 seconds). 05:06:00 -!- Bike has joined. 05:15:48 -!- tromp has quit (Remote host closed the connection). 05:16:24 -!- tromp has joined. 05:20:45 -!- tromp has quit (Ping timeout: 265 seconds). 05:24:51 -!- tromp has joined. 05:29:34 `quote 05:29:53 where does everybody go when i'm bored? :< 05:29:55 incl. bots 05:30:42 kmc: I'm watching a speedrun marathon, currently setting up for a 4-way Super Metroid race 05:30:46 http://gamesdonequick.com 05:31:05 -!- tromp has quit (Remote host closed the connection). 05:31:16 fun 05:31:40 -!- tromp has joined. 05:33:30 today i mentioned that i know someone who's a big fan of gopher 05:33:43 and another person mentioned that they also know such a person 05:33:49 they turned out to be the same person 05:34:22 kmc: burn notice! 05:34:27 is that person zzo38 05:34:50 kmc: if he didn't mean zzo38 then obviously he would have said he knew _two_ people. 05:34:52 yes 05:35:02 quintopia: that's a p. allright show 05:35:11 other people know zzo38? 05:35:33 kmc: and it's marathoning on ion tv when i should be sleeping 05:36:14 -!- tromp has quit (Ping timeout: 272 seconds). 05:36:19 apparently through ifmud? 05:36:35 quintopia: six degrees of separation may get a lot smaller when everyone is a geek 05:37:02 ion: do you watch ion tv 05:37:25 zzo38 is pretty well known http://www.urbandictionary.com/define.php?term=zzo38 05:38:20 kmc: someone in urban dictionary isn't really well known until they become a synonym for a sex term hth 05:39:04 true 05:39:33 and yeah, the nerd world is p. small 05:41:15 I think Rebol might actually fake lexical scoping too well (compared to Kernel) 05:41:49 I can think of circumstances where I want to bend scoping a bit, but Rebol near enforces lexical (despite not having true lexical scoping), but Kernel allows what I want 05:43:14 i can't believe it's not lexical scoping 05:45:27 shachaf: If it is ifMUD, then yes I am on there too; is that what they said though? 05:46:25 also apparently i work in the same building as Don Woods 05:47:19 Don Woods! Do you mean the Don Woods who invented INTERCAL and Colossal Cave Adventure? 05:47:55 yes 05:49:07 hi zzo38! 05:55:07 -!- oerjan has quit (Quit: hnitg). 06:01:28 I'm a spherical coordinate library! 06:01:46 https://npmjs.org/package/sgeo 06:02:34 I'm a trendy tote-bag! 06:02:38 Spherical coordinates; it can be useful for geography and for astronomy, perhaps. Probably other things too. 06:03:32 yep 06:03:46 -!- augur has quit (Read error: Connection reset by peer). 06:04:43 it's kind of neat that you can use the same kind of coördinates whether you are inside the sphere or outside of it 06:04:45 -!- augur has joined. 06:06:35 Can it convert between different references that the longitude is measured on? (For example, this would apply to convert between ecliptic and equatorial coordinates; it would have other purposes too in other areas of study too.) 06:08:26 sgeo can you do that 06:09:47 I have no idea 06:10:57 get more self-actualized 06:20:38 Sgeo: where does your nick come from anyway 06:21:00 Mashing together my first and last name 06:21:26 ok 06:21:33 "a common approach" 06:24:19 iojdsalkfj 06:24:25 WHERE DOES THAT STOCK SOUND COME FROM 06:24:42 http://www.youtube.com/watch?v=xCHq6sioZ1E around 1:58 06:24:50 It's one I've heard in Cybertown 06:29:43 aerated chocolate is strange 06:30:43 is it a foam 06:30:47 open-cell or closed-cell? 06:33:07 i don't know 06:36:15 Do you know what is supposed to happen in Sirlin's chess if a duel results in the attacker being exposed to check? (I am guessing the attacker just loses the game as if he ended a turn in check in any other way.) 06:59:53 Is Sirlin's Chess 2 public domain? 06:59:58 Would kind of... suck if it wasn' 07:00:27 Also, what do chess variant sites call it? I doubt they're just going to be fine with calling some random variant "chess 2" 07:02:52 chess 2 #483 07:03:07 -!- tromp has joined. 07:04:54 Sgeo: I really don't like the name "Chess 2" for this game, so I call it "Sirlin's Chess"; other people do too. I don't think the file is in public domain, although you could make implementations and descriptions which are public domain, I think. (The file can be purchased for $0.00, though.) 07:05:18 can i purchase it for CHF 0.00 instead 07:06:28 btw, it turns out that the biggest Bitcoin mining pool is pretty close to 51% 07:06:28 I don't know what CHF is, but probably you can. 07:06:59 which is worrying just because it screws up the assumptions behind Bitcoin for that sort of thing to happen naturally 07:07:04 ais523: as in, literally 51%, or as in, almost at 50%? 07:07:17 Sgeo: not even 49% 07:07:21 AFAIK 07:07:29 -!- tromp has quit (Ping timeout: 248 seconds). 07:09:31 ais523: doesn't a majority mean you can break bitcoin since you can invent fake histories and force them on the cloud? 07:09:45 coppro: you can't force a transaction to happen that didn't 07:09:55 but you can arbitrarily remove a transaction from recent history 07:10:16 (the chance of being able to do that depends on how recent) 07:10:32 that pretty much destroys Bitcoin's integrity because you can spend money, then undo spending it and send it to someone else 07:10:42 right 07:11:15 do modern transaction softwares include detection of that sort of fraud? 07:12:03 the entire point of the protocol is to detect that sort of fraud 07:12:35 but it relies on at least 50% of the miners being honest 07:12:38 right 07:12:58 but if I'm the guy who receives the money, and later the cloud disagrees, I could theoretically alert my user 07:13:08 yeah, but they can't do much but bitch 07:13:52 if it happened a lot though then they might be able to convince others to join in retake the cloud in favour of the honest miners 07:23:15 I play Sirlin's other games too, such as Yomi and Puzzle Strike, and even made up new decks, rule variants, characters, puzzle chips, game modes, etc. 07:23:55 Do you know any of these games? 07:30:48 Is there a hardware implementation of LLVM? 07:38:53 -!- Sprocklem has quit (Quit: Bye.). 07:43:25 `localtime Bike 07:44:39 -!- conehead has quit (Quit: Computer has gone to sleep.). 07:48:22 hey kmc or anyone else, is there a good book on linux drivers (or drivers in general, if that's even a thing) 07:52:11 Linux Device Drivers 07:52:48 who'd have thought (thnks) 07:53:19 ff, it's on lwn but in separate chapters. why do they do that... 07:54:28 * kmc -> sleep 07:54:30 'night all 08:14:44 Any of you guys familiar with fourier transformation? 08:14:59 mroman: I am somewhat familiar. 08:15:02 Ok. 08:15:35 x(t-l) -> X(f)*e^(-i*2*pi*f*l) 08:15:58 time shifting property 08:16:35 cos(2pi*f*t) has 0.5 at both +f and -f 08:17:14 f0 that is 08:17:31 which is usually written as 0.5*d(f-f0) + 0.5*d(f+f0) 08:17:35 where d is that dirac thingy 08:17:54 X(f)*e^(-i*pi/4) should then be 08:18:16 0.5*e^(-i*pi/4)*d(f-f0) + 0.5*e^(-i*pi/4)*d(f+f0) 08:18:33 these readings are impossible! shinji, get out now! the quantum condensation is trapping you in a dirac thingie! 08:18:46 at leasts that's what I understand under *multiply spectrum with e^(-i*pi/4)* 08:18:59 but apparentely it's totally wrong :( 08:19:55 Bike: dirac sea! 08:20:43 no doctor, the desaturation tides are reversed... it's no longer a sea... but... a thingie... 08:20:57 On the other hand... 08:21:05 Bike: it's a villainous octahedron 08:21:26 the fourier coefficients of that cos thingy are c_1 = 0.5 08:21:56 and doing the time shift there yields c_1 = 0.5*e^(-i*pi/4) 08:22:07 which means that c_-1 is 0.5*e^(i*pi/4) 08:23:11 Which suggests that 0.5*d(f-f0) is just some notation 08:23:27 and one shouldn't acually apply the multiplication on that 08:25:59 zzo38: nvm. Looks like some notation issue I fell into :) 08:56:17 -!- samebchase has joined. 09:13:08 -!- upgrayeddd has quit (Ping timeout: 252 seconds). 09:16:31 -!- upgrayeddd has joined. 09:17:32 -!- iamcal has quit (Ping timeout: 252 seconds). 09:17:51 -!- iamcal_ has joined. 09:19:12 -!- Sgeo_ has joined. 09:19:45 -!- Sgeo has quit (Ping timeout: 248 seconds). 09:34:18 "LDD3 is current as of the 2.6.10 kernel." wait, shit 09:50:40 -!- LinearInterpol has joined. 09:57:31 I have used Fourier transform to implement PADsynth only, so far, although I know it has other uses too. 10:01:55 i suppose a book about current kernel anything is basically impossible, huh 10:02:08 perhaps i need.... a monograph 10:15:54 Bike: It needs to be a wikibook, obvs. 10:43:01 -!- zzo38 has quit (Remote host closed the connection). 11:08:12 -!- mauke has quit (Disconnected by services). 11:08:13 -!- mauke_ has joined. 11:09:54 -!- preflex_ has joined. 11:10:33 -!- preflex has quit (Ping timeout: 272 seconds). 11:10:38 -!- preflex_ has changed nick to preflex. 11:12:44 -!- mauke_ has changed nick to mauke. 11:18:50 -!- sebbu has quit (Ping timeout: 252 seconds). 11:31:46 -!- LinearInterpol has quit (Ping timeout: 252 seconds). 11:33:49 -!- nooodl has joined. 11:38:21 -!- MindlessDrone has joined. 11:39:28 kmc: I’m pretty sure their signals don’t really reach Finiland. 11:39:35 modulo typos 11:40:51 -!- FreeFull has joined. 11:41:03 if I typo a signla it reaches all the way to Finland? 11:43:24 -!- Phantom_Hoover has joined. 11:45:58 Tomorrow I'm going to try to write out my Kernel vs. Rebol example 11:56:40 -!- sebbu has joined. 11:57:15 -!- sebbu has quit (Changing host). 11:57:15 -!- sebbu has joined. 11:59:17 -!- sebbu has quit (Read error: Connection reset by peer). 12:00:07 -!- sebbu has joined. 12:00:41 -!- sebbu has quit (Changing host). 12:00:42 -!- sebbu has joined. 12:02:02 -!- sebbu has quit (Read error: Connection reset by peer). 12:02:34 How do private schools in the US work? 12:03:05 I assume they are still controlled by the government in order to ensure 12:03:18 that the education they receive there is adequate to public schools? 12:04:21 in the UK there's a government inspection body that does exactly that, i assume the US works along similar lines 12:12:09 In Sweden too 12:32:11 actually I assume schooling in the US is mostly unregulated 12:34:34 -!- Sorella has joined. 12:39:30 I've heard it's more regulated in the US than it is in Sweden 12:51:07 -!- nooodl has quit (Read error: Connection reset by peer). 12:51:33 -!- nooodl has joined. 12:55:37 -!- sebbu has joined. 12:56:11 -!- sebbu has quit (Changing host). 12:56:11 -!- sebbu has joined. 12:57:39 There must be some sort of university accreditation, because all those degree-by-email "universities" are always mentioned as unaccredited. 12:57:50 "In most countries around the world, the function of educational accreditation for higher education is conducted by a government organization, such as a ministry of education. In the United States, however, the quality assurance process is independent of government and performed by private membership associations.[1]" 12:58:49 "The U.S. Department of Education and the Council for Higher Education Accreditation (CHEA) (a non-governmental organization) both recognize reputable accrediting bodies for institutions of higher education and provide guidelines as well as resources and relevant data regarding these accreditors. Neither the U.S. Department of Education nor CHEA accredit individual institutions." 12:59:03 -!- sebbu has quit (Read error: Connection reset by peer). 12:59:28 -!- ais523 has quit. 13:00:59 -!- sebbu has joined. 13:01:33 -!- sebbu has quit (Changing host). 13:01:33 -!- sebbu has joined. 13:02:02 -!- sebbu has quit (Read error: Connection reset by peer). 13:06:14 -!- sebbu has joined. 13:08:29 -!- sebbu has quit (Read error: Connection reset by peer). 13:09:43 -!- sebbu has joined. 13:11:04 -!- sebbu has quit (Read error: Connection reset by peer). 13:15:22 -!- sebbu has joined. 13:15:56 -!- sebbu has quit (Changing host). 13:15:56 -!- sebbu has joined. 13:16:16 -!- sebbu has quit (Read error: Connection reset by peer). 13:24:54 -!- nooodl has quit (Quit: Ik ga weg). 13:25:12 -!- nooodl has joined. 13:38:17 -!- nooodl has quit (Quit: Ik ga weg). 13:38:33 -!- nooodl has joined. 13:40:08 http://kindofnormal.com/wumo/2014/01/11 13:44:21 -!- LinearInterpol has joined. 13:55:51 -!- Phantom__Hoover has joined. 13:59:51 -!- Phantom_Hoover has quit (Ping timeout: 265 seconds). 14:48:51 -!- Slereah has quit (Read error: Connection reset by peer). 14:49:09 -!- Slereah has joined. 14:52:38 -!- sebbu has joined. 14:52:53 http://forestcenter.cl/ http://en.wikipedia.org/wiki/Karhu 14:53:12 -!- sebbu has quit (Changing host). 14:53:12 -!- sebbu has joined. 15:14:41 i guess it's intentional given the röntyset? 15:22:37 -!- nooodl has quit (Ping timeout: 246 seconds). 15:23:21 -!- FreeFull has quit (Ping timeout: 272 seconds). 15:23:34 okhellopol 15:24:22 quintophia 15:24:46 -!- FreeFull has joined. 15:34:20 -!- S1 has joined. 15:35:40 -!- S1 has quit (Quit: ChatZilla 0.9.90.1 [Firefox 26.0/20131205075310]). 15:36:27 -!- S1 has joined. 15:53:30 -!- conehead has joined. 16:14:24 -!- tromp has joined. 16:58:04 -!- tertu has joined. 18:07:00 -!- S1 has changed nick to S1_afk. 18:14:53 -!- augur_ has joined. 18:17:21 -!- augur has quit (Ping timeout: 248 seconds). 18:28:50 -!- S1_afk has changed nick to S1. 18:48:59 -!- tromp has quit (Ping timeout: 260 seconds). 18:55:57 -!- tromp has joined. 19:01:39 "for instance, 400 years before we had computers, we had email, which is a raised or embossed image pressed into metal. " 19:04:35 I do not get it 19:04:42 If it's about telegraphs, it's a bit early 19:04:52 But if it's about actual mail, it's a bit late 19:05:01 Oh wait 19:05:04 He means 19:05:08 émaille 19:05:11 Dohoho 19:22:42 -!- impomatic has quit (Ping timeout: 252 seconds). 19:26:50 hmm. https://en.wikipedia.org/wiki/Email_Limited 19:30:13 -!- tromp_ has joined. 19:31:30 -!- tromp has quit (Ping timeout: 252 seconds). 19:40:09 -!- tromp_ has quit (Remote host closed the connection). 19:40:41 -!- tromp has joined. 19:41:15 -!- Phantom__Hoover has quit (Ping timeout: 260 seconds). 19:44:47 -!- tromp has quit (Ping timeout: 245 seconds). 19:47:26 -!- tromp has joined. 20:00:46 -!- impomatic has joined. 20:00:54 -!- Phantom__Hoover has joined. 20:01:49 -!- ter2 has joined. 20:03:47 -!- FreeFull has quit (Read error: Operation timed out). 20:05:37 -!- tertu has quit (Ping timeout: 248 seconds). 20:12:54 "Call for Papers - Special Issue on Facial Biometrics in the Wild" 20:16:10 Is tetzold.com down for anyone else? 20:33:49 seems to be down from here 20:42:11 http://downforeveryoneorjustme.com/tetzold.com 20:49:22 -!- ter2 has quit (Ping timeout: 245 seconds). 20:52:00 -!- tromp has quit (Remote host closed the connection). 20:52:33 -!- tromp has joined. 20:55:01 -!- w00tles has quit (Quit: quit). 20:57:39 -!- tromp has quit (Ping timeout: 272 seconds). 20:59:21 -!- ter2 has joined. 21:04:34 -!- ter2 has quit (Ping timeout: 246 seconds). 21:06:48 -!- FreeFull has joined. 21:38:36 Thanks, have emailed the site owner. 21:39:40 -!- MindlessDrone has quit (Quit: MindlessDrone). 21:54:28 -!- nooodl has joined. 22:04:41 -!- yorick has joined. 22:11:52 -!- S1_ has joined. 22:12:23 -!- S1_ has quit (Client Quit). 22:14:21 -!- S1 has quit (Ping timeout: 252 seconds). 22:27:41 -!- Bike has quit (Ping timeout: 272 seconds). 22:30:08 http://i.imgur.com/mQmXYh4.png 22:30:49 Uh oh 22:34:56 Spock MacGyver http://youtu.be/wzBShJ2dNfQ 22:49:55 -!- tromp has joined. 22:50:02 -!- tromp has quit (Read error: Connection reset by peer). 22:50:31 -!- tromp has joined. 23:15:25 -!- Sprocklem has joined. 23:22:09 -!- oerjan has joined. 23:33:42 -!- conehea__ has joined. 23:34:06 -!- conehead has quit (Read error: Connection reset by peer). 23:34:34 -!- conehea__ has changed nick to conehead. 23:35:05 -!- zzo38 has joined. 23:50:25 -!- Bike has joined. 2014-01-12: 23:06:15 -!- esowiki has joined. 23:06:18 -!- glogbot has joined. 23:06:19 -!- EgoBot has joined. 23:06:20 -!- esowiki has joined. 23:06:20 -!- esowiki has joined. 23:06:22 -!- HackEgo has joined. 23:06:28 aouch, emacs broke my left pinkie 23:06:58 nooga: You shouldn't have used the default keybindings 23:07:04 -!- Gregor has joined. 23:07:09 They are very stressful if you are using an IBM keyboard 23:07:28 yeah, I know about the caps-lock rebind trick 23:07:38 but i don't want to apply it system wide 23:07:47 oerjan: There's size-specific rules here, too. Shops larger than 400 square metres have their own rules, and shops smaller than 100 square metres have the same rules as gas station shops smaller than 400 square metres. 23:07:51 kmc: also if by electoral quirks you mean having a proportional system where small parties are needed for stable coalitions. 23:07:57 oerjan: But you can make a bigger shop if it's attached to a gas station. 23:09:38 fizzie: ic. apparently so you can in norway too, although it's not as big a difference. small enough that small shops without gas stations are used, anyway. 23:10:09 nooga: any particular reason why not? 23:10:19 oerjan: 100 square metres is p. small for a shop, to be honest. 23:10:20 that idea frightens me 23:10:33 10m x 10m 23:10:39 That's indeed very small 23:11:08 The idea of having a key that causes one to textually scream frightens me more 23:11:12 but fair enough 23:11:26 I should switch caps-lock to be shift-lock again 23:11:28 That was more useful 23:11:39 fizzie: yes it is, although it's enough for the kind of emergency articles you run to a shop on sunday to buy. 23:11:52 I wish there was a nice keyboard layout editor 23:12:44 I just went to the nearby gas station shop yesterday, because it's (just barely, but still) the closest shop. Started to change batteries of the smoke detector, only to find that both spares had gone bad. 23:12:57 ok 23:13:04 -!- tromp has joined. 23:13:08 (One had leaked innards out, and the other measured about 4.4 V out of the nominal 9 V.) 23:13:09 i rebound the caps-lock 23:13:49 (Don't buy "Philips Powerlife" brand, I guess.) 23:13:56 nooga: godless bike shops? http://www.thejewishweek.com/news/new_york/unkosher_wheels_friendly_faces 23:14:25 Leaky battery is never fun 23:14:26 (Should've gone with "Philips Longlife" instead.) 23:14:54 Except I don't think I've seen those green "Longlife" ones except in this Google image search. 23:15:27 I didn't say anything about godless bike shops 23:15:56 * oerjan thinks the smoke detector here is mains connected 23:16:10 I don't even have one 23:16:10 :D 23:16:16 nobody here has 23:16:32 in norway i'm pretty sure they're mandatory by law. 23:16:57 -!- ais523 has joined. 23:17:02 also i may be breaking the law by not having unpacked the fire extinguisher that was in the closet. 23:17:12 *is 23:17:15 I never saw a legit fire in my life 23:17:43 -!- tromp has quit (Ping timeout: 272 seconds). 23:18:00 hmm, rewatching babylon 5, I've realized that two main characters look almost exactly the same and I probably didn't realize they were different people the first time through 23:18:01 we did have a false alarm in this building before christmas, someone was making christmas food 23:18:22 was it a goat head? 23:18:52 so i guess the irritation of not having to change batteries has been replaced by the irritation of possible false alarms from all the neighbors. 23:19:21 false alarms drove me insane in edinburgh 23:19:28 nooga: i didn't ask. rather unlikely. it wasn't on christmas itself so probably cookies of some sort. 23:19:37 Has anyone tried AgonyWar? http://esolangs.org/wiki/Agony 23:19:56 i'm glad that we don't use smoke detector in flats 23:20:11 they're used in institutions and office buildings 23:21:37 nooga: i don't think goat/sheep heads are common christmas food around these parts. 23:21:47 further west, maybe. 23:21:50 ah, okay 23:22:37 what about brunost? 23:23:00 i love it on toast but it's hard to find here 23:23:49 but the two main christmas eve dish choices are pork rib and pinnekjøtt (salted sheep meat boiled over wooden sticks) 23:24:01 brunost is everyday food 23:25:16 of course there are a heap of other christmas dishes possible, some of which may be more common on other christmas days. lutefisk, cod, turkey... 23:25:46 aha 23:25:56 nice 23:26:41 (technically lutefisk is usually cod, but...) 23:28:22 carp is mandatory here 23:28:51 -!- Sprocklem has joined. 23:29:04 and there's this annoying custom that people usually buy live carps and keep them in bathtubs 23:29:17 and then try to kill and prepare them 23:29:32 it usually goes horribly wrong 23:29:53 statistics from no.wikipedia: pork rib: about 60%, pinnekjøtt: about 33% 23:31:09 so i guess that's a pretty massive majority 23:33:46 nooga: i found a youtube link but it was disappointingly non-horrible. 23:37:03 oh found a proper table 23:39:15 pork rib: 56%, pinnekjøtt: 31%, turkey: 6%, other roasted pork: 4%, lutefisk: 2%, cod: 1%, venison: 1% 23:39:39 http://no.wikipedia.org/wiki/Julemat#Norge 23:43:03 "Lich's Mirror has no effect if you concede the game. If you concede, you'll lose." 23:43:09 Why is that an actual ruling 23:43:28 looks tasty 23:45:41 -!- peapodamus has quit (Read error: Connection reset by peer). 23:47:13 http://gatherer.wizards.com/Pages/Card/Details.aspx?multiverseid=83133 23:47:18 How does that happen 23:47:38 -!- peapodamus has joined. 23:47:57 oerjan: hm, I take it "julbord" isn't as common in Norway, at least not on christmas eve? 23:48:03 Oh, by actually having a huge library 23:48:55 Sgeo: wait, that isn't from one of the joke sets? 23:49:53 That *seems* broken to me, but I haven't played much MtG 23:49:53 FireFly: indeed, "julebord" is firmly associated to _pre_-christmas parties in norwegian. 23:51:02 FireFly: Broken how? 23:51:38 in fact, the word essentially _means_ pre-christmas party. customarily with a christmas food buffet table but i don't think that's mandatory. 23:51:54 our julbord also means the pre-christmas parties (like the kind that your office might send you on) 23:52:20 but you also have a julbord on christmas 23:53:02 well we don't have it on christmas. 23:53:09 We've got two (smoke detectors). Actually, I think there's even some guideline that you should have one per every 60 square metres, and this place is something like 61.5. 23:53:14 shachaf: well, I don't remember if there's any way to somehow search the library for a card (i.e. if there are cards with such effects), but if there are it seems like it'd be easy to cause a win 23:53:54 Cards like "if x, you win the game" seem a bit hard to balance 23:55:30 I think there are cards with such effects, but you still need to draw one. 23:56:02 And you'll probably need quite a bit more than 200 cards, since you can only play these things on turn N. 23:56:14 there's also a concept of "juletrefest" mainly for the children, which can be either before or shortly after christmas. i think. i may not have been on one since i was a kid. 23:56:53 Unless you also have a way of putting things back into your library, I guess. 23:57:04 http://no.wikipedia.org/wiki/Juletrefest 23:58:40 (the word literally means "christmas tree party") 2014-01-13: 00:00:24 "Subject: Eris is the main object, Dysnomia the small grey disk just above it." Oh, spam subject lines. 00:01:20 a mistake of cosmic proportions 00:01:23 I was hoping for something astronomical, but it's one of these spam messages I don't really "get", where the body also has just some random text and there's no attempt to actually sell/scam anything. 00:01:56 "While at Yale, Shevlin also developed a passion for the new sport of automobile racing. In 1891, he suffered a fall and an internal injury. In 1907, he moved to Vancouver and was also active in real estate. Another fight broke out in early spring 1915." 00:02:01 That's the entire contents. 00:02:18 Both the plaintext and HTML versions, and the HTML version hasn't got any links. 00:02:23 It’s to add noise to spam filters. 00:03:30 Huh. Plans within plans. 00:04:14 http://gatherer.wizards.com/Pages/Card/Discussion.aspx?multiverseid=241831 00:04:30 "one day i want to cancel this card. just for fun." 00:05:07 -!- nooga has quit (Ping timeout: 245 seconds). 00:05:55 ion: huh that's fiendish if true 00:06:12 Sgeo: what if you have an "Instants cost you {1} less to play"? then it might even be the right play 00:08:17 Procrastination is bad and umbrellas are :( 00:13:18 ais523: Yes, or maybe in a game with more than two players you might also want to use Cancel on it. 00:14:47 -!- tromp has joined. 00:16:09 -!- ter2 has quit (Read error: Connection reset by peer). 00:17:07 I have read about someone who had a deck with a very large number of Islands and one Battle of Wits, and managed to win with that. 00:17:41 I noticed I have the line ":ter2!~tertu@143.44.70.199 QUIT :Read error: Connection reset by peer" in the same position in two IRC windows. 00:18:13 -!- tromp has quit (Remote host closed the connection). 00:18:25 -!- tromp has joined. 00:18:46 -!- nooga has joined. 00:20:44 http://magiccards.info/ds/en/114.html 00:20:57 Are there ways to fight against that other than winning fast (well, I guess 20 turns is a long time)? 00:22:28 Sgeo: "exile target artifact" effects is the most obvious 00:22:37 you could also use a card that removes counters 00:22:51 or bounce it (Boomerang, etc.) 00:24:08 "In tournaments, you must be able to shuffle your entire deck within a reasonable amount of time." 00:24:31 http://magiccards.info/isd/en/61.html this seems awesome for fighting against miller decks 00:24:46 * coppro wonders if he can relate topological graph theory to programming languages 00:26:32 hmm, i guess cards like Vorel of the Hull Clade can double the jams on Darksteel Reactor 00:27:43 If you manage to pick Darksteel Reactor in a draft, then see if you have enough defense and counterspell then maybe it can help you to win with such a thing. 00:28:54 (Limited formats are the only formats I ever play; I don't like the Constructed formats.) 00:35:21 I think I can actually afford to play Magic now 00:35:55 Ooh, PokerTH allows spectators now 00:40:40 -!- tromp has quit (Remote host closed the connection). 00:41:16 -!- tromp has joined. 00:45:34 How much money can you expect to lose on average if you play Limited formats and sell all cards you manage to get after the tournament is finished? 00:45:55 -!- tromp has quit (Ping timeout: 260 seconds). 00:46:15 zzo38: that's been tested very extensively on Magic Online, the answer is "if you're a good player, you make money, so long as you're careful to normally play against people worse than yourself" 00:47:33 You can sell your virtual cards on MGO? 00:47:41 MTGO 00:47:48 Sgeo: yeah, but only for MTGO currency 00:48:02 however, you can then use the currency to enter more MTGO tournaments 00:48:15 And I need real currency to buy MTGO currency I assume, if I don't sell cards 00:48:16 so you end up not spending any real money, and gaining more and more MTGO currency over time 00:48:42 ais523: What if you play in just normal tournaments in a store or anime convention or something? 00:48:51 The whole real money thing is what bothered me most about MTGO, but... I actually have money now 00:48:54 (Rather than being careful to pick the opponents) 00:49:08 Sgeo: it's still really expensive, though 00:49:13 zzo38: that's worse than needing real money -- you need real money AND need to take care of your cards 00:49:29 but can you sell your virtual cards on MtGox 00:49:32 (not anymore) 00:49:46 "(not anymore)"? 00:49:53 ais523: :( 00:50:12 I... guess I don't know if the fun I can imagine having on MTGO is worth the cost :/ 00:51:29 I used to have enough fun playing Magic to be worth the cost, but then Lorwyn was released, and I stopped having fun 00:51:38 Sgeo: The cards would be sold right at the tournament though, right after it is finished, I mean; how much would you expect to lose on average? 00:51:54 Don't really want to sell cards 00:52:39 Why? 00:52:40 Sgeo: MtGox stands for Magic: the Gathering Online Exchange 00:52:40 really 00:52:50 it started as a place to sell magic cards, before they got into this newfangled "Bitcoin" thing 00:53:05 whoa, whoa, whoa 00:53:14 i thought it was an online exchange for magic: the gathering 00:53:21 not an exchange for magic: the gathering online 00:53:23 which one is it 00:53:25 kmc is telling the truth, if Wikipedia is telling the truth 00:53:27 If I want to play Magic: the Gathering or something on computer, I would prefer to use different software which has open source and allows putting in your own cards and all that stuff too 00:53:31 shachaf: i'm not sure 00:53:56 zzo38: I used Apprentice Way Back In The Day 00:53:59 zzo38: the convenience of having the software understand the meaning of the cards overrides that for me 00:54:34 Sgeo: Yes, to write a software that supports it. In fact I had ideas like that too! 00:55:08 That could compile card texts with various annotations into a Haskell code. 00:56:54 should i get a bunch of magic: the gathering cards 00:57:26 shachaf: I don't recommend it; you don't need any. 00:57:55 don't need any for what? 00:58:00 They will give you some when you enter, and you can sell them back afterward. 00:58:24 who will 00:58:57 my coworkers play it a lot but in general there is no selling or buying of cards 01:00:33 The tournament, if you pay the entry fee they will give you three packs of cards. You can resell them immediately afterward. 01:00:44 Basic land cards can be borrowed for free. 01:01:23 is the entry fee similar to the cost of three packs of cards 01:01:38 Unfortunately, I don't know. 01:01:50 shachaf: it's a bit more than the cost of three packs of cards, traditionally 01:01:57 lol surprise there 01:01:57 But if you win the tournament generally you will be given an extra pack. 01:02:22 `run olist 937 # Sgeo already did this but HackEgo was gone 01:02:27 I don't trust myself with physical cards anymore 01:02:28 olist 937: shachaf oerjan Sgeo FireFly 01:02:44 oerjan: No! The message has to start with "`olist" deliberately. 01:02:53 (But it already did once, so that's OK) 01:03:20 zzo38: that's your interpretation. 01:03:34 i search for my nick, not `olist. 01:03:46 `relcome HackEgo 01:03:49 ​HackEgo: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: . (For the other kind of esoterica, try #esoteric on irc.dal.net.) 01:03:58 zzo38: See, so oerjan did `run olist, so that there would only be one message starting with `olist in the logs. 01:04:04 oerjan: But your nick willl appear in various other messages too. 01:04:07 It's ideal. 01:04:19 shachaf: Yes that is what I mentioned second time. (Also, `run allows you to add comments afterward, like is done there.) 01:04:38 So what oerjan did is ideal. 01:04:46 zzo38: of course, and i want to see those too, which is why i search for my nick. 01:05:42 zzo38: anyway the reason i did it now was because some nicks were not mentioned the last time. although only FireFly it seems, who saw the `olist anyway. 01:05:53 Ah, OK. 01:12:21 -!- nooodl has quit (Ping timeout: 272 seconds). 01:15:19 `addquote Note to self: if a recipe says "serves 4", I am not physically able to eat it all in one sitting 01:15:23 1158) Note to self: if a recipe says "serves 4", I am not physically able to eat it all in one sitting 01:17:07 Only 4? 01:17:25 -!- tromp has joined. 01:17:30 A deck with 60 Plains would be tournament-legal, right? 01:17:38 Yes. 01:17:43 60 trains 01:17:51 It would be *bad*, but perfectly legal. 01:17:57 -!- rodgort has quit (Ping timeout: 248 seconds). 01:19:04 -!- nooga has quit (Ping timeout: 260 seconds). 01:19:07 -!- rodgort has joined. 01:19:09 A deck of 600 Plains would *also* be tournament legal. (assuming you can shuffle that in the time allotted) 01:25:13 how good does the shuffle need to be 01:25:21 indistinguishable from random by any polynomial time turing machine? 01:27:25 Unspecified, but given that tournaments are human-judge-governed, "enough that you don't piss the judge off". 01:27:59 whats a plain 01:29:47 A Plains is a Magic card. Its type is Basic Land -- Plains. It has no text. 01:30:49 sounds pretty plain 01:30:58 but it has the intrinsic ability "{T}: Add {W} to your mana pool" 01:31:18 Yes, it has the land subtype Plains. 01:32:30 Some versions have a huge {W} symbol in their text box, does that count as text? 01:32:32 plain ol' land 01:32:42 Sgeo: No. 01:33:05 Versions with "{T}: Add {W} to your mana pool" or some variation thereof also have no text. 01:33:50 whoa, whoa, whoa, why not 01:34:10 Because the rules say so. 01:34:51 where 01:34:57 In essence, the card's printed contents say absolutely nothing about what the card's properties are. 01:35:10 obligatory "i'd tap that" 01:35:40 shachaf: 108.1 01:37:55 -!- realzies has quit (Ping timeout: 245 seconds). 01:39:18 -!- realzies has joined. 01:41:43 -!- peapodamus has quit (Read error: Connection reset by peer). 01:43:30 -!- peapodamus has joined. 01:43:47 I think that is silly that the rules would say it has no text. 01:44:19 I also think other rules of Magic: the Gathering also are no good or are too klugy or other reasons. 01:45:12 do you have a list 01:45:28 I don't think I did actually write down a list, unfortunately. 01:45:36 If not it's pretty trivial to make one. 01:45:45 But I also think "Planeswalker" is a bad name for a card type. 01:45:49 pikhq: Yes, that is true. 01:46:27 The MTG rules are really *blatantly* a kludge. 01:47:55 Yes, a lot, and I have a lot of idea to fix. I also hate that they removed mana burn; it is a very strategical importance. But a good thing they fixed is chaing the name of "remove from game" zone to "exile" zone; now is more sensible that part, at least. 01:48:17 (Since, such zone are really still part of the game.) 01:48:33 i just want to play rummy. 01:48:41 those cards have no text and everyone likes it that way! 01:49:00 Bike: OK, then play rummy. There is several different kind of rummy game, too. 01:49:11 can i play rummy with Magic cards 01:49:30 Bike: I don't know. Possibly you can figure out a way. 01:49:36 At least things don't gain Substance anymore. 01:49:46 I know you can play rummy with Yomi cards though. 01:50:15 are you allowed to tap artifacts if they don't have an activated ability that costs {T} 01:50:29 shachaf: Only if something says so, I think. 01:50:35 shachaf: Not unless something lets you, no. 01:52:25 so what's with Howling Mine () 01:52:50 is that just written that way in case something else can cause it to be tapped? 01:53:09 isn't yomi the samurai's arrows in nethack 01:53:28 It is written that way explicitly so it doesn't function if something causes it to be tapped. 01:53:49 Bike: That isn't what I meant. 01:54:22 *Ah*. It's really old in part. Way back when, continuous artifacts didn't work when they became tapped for whatever reason. 01:54:33 The wording is to preserve that functionality. 01:54:48 shachaf: Howling Mine could be good to cause opponents running out of cards more fastly, I suppose, if you have ways to replenish your draw pile from your discard pile or something like that. 01:55:08 There are cards that cause artifacts to become tapped, FWIW. 01:55:15 sure 01:55:18 There's even some that let you tap another artifact as a cost. 01:55:22 right 01:55:38 But ultimately, it's a matter of that being one heck of an old card. 01:56:46 when something says you may return it from your graveyard to the battlefield, does that mean that it has to have been in the battlefield in the past? 01:56:56 e.g. if you discard it from your hand, you can't use that ability? 01:57:04 shachaf: No it doesn't mean it has to be. 01:57:22 But if it tries to put back a Instant or Sorcery it just remains where it is, I think. 01:58:44 -!- copumpkin has changed nick to meconium. 01:58:49 if something gets a bunch of jams and then goes to your graveyard, scavenge will just use the printed power on it, right? 01:59:02 printer jams? 01:59:13 +1/+1 jams 01:59:33 or other kinds i suppose 02:00:05 kick out the jams 02:03:15 I also don't like the rule that auras that are also creatures are discarded, and the rule that -1/-1 and +1/+1 counters are removed each other, and that losing due to unable to drawing a card is a state based effect rather than being immediate. 02:06:15 -!- meconium has changed nick to copumpkin. 02:13:58 -!- tromp has quit. 02:14:33 -!- Phantom__Hoover has quit (Read error: Connection reset by peer). 02:14:43 -!- tromp has joined. 02:17:23 Oh hey MTGO finished installing 02:17:30 Erm, downloading 02:19:07 "Wizards of the Coast allows collectors who have assembled a full set of digital cards to exchange them for a factory set of printed cards for a $25 shipping and handling fee. Regular cards and foils cannot be mixed. Each set is eligible for a period of up to 4 years after the online release. This program was initially created in order to allay doubt and uncertainty over the investment into virtual cards" 02:19:10 ....investment? 02:19:37 I thought the purpose of buying the virtual cards was to have fun, not to invest 02:19:56 whenever you want somebody to spend unreasonably much money on something useless, you call it an "investment" 02:20:11 that's marketing 101 sgeo 02:20:44 Sgeo: the only reason people can afford Magic cards at all in formats like Legacy is that they can sell them again afterwards and make back most of the money 02:21:04 any viable Legacy deck costs like $2000 02:22:31 kmc: To be fair-ish, the cost on Legacy-viable Magic cards is rather stable. 02:22:50 Buuut yeah. 02:23:01 pikhq: not always, new releases can blow things up 02:23:07 Far better phrased as "pile of cash donated to my hobby" 02:23:11 there was the debacle with True-Name Nemesis recently 02:23:51 it's massively in demand for Legacy, and only available in one of five theme decks that Wizards keeps producing in equal quantities and insisting that shops buy an equal number of each 02:23:59 leading to the other four ending up stuck on shelves 02:24:11 MTGO isn't going to be too expensive for me to play casually, is it? 02:24:56 depends on how many cards you want 02:25:14 the way it works is, you buy tix for $1 each, tix enter you into tournaments, where you can win boosters as prizes 02:25:28 the smallest tournaments are two-man tournaments, it's 2 tix for each player to enter 02:25:31 and the winner gets 1 booster 02:25:36 Do you also get to keep drafted cards in MTGO or not? 02:25:39 that's $4 on average for 15 cards, if you have a 50% win rate 02:25:49 zzo38: there are two sorts of MTGO drafts, some where you keep them, some where you don't 02:26:20 if you enter a tournament where you get to keep them, you have to supply 3 boosters to enter, or else like 12 tix if you don't have the boosters (that's $12) 02:26:28 so one draft is going to cost you like $15 02:26:59 there are bots that sell boosters from recent sets for like 3 and a half tix each, though 02:27:05 (the exact price varies continuously) 02:27:33 Can I just buy decks to play against randoms and friends? 02:27:46 I'm not sure 02:28:54 i heard that you can predict which cards will be in a booster box by opening a few of the packs 02:28:57 is that true 02:28:59 http://www.wizards.com/mtg/images/digital/magiconline/img_grapeshot.png 02:29:05 Each copy itself doesn't storm, does it? 02:29:20 Sgeo: Storm is a trigger that triggers on casting 02:29:22 the copies aren't cast 02:29:22 oh, you're talking about the online thing anyway. ok 02:29:26 they're copied while they're on the stack 02:29:56 also that would be a trivial infinite loop if they did 02:30:24 btw, the person in charge of Magic design is insisting they're never going to do Storm again because it's been a complete balance nightmare every time they've tried 02:32:02 ais523: should I install wide beta or the current version? 02:32:30 ais523: also sounds like a UI nightmare, but are there other mechanics that are also UI nightmares? 02:32:31 Sgeo: they're compatible; Wizards wants everyone to use the beta but nobody does 02:32:41 I'm not sure why 02:32:50 they claim the beta's better, at least 02:32:57 Almost downloaded beta by accident because it defaulted to it 02:33:08 lol 02:33:10 I want to wait until it's stable, but then, I used Gmail while it was in beta 02:33:15 lololololol 02:33:25 also, Haunt's probably the biggest UI nightmare, it's a UI nightmare even in real-life play 02:36:09 Apparently MTGO doesn't work in WINE? ais523, how do you use it (assuming you do, rather than knowing everything about a game you don't play) 02:36:26 Sgeo: I don't use it 02:36:34 knowing everything about games I don't play is one of my hobbies 02:36:45 also I follow MTGO beta development, and used to watch streams of it a bunch 02:36:48 -!- yorick has quit (Remote host closed the connection). 02:36:59 streams of development or gameplay? 02:37:16 gameplay 02:37:22 but nobody streams the beta, that's how I know it's unpopular 02:37:36 the development isn't streamed, development rarely is 02:37:54 `addquote knowing everything about games I don't play is one of my hobbies 02:37:57 1159) knowing everything about games I don't play is one of my hobbies 02:38:12 kmc: seriously, it takes up like half my leisure time that isn't programming 02:38:39 I kind ofdo the same with programming languages :/ 02:38:46 And games, except for the 'everything' bit 02:41:33 I think the limitations of using macros to add continuations to languages that don't have them might mirror Haskell's continuation stuff only being available to functions that support it by producing a Cont whatever 02:42:03 Actually, hmm 02:43:03 > (`runCont` id) $ shift (\k -> fmap map k (map return [1,2,3])) 02:43:04 Couldn't match type `GHC.Types.Int 02:43:04 -> ([m0 a1] -> a0 -> b0) -> [a0] -> [b0]' 02:43:04 with `Control.Monad.Trans.Cont.ContT 02:43:04 r0 Data.Functor.Identity.Identity r0' 02:43:04 Expected type: Control.Monad.Trans.Cont.Cont r0 r0 02:43:13 I... should think about things more thoroughly 02:43:23 > (`runCont` id) $ shift (\k -> fmap map k <*> (map return [1,2,3])) 02:43:24 Couldn't match type `GHC.Types.Int -> [a0 -> b0] -> [[b0]]' 02:43:24 with `Control.Monad.Trans.Cont.ContT 02:43:24 r0 Data.Functor.Identity.Identity r0' 02:43:24 Expected type: Control.Monad.Trans.Cont.Cont r0 r0 02:43:24 Actual type: GHC.Types.Int -> [a0 -> b0] -> [[b0]] 02:43:33 That doesn't count as thorough thinking 02:46:07 Why does Magic Online want admin on my computer? 02:48:04 because it's badly programmed 02:48:12 it has a tendency to crash, including during tournaments 02:50:26 Those are also other reasons I wouldn't want to use such software. 02:51:12 Is the beta version any better about not crashing? 02:51:33 o.O LispWorks is expensive 02:51:33 http://www.lispworks.com/buy/prices-1c.html 02:51:40 What's the other popular commerical CL? 02:52:20 Allegro I think 02:52:52 Sgeo: I think the most infamous crashes are on the server end, so it doesn't matter what client you use for that 02:57:11 -!- APott has joined. 03:01:44 -!- APott has quit (Client Quit). 03:04:51 `log `olist 937 03:05:23 No output. 03:05:24 `log `olist 937 03:05:34 2014-01-13.txt:03:05:24: `log `olist 937 03:05:40 typical 03:05:50 `log > `olist 937 03:05:56 2014-01-13.txt:03:05:50: `log > `olist 937 03:06:05 …wait, that's possible? 03:06:19 `log [^] ]> `olist 937 03:06:25 No output. 03:06:29 `olist 937 03:06:31 olist 937: shachaf oerjan Sgeo FireFly 03:06:32 * ais523 is triumphant 03:08:52 triumphant yet failed 03:09:09 ais523: HackEgo was down when the actual `olist was attempted 03:09:25 oerjan: don't you mean glogbot? 03:09:32 or were they both down? 03:09:33 well both 03:09:36 right 03:09:42 well in that case the pings never happened the first time 03:10:12 so you can't blame me for unwanted pings 03:10:50 however, i did it second time just because it didn't ping. _but_ i used `run olist instead of `olist because i included a comment that i knew it had already been done. 03:11:05 this is the third time i've been notified about this comic 03:11:25 zzo38: i guess i just found another argument for you for why i shouldn't use `run olist 03:11:37 oerjan: it's like you actively want to be mispinged 03:11:56 *MWAHAHAHA* 03:12:37 oerjan: What other argument? If it has already been done and you want to add a comment that is the reason to use `run which is already known. 03:13:10 Or do you mean for reading the log? 03:13:21 zzo38: i didn't think that someone (ais523) might want to check if `olist had already been used _without_ being on the list himself 03:13:37 But in that case, isn't glogbackup for? 03:13:52 zzo38: I checked by asking HackEgo if anyone had said `olist 03:14:04 and it said no, because it wasn't around the first time, and the second time it wasn't spelled `olist 03:14:19 zzo38: Gregor has never made glogbackup merge in its logs properly. you may help nagging him if you want. 03:14:22 oerjan: O, OK, then. 03:14:37 oerjan: Yes he really should fix it please. 03:15:16 zzo38: wow that's a confusing sentence 03:15:35 you made a request to someone, in the third person, while pinging someone else, then added "pleae" 03:15:38 *"please" 03:16:12 That is in case you can contact them too. (I already did sent a message) 03:22:05 -!- LinearInterpol has quit (Ping timeout: 272 seconds). 03:28:40 let's say I have a .tar.xz archive. Is there some way I can add to it without having to decompress it all and recompress it? 03:28:56 or something with similar compression that supports incremental addition? 03:30:49 i don't know about xz, or tar, but you can concatenate gzip files and it's equivalent to gzipping the concatenation of the decompressed files, except bigger 03:30:52 Possibly, but not easily. 03:31:04 xz has the same property. 03:31:19 The trick is adding to a tar. I don't know if there's any real way to do that nicely. 03:31:26 yeah, I was hoping for it to be able to reconstruct its compressor state and let me pretend I just added shit onto the end of the stream 03:31:50 what I want is something like tar but which builds a compression-compatible index, so I can do random access 03:31:56 maybe I should use squashfs as my archive format 03:32:18 it would be handy to mount archives 03:32:26 I have a lot of annoyingly large json files that share a lot of structure and they compress beautifully 03:32:33 but I don't want to compress them all at once 03:32:42 and xz achieves ridiculous ratios on them :( 03:32:50 Actually, is the concatenation of two tarballs a valid tarball? 03:33:24 It would seem "not really". 03:34:01 copumpkin: you could stuff each one into a JSON object like {'filename': 'foo.json', 'data': ...} and then your archive format is just "sequence of json values" and you can concat .xz files 03:34:31 yeah, but concatting them doesn't get me the same benefit :/ 03:34:38 Ah, yep, tar does have an EOF marker in it, which is why it doesn't work. 03:34:41 once I have enough of them, the marginal growth of adding another json file is tiny 03:34:51 whereas compressing them individually grows much faster 03:34:54 pikhq: Presumably that is so that it works if loaded on a tape? 03:34:59 oh i see, you want to compress it wrt the existing structure 03:35:02 you can concat .ttyrec 03:35:03 yeah 03:35:11 seems rather unlikely to be a common use case 03:35:16 but it'd make me very happy 03:35:20 but it isn't a compression format, it's a video codec 03:36:49 You could also make the archive format just, have a null-terminated filename followed by the 32-bit length and then data of that file. Now it can easily be concatenated. 03:38:50 zzo38: but if the data is already JSON then might as well use JSON for the container as well 03:40:23 for scale, I have about 20k json files using up close to 6gb 03:40:30 kmc: Yes, if the data is already JSON, then that can work 03:40:57 they compress to about 80MB 03:41:15 horribly redundant structure, even apart from the json noise 03:41:24 (format isn't under my control unfortunately) 03:44:16 if you have a small number of files compressed together then you can afford to recompress them all whenever you add one... and occasionally when that gets big enough you recompress it together with the next bigger chunk of files... and so forth 03:45:04 Ah, nice. Amortising the compressor cost. 03:45:46 yeah 03:45:52 hmm 03:46:40 edwardk gave a talk at mozilla sf which was about some data structure which used a list of arrays whose sizes followed counting in skew binary 03:46:46 yeah 03:47:01 so that you never have a cascade of carries, which here would correspond to recompressing a whole lot of data at once 03:47:02 problem in this case is that at some point merging large ones will get impossibly large 03:47:17 well you can stop at some point 03:47:22 I guess, yeah 03:47:40 if you can afford to store 80MB per 20k files, then don't bother compressing chunks bigger than 20k 03:47:55 yeah 03:48:05 i agree that something which can resume the compressor state would be more elegant, though 03:48:16 but i don't know of anything like that 03:48:40 There's no real reason it can't be done, but yeah. 03:48:50 perhaps you can write or hack up a compressor implementation to serialize its state at the end of the output 03:49:33 (at least in gzip, and presumably also in xz, the compressor state up to a point can be entirely derived from the compressed output up to that point) 03:49:40 oh, neat 03:49:45 * kmc -> afk 03:50:55 The compressor may have looked ahead further, but when it's outputting the compressed text it's already output everything that depends on future text in the stream (namely, symbol frequencies for the Huffman table) 03:51:45 And the symbol frequencies and window are just about all of the compression state. 03:53:34 shachaf: remind me tomorrow to help with Dylan 03:53:46 why 03:56:32 Because, I want to help financially if possible 04:01:56 Kind of annoyed that opendylan.org's https certificate is expired, want to fix tthat 04:04:32 pikhq: yeah, I was hoping that already existed somewhere 04:09:34 @tell Sgeo 19:53 shachaf: remind me tomorrow to help with Dylan 04:09:34 Consider it noted. 04:15:36 -!- mauke has quit (Read error: Operation timed out). 04:16:29 -!- mauke has joined. 04:16:40 -!- preflex has quit (Ping timeout: 245 seconds). 04:16:52 -!- preflex_ has joined. 04:17:17 -!- preflex_ has changed nick to preflex. 04:41:36 -!- tromp has quit (Remote host closed the connection). 04:42:10 -!- tromp has joined. 04:47:03 -!- tromp has quit (Ping timeout: 272 seconds). 05:20:18 > x $ y ? z 05:20:19 Not in scope: `?' 05:20:29 > x $ y & z 05:20:30 Couldn't match expected type `b0 -> t0' 05:20:31 with actual type `Debug.SimpleReflect.Expr.Expr'Couldn't match e... 05:20:31 with actual type `Debug.SimpleReflect.Expr.Expr' 05:20:46 :t \x y z -> x $ y & z 05:20:47 (b -> t) -> a -> (a -> b) -> t 05:25:18 > f $ x & g 05:25:19 Could not deduce (Debug.SimpleReflect.Expr.FromExpr b0) 05:25:20 arising from the ambiguity check for `e_1' 05:25:20 from the context (Debug.SimpleReflect.Expr.FromExpr (b -> t), 05:25:20 Debug.SimpleReflect.Expr.FromExpr b) 05:25:20 bound by the inferred type for `e_1': 05:25:47 > f $ x & g :: Expr 05:25:48 No instance for (Debug.SimpleReflect.Expr.FromExpr b0) 05:25:48 arising from a use of `Debug.SimpleReflect.Vars.g' 05:25:48 The type variable `b0' is ambiguous 05:25:48 Possible fix: add a type signature that fixes these type variable(s) 05:25:48 Note: there are several potential instances: 05:25:51 > (f::Expr->Expr) $ (x::Expr) & (g::Expr->Expr) :: Expr 05:25:52 f (g x) 05:26:01 so simple!! 05:27:47 shachaf: i was really just checking if $ and & had the right fixities to be combined like that. 05:28:18 * oerjan was editing a stackoverflow answer 05:29:54 this one? http://stackoverflow.com/questions/21084178/using-lens-in-haskell-to-modify-values 05:30:47 -!- conehead has quit (Quit: Textual IRC Client: www.textualapp.com). 05:30:49 that doesn't even give the simple answer :'( 05:30:56 preflex: seen tel 05:30:56 tel was last seen on #haskell 25 days, 8 hours, 15 minutes and 48 seconds ago, saying: I'd like to annotate the expression with cofree, but both Bound and cofree want to use the same variable to recurse on 05:31:03 oh well 05:31:19 shachaf: my edit was adding the simple answer, i hope 05:31:39 it hasn't been approved yet, though 05:31:49 your edits need to be approved? 05:32:08 can i approve edits or do you need more superpowers for that 05:32:54 apparently i can review suggested edits but only random ones from who knows where 05:33:01 shachaf: i believe i need 2000 rep to get autoapproved, only have 480 yet 05:34:20 made a big jump today though 05:34:34 gameify quickly giving wrong answers to programming questions 05:35:33 i think this is the first time i try to edit someone else's answer, anyway 05:35:55 kmc: whoa, just like irc 05:36:31 shachaf++ 05:38:38 copumpkin: i get it 05:38:52 but i don't get Nu Maybe :'( what am i missing 05:39:01 what's to get? 05:39:09 shachaf: you need to get something fixed 05:39:15 why is my code so ugly 05:39:35 for addition and multiplication and all that 05:40:15 I could see multiplication being a huge pain to define in a total language 05:41:02 what is "correct" multiplication anyway 05:41:15 what's 0 * infty or infty * 0, both 0? 05:41:27 it might not even be possible! 05:41:37 wait, what's not possible 05:41:52 well, you could write that 05:42:04 the choices are all pretty arbitrary though 05:42:12 arbitrary things are the worst 05:42:40 -!- Phantom_Hoover has joined. 05:48:57 @src on 05:48:57 (*) `on` f = \x y -> f x * f y 05:49:53 i forgot that you can use infix operators as formal parameters 05:49:56 that's the fuckin' best 05:51:01 now my question is, how do i quote that in a stackoverflow comment. 05:51:48 (`` is used to start and end code fragments in SO.) 05:53:19 " the development isn't streamed, development rarely is" i've seen a lot of development streams? or, well, more like this is what we did this week. i guess they rarely stream the actual WHY IS THIS TURTLE SWIMMING BACKWARDS ARRRGH CORN, CORN EVERYWHERE. 05:53:53 shachaf: 0 * infty = 0 is standard in measure theory. 05:54:53 i don't think i've seen oklopol break quite that much before. 05:57:02 ok apparently you can use `` around code which contains ` 05:57:17 (`` ... ``, i mean) 05:57:53 fortunately i don't think `` is used in haskell. 05:58:01 oerjan: yes but that's how bad my code breaks. 05:58:12 "``" 05:58:41 mauke: AAAAAAAAAAAAAAAAAAAAAA 05:58:48 * oerjan hopes that won't show up 05:59:28 (*) `on` f = \x y -> f x * f y -- you can use `` around an identifier to infixify it 05:59:36 now with more real 06:00:39 {- "-}" " -} 06:00:58 this is why nested comments aren't 06:01:17 (haskell's aren't nested, ocaml's aren't comments) 06:04:24 whoops my edit was rejected 06:05:07 3:1 against 06:05:32 http://i.imgur.com/7nsdf1g.gif 06:07:07 -!- realzies has quit (Ping timeout: 272 seconds). 06:08:03 oerjan: how does measure theory work 06:09:18 made a comment instead. 06:09:52 i never measured a theory i didn't like 06:10:14 what's this about measure theory 06:10:38 -!- oerjan has quit (Quit: ZZZZ). 06:11:01 shachaf: it doesn't! it's not very constructive 06:11:07 which basically means it's all bullshit 06:11:16 copumpkin: things don't gotta be constructive, all right?? 06:11:32 like my criticism 06:11:34 ¬_¬ 06:11:42 anyway, maybe some topological thing has an answer to what it should be like? 06:11:45 constructive criticism is overrated 06:13:09 since the topology thing for infinity manages to behave similarly to the conatural infinity 06:13:25 copumpkin: how do you do topology constructively, anyway 06:14:20 fuckin constructivists 06:14:44 classical criticism 06:14:54 "your painting doesn't not suck" 06:15:39 constructive criticism is related to classical criticism in a similar way to how constructive logic is related to classical logic 06:15:50 if you are constructive you tell someone how to improve a thing 06:16:02 otherwise you're just saying an improvement exists 06:17:30 "you suck" 06:18:38 what if i say you suck so bad that no one (even your mother) can improve you. 06:18:51 then i guess it's not even classical 06:19:21 well, "improve" in the sense of "there exists something better" 06:19:42 -!- realzies has joined. 06:19:48 you ain't the top of the lattice, kid 06:20:05 copumpkin: is #haskell actually much worse on average than a few years ago or am i just more irritable 06:20:13 ok 06:20:26 shachaf: well, my attention has dwindled in the past couple of years 06:20:44 I guess I'd need specifics on what's bad, but nothing strikes me as particularly terrible 06:20:52 except for you and kmc constantly complaining about it :) 06:21:02 ok 06:21:23 but I really barely read it anymore 06:21:28 so it's quite possible it's abysmal 06:21:39 and I just happen to not notice 06:21:57 would you say it's worse than other major channels? 06:22:03 i don't know 06:22:16 major as in lots of people? 06:22:27 yeah 06:22:37 feels a bit like it's diluted with time 06:22:51 but most of the regulars I remember are gone 06:22:59 i only complain intermittently 06:23:29 would you say it's worse than other major channels? I'm genuinely curious to see a solid argument presenting what's bad about it 06:23:29 i don't know 06:23:46 even if you don't know how to fix it 06:23:53 I don't demand that criticism be "constructive" :P 06:24:15 that's a bullshit definition of "constructive criticism", anyway 06:24:18 :) 06:24:50 it's probably better than a lot of major channels, but that's no excuse 06:25:09 certainly not 06:25:25 just trying to quantify how bad you see it 06:25:58 yeah i've been in large channels with much bigger problems 06:26:15 the problems in #haskell are a lot more subtle and that's what makes them (somewhat) interesting to talk about 06:26:22 but I think I don't want to say very much about it right now 06:26:23 probably i'll just stop complaining and it'll be just as good 06:26:34 kmc: fair enough, but at some point I'd still like to see it 06:27:24 shachaf: well, if you can go into what you think is wrong I think that'd be helpful 06:27:30 not necessarily now either 06:27:33 since I'm tired too :P 06:28:24 it seems a shame for you to sweep your issues with it under the rug, but also a shame to try to deal with them without getting others to agree that they're issues in the first place 06:28:52 * copumpkin shrugs 06:28:55 too tired to be coherent 06:28:58 deal with them how? 06:29:08 I don't know! you comment on it a lot 06:29:13 mostly what i do is leave the channel for a while, or recently use /ignore 06:29:26 my /ignore list has 59 entries now, it's great :( 06:29:45 that doesn't seem optimal, assuming your long-term desire is to help it and/or improve it and/or be a part of it in some way or another 06:30:59 anyway, I dunno 06:31:15 need moar time :P 06:44:05 copumpkin: anyway, even addition is awkward 06:44:13 so i bet i'm missing something 06:55:38 -!- Slereah has quit (Read error: Connection reset by peer). 06:55:57 -!- Slereah has joined. 06:58:13 -!- Sprocklem has quit (Ping timeout: 246 seconds). 07:01:09 shachaf Should I spam you so you have an excuse to make it an even sixty? 07:01:32 Well, I don't /ignore that many people in here. 07:01:53 I could spam you in PM 07:02:09 with ascii art of feet 07:02:13 it's easy! Watch! 07:02:26 peapodamus: Please don't. 07:02:34 lol 07:03:55 -!- `^_^v has quit (Ping timeout: 260 seconds). 07:08:18 you can spam me 07:08:26 i like spam 07:08:36 makes me feel important 07:10:36 shachaf, am i on your ignore list 07:12:45 if the answer is "yes", how will you ever know 07:12:48 Phantom_Hoover: no 07:13:03 shachaf: do people on your ignore list ever use bots to harass you i.e. @tell shachaf 07:13:18 i doubt it 07:13:25 I have an assembler which allows a code section for a postprocessor, which is written in the same machine code that the rest of the program is; an emulator is included. The postprocessor code shares all symbol names with the main code, and uses the same macros, etc. Do you know of any other programs that have such a feature like this? 07:13:28 sometimes i take people off the list, too 07:13:53 it's not that they're terrible people or anything 07:14:29 also sometimes i look at logs 07:14:40 what does a postprocessor do 07:14:43 i shouldn't be talking about this so much, anyway 07:15:11 -!- tromp has joined. 07:15:20 kmc: It can modify the binary before writing it out to the file; it can also specify the format of the output file, and a few other things. 07:17:54 I find this feature useful, whether or not other people do. 07:19:33 -!- tromp has quit (Ping timeout: 248 seconds). 07:20:16 what do you use it for? 07:21:52 In this program I am working on now, the postprocessor fills in an identity table, fills in unused entries in a jump table (the used entries are created using macros), creates all the necessary tile variants in the pattern tables, and adds loop addresses to the music data. 07:22:38 In another program I have used it to output a custom header. Another purpose is compile-time debugging. 07:27:39 -!- FreeFull has quit. 07:32:57 compile-time debugging? how does that work? 07:34:33 "I don't get people who say this sucks because 'all it does' is give you mana... By that reasoning Basic Lands suck, good luck making a full 0 CMC deck that doesn't suck." 07:34:46 A deck that uses no mana? That seems interesting 07:37:37 Sgeo: Manaless Dredge is sometimes seen in Legacy 07:37:43 it needs no mana, and in fact can't generate any 07:37:55 and pretty much the only thing that interacts with it is graveyard hate 07:38:04 it's the only deck that people choose to play second against 07:38:20 because it literally can't do anything until it starts its engine going via discarding to maximum hand size 07:39:00 https://www.wizards.com/magic/magazine/Article.aspx?x=mtg/daily/deck/760 this? it looks like it can generate mana, and has a lot of mana-using cards 07:39:32 I should sleep 07:42:02 Sgeo: yeah, that 07:42:09 Dakmor Salvage is never actually /played/ 07:42:15 it's just there to be dredged 07:42:45 the only cards that are actually cast are Cabal Therapy and Dread Return, using the flashback costs 07:43:00 I guess you could play Cabal Therapy from Dakmor Salvage if you were desperate, and target yourself 07:44:48 -!- tromp has joined. 07:45:05 most of the cards in that deck are played for from-graveyard effects 07:48:35 "Play cards as written. Ignore all errata." 07:49:00 What happens to interrupts? 07:49:11 Or.... anything where there's been a terminology or rule change? 07:49:14 that's considered a game rule change, so they work like instants 07:49:19 also, http://www.starcitygames.com/magic/legacy/22324_Deck_Tech_NotQuiteManaless_Dredge_With_Nicholas_Rausch.html is an explanation of that deck 07:49:26 -!- tromp has quit (Ping timeout: 252 seconds). 07:49:30 "5/5 for turning Lotus Vale into Black Lotus" 07:49:31 o.O 07:50:01 the only magic thing i care about is that combo where you make the other player rip up all their cards 07:50:15 ++ 07:50:35 I know there's a card where you have to tear up that card to use it 07:50:45 yeah, it's in one of the joke decks 07:50:55 then you combine that with a duplicatey thing and a target switchy thing or suchlike 07:51:08 Bike: it doesn't actually work 07:51:13 you don't actually work 07:51:19 anyway: does anyone have an idea why a half life mod won't work on linux even though half life does 07:52:02 Bike: Perhaps you have to tap it first. 07:52:08 kmc: Compile-time debugging works by such thing as having a register $200A which is for standard I/O, so you can print diagnostic messages; the postprocessor can even copy the program it is compiling into its own RAM and execute it at compile-time (although the I/O registers and memory map are different, so it might not work) 07:53:02 I didn't know there is decks that don't generate any mana 07:53:19 if retrocomputing is a thing, is retrofuturecomputing also a thing, and is it what zzo38 does 07:53:48 "Retrofuturecomputing"? Is that a word? What exactly does it mean anyways? 07:54:26 maybe retrofuture computing would be Plan 9 and Haiku OS 07:54:51 bliip bloop 07:55:06 * oklopol makes future sounds 07:55:08 Do you make up any of your own Magic: the Gathering cards? 07:55:24 -!- ais523 has quit. 07:55:31 i've made some card games i guess, but never mtg 07:55:42 What card games? 07:56:02 -!- Phantom_Hoover has quit (Ping timeout: 252 seconds). 07:56:06 er, i don't know, crappy ones 07:56:38 http://www.mtgdeckbuilder.net/Cards/Details/UNG/69 + ignoring errata 07:57:03 i actually made one as a christmas present, but the rules of the game are stolen from another game (there was enough work making the actual cards) 07:57:29 (and by making i mean writing a short program to output pdfs and sending them to a paper company for printing) 07:57:41 (so actually there was very little work) 07:58:17 a friend of mine made a pretty nice card game, called something retarded like dork and doomed, don't recall 07:58:49 somewhat similar to whatsitcalled i guess 07:58:56 whatsitcalled = munchkin 07:59:40 -!- Sorella has quit (Quit: It is tiem!). 08:00:03 please don't use "retarded" as a pejorative 08:00:31 fizzie: good thinking 08:00:50 why not 08:01:01 should i not use gay either? 08:01:05 correct 08:01:13 k 08:01:32 i don't think it involves any engine modification, it's pretty much just an add on scenario. maybe half life can't deal with that w/o engine modification 08:02:25 (and that was voiced, and a pejorative, by the way) 08:02:39 voiced? 08:03:54 like, voiced and not aspirated 08:03:58 it's a gay joke 08:04:04 classy 08:04:06 yes 08:05:19 i do somewhat agree with you, but i believe that's only because i do not belong to a group that has an adjective like that, and it's racist to make life decisions based on your own race 08:06:12 what? 08:06:25 race in a very general sense 08:06:26 kmc: I think he's attempting the chewbacca defense? 08:06:44 is this gonna turn into one of those "i don't even see race" conversations i.e. "if I ignore injustice it will magically go away" 08:07:05 it's not "racist" to look at your own privilege and how you might fit into interlocking systems of oppression, on either end 08:07:28 it's funny to say that it is though 08:07:34 not really 08:07:45 maybe it's funny to you because it upsets other people? 08:07:48 i think we have a word for that behavior 08:07:51 maybe 08:07:56 -!- `^_^v has joined. 08:08:00 what's that? 08:08:02 trolling 08:08:19 okay 08:08:41 anyway you have a right to deliberately use language that upsets others, we also have a right to exclude you from our community if you do so 08:08:56 sure 08:09:52 is stupid okay? 08:10:08 or does it insult stupid people? 08:10:28 is idiotic okay already? 08:11:01 i probably wouldn't call you out on those 08:11:25 okay 08:11:35 I'm not some expert or some perfect example, the way I talk is still full of ableist language too, it's fucking pervasive 08:12:28 but I think avoiding "retarded" is now like a pretty mainstream position, not just a thing of touchy internet social justice people like myself 08:13:03 i agree, i still use it 08:13:44 but yeah it takes some effort nowadays, and perhaps i will have to learn something else some day 08:14:11 how bad do you consider "gay"? 08:14:23 as a pejorative? completely unacceptable 08:14:31 why would you even think that's okay... 08:14:59 because it's usually used pretty sarcastically 08:15:41 i don't really buy that 08:15:44 i mean in english at lesat 08:15:46 *least 08:16:03 well 08:16:30 perhaps i just feel that the finnish "gay" is worse because i've had the native experience with it 08:16:59 and okay, i completely buy that 08:17:34 I have made up some Magic: the Gathering cards, and also Yomi cards, Puzzle Strike cards, Pokemon cards, etc. I like the game of Pokemon card. It would be strange for "lose priority" to be a cost in a Magic: the Gathering, isn't it? 08:17:37 'sarcastically'? 08:18:10 like a kid could say that something is gay 08:18:10 maybe thing are different outside of american high school 08:18:20 i don't mean calling a human gay 08:18:36 because wouldn't you call them a fag if you wanted to insult them 08:18:47 if we're talking like 'man you're cheating! that's so gay!' i don't see how that's sarcastic 08:18:50 oklopol: but they're saying it's gay as a way of saying it's bad, implying gay = bad, do I really need to spell this out for fuck's sake 08:19:08 sure 08:20:14 i just don't really agree with the (i guess mainstream nowadays on the internet) opinion that that somehow influences how you actually feel about gays 08:20:52 just because you don't understand the influence doesn't mean it's there 08:21:02 maybe it's an opposite influence 08:21:48 anyway i gotta go learn to drive a car 08:21:54 eek. 08:22:10 anyway it's not just about *your* opinion of gay people, what about the gay kid who hears people on xbox live using "gay" as an insult constantly 08:22:13 I would think it improper to call "gay" in the way it often is. Sometimes homosexual people are called "gay", but apparently, it was originally due to male actors who were acting female characters in the play, so it could be used in that restricted sense. 08:22:45 seems like that'd have some effect on making their life more painful 08:22:54 and you're defending your decision to make their life more painful... why, exactly? 08:22:57 what makes it so worth it to you? 08:23:16 "making gay people feel awful and uncomfortable? but what about my straight feelings?" 08:23:30 err, i wouldn't say it to someone who might take it that way? 08:23:37 how the fuck do you know? 08:23:39 just like i wouldn't show my dick to a kid 08:23:52 by checking they're over 18 08:23:57 oklopol: how do you know I'm not a closeted gay kid who's terrified to come out to his parents? 08:24:00 or anyone else in this channel 08:24:22 i haven't used gay as an insult here, have i? 08:24:32 are you particularly sure that nobody in this channel is gay and being made rather uncomfortable by your attempted justifications of homophobia? 08:24:33 (i probably have, but not lately.) 08:24:33 no but you're defending the practice of doing so 08:24:47 but i'm not defending using it here! 08:24:49 lol 08:24:53 -!- impomatic has left. 08:24:56 anyway, see you 08:25:07 well that made no fucking sense at all 08:25:20 oklopol: yeah you should probably leave 08:28:04 I'm tempted to paste some 'grep -i oklopol | grep -i gay' results, but I guess that'd be kinda superfluous. 08:28:27 -!- Fiora has left. 08:29:40 There's also an example of fungot using gay as a pejorative, which is kind of bad. Where'd you learn such language, fungot? 08:29:40 fizzie: o(a constants) o(1)? i 08:30:16 -!- realzies has quit (Ping timeout: 246 seconds). 08:30:19 (Now *that's* a Chewbacca defense.) 08:31:42 Oh, I completely missed oklopol's further qualifying statement, thanks to being all grep. 08:38:51 -!- nycs has joined. 08:41:09 -!- `^_^v has quit (Ping timeout: 248 seconds). 08:42:48 * kmc sighs 08:42:58 I bet Fiora doesn't come back this time 08:43:17 can't really blame her 08:43:55 -!- realzies has joined. 08:57:33 Cursor moving now works in the Attribute Zone editor. 08:57:52 (The Famicom version, specifically) 08:58:22 what's the problem, oklopol said he wouldn't use her as an insult if she could hear it 08:59:41 Bike: i won't use slurs as insults if it would make anyone uncomfortable, I'll just talk about how great it would be if I *could* use them until everyone who *would* be uncomfortable leaves 08:59:45 good guy oklopol 08:59:49 so considerate of other people's feelings 09:04:40 -!- LinearInterpol has joined. 09:32:15 -!- MindlessDrone has joined. 09:36:37 -!- LinearInterpol has quit (Ping timeout: 248 seconds). 09:41:01 -!- qlkzy has quit (Quit: ZNC - http://znc.sourceforge.net). 09:41:25 -!- qlkzy has joined. 09:57:45 -!- Sellyme has quit (Ping timeout: 252 seconds). 09:59:43 -!- qlkzy has quit (Quit: ZNC - http://znc.sourceforge.net). 10:00:07 -!- qlkzy has joined. 10:00:07 -!- qlkzy has quit (Excess Flood). 10:01:14 -!- qlkzy has joined. 10:04:00 -!- qlkzy has quit (Client Quit). 10:09:10 -!- qlkzy has joined. 10:54:57 -!- nooga has joined. 10:55:52 -!- Phantom_Hoover has joined. 11:07:30 -!- impomatic has quit (Ping timeout: 245 seconds). 11:09:33 -!- stuntaneous has joined. 11:24:45 -!- Phantom_Hoover has quit (Read error: Connection reset by peer). 11:25:11 -!- Phantom_Hoover has joined. 11:27:13 -!- nooga has quit (Ping timeout: 272 seconds). 11:29:24 -!- nooga has joined. 11:53:02 -!- Sellyme has joined. 12:06:27 -!- yorick has joined. 12:16:27 Bike: how did it make no sense? 12:20:50 one very strong reason for i do not try very hard to be like you guys is that i'm strongly against this kind of ganging up on people 12:21:07 i don't exactly want to associate with such people too strongly 12:22:15 you the only group of people who bully other people openly 12:22:36 because you believe you are correct (which of course makes sense because you are) 12:24:36 *-for 12:28:40 (and i mean correct in your opinion, not your approach) 12:48:10 -!- Sgeo has quit (Read error: Connection reset by peer). 13:00:34 *+are 13:30:43 -!- Phantom_Hoover has quit (Ping timeout: 272 seconds). 13:56:37 -!- boily has joined. 13:56:43 -!- metasepia has joined. 13:56:50 good tarquin morning! 13:56:57 @messages-loûd 13:56:57 oerjan said 2d 14h 39m 5s ago: good breakfast morning! <-- so much better than the alternatives! 14:04:39 -!- nooga has quit (Ping timeout: 272 seconds). 14:08:18 -!- nooga has joined. 14:15:31 -!- conehead has joined. 14:25:09 -!- nooga has quit (Ping timeout: 253 seconds). 14:37:47 -!- Sorella has joined. 14:44:57 -!- LinearInterpol has joined. 14:47:45 @messages-lüüd 14:47:45 Unknown command, try @list 14:48:07 Stupid non-unicode-understanding bot :( 14:50:26 -!- nycs has changed nick to `^_^v. 14:51:08 i copypasted that in python and it was 0.99 sure that was EUC-JP 14:51:11 is that correct 14:51:40 what. 14:51:57 ü should be u with diaeresis 14:52:09 * FireFly eyes weechat suspiciously 14:52:32 it is that 14:52:37 Good 14:52:38 i mean that's how it shows on my scree 14:52:38 n 14:52:53 Pretty sure python is drunk 14:52:55 but i mean i called some sort of encoding detection function 14:54:41 od was GB2312 14:55:10 and >>> chardet.detect("rpklp") 14:55:10 {'confidence': 0.99, 'encoding': 'EUC-KR'} 14:55:20 (disclaimer: i have no idea what this function is) 14:55:54 Maybe its confidence is supposed to be 1 - stated value 14:56:56 EUC-KR? has anyone ever used that one? 14:57:46 apparently! 14:58:23 >>> chardet.detect("Mkkiomenahirikk.") 14:58:23 {'confidence': 0.87625, 'encoding': 'utf-8'} 14:58:26 apparently not! 14:59:19 >>> chardet.detect("aaaahrg!") 14:59:40 hmm. python. 15:00:13 yeah sorry just copypaste 15:00:26 i'm not a python bot 15:00:49 I can do it myself, just need to install a package. :) 15:01:08 {'confidence': 1.0, 'encoding': 'ascii'} 15:01:36 that's ... interesting. so 'ascii' means ASCII or anything that properly extends it ... 15:01:47 >>> chardet.detect("Supermummo.") 15:01:47 {'confidence': 1.0, 'encoding': 'ascii'} 15:03:10 so maybe confidence is just "i'm this confident that the input fits this encoding" 15:03:20 haha. ä -> EUC-KR, ö -> TIS-620, ü -> EUC-JP, all with 99% confidence. 15:04:13 i get the same 15:04:16 (Combining them into a single string gives utf-8 with 87.625% confidence.) 15:04:44 The guess is fine, but the 99% is ... well let's say strange. 15:07:52 oklopol is like myndzi. 15:08:02 and 87.625% sounds a bit low 15:08:04 i am? 15:10:11 . \o/ 15:10:11 | 15:10:11 /| 15:10:15 not at all. 15:11:15 . . 15:11:26 . . 15:11:37 . . . . 15:12:13 . O.o o_O \o_ O.O _o/ 15:12:13 | | 15:12:13 /< |\ 15:12:37 is there a list of myndzi patterns anywhere? 15:12:40 can you change your nick to something with 6 letters 15:13:01 I could, but I don't want to. 15:13:01 because xchat is mean 15:13:48 i need a myndzi compatible irc client 15:22:32 -!- susurrus has joined. 15:23:29 . \o/ O O 15:23:29 | 15:23:29 /´\ 15:25:25 oklopol: it's configurable so that it doesn't indent lines, IIRC 15:25:27 oklopol: there is an 'indent nicknames' option in the preferences, which you could disable. 15:25:32 -!- susurrus has quit (Client Quit). 15:26:25 wow 15:26:34 That was odd. 15:26:44 you're welcome ;-) 15:27:09 That's the danger of IRCing as root. 15:27:24 you believed that, too. yay! 15:30:20 blerp 15:30:24 ooh cool. 15:36:42 FireFly: I feel half bad for not having used a sandbox user :) 15:37:39 Haha 15:41:39 Oh. https://jira.atlassian.com/browse/CONF-32190 *is* cute. 15:42:12 -!- Bike has quit (Ping timeout: 245 seconds). 15:43:04 -!- Sorella has quit (Quit: It is tiem!). 15:43:45 -!- Sorella has joined. 15:52:19 -!- nooodl has joined. 15:52:41 -!- `^_^v has quit (Ping timeout: 246 seconds). 15:57:14 -!- Bike has joined. 15:57:39 Nice 15:58:27 oklopol: if you think you don't like being "ganged up on" in that three people on the internet are complaining about what insults you use, why don't you consider what it would be like to be so fucking dehumanized by a member of a majority that your minority identity is itself used as an insult 16:03:01 i have no particular opinion on whether "gay" should be used as an insult, and i'm pretty sure i have never used it as a serious insult (i know you don't care, but to me there's a bit difference) 16:03:16 s/particular/strong/ 16:03:31 i mean don't have a strong opinion when others use it 16:03:38 that's none of my business 16:03:39 don't argue you don't have an opinion after you argued about it for twenty minutes 16:04:47 how is it not your business? it's dehumanizing and bothers people. do you not have "a strong opinion" on racial slurs either? 16:05:21 i don't think that's quite what i argued 16:05:43 you just said "i don't have a strong opinion when others use it" 16:05:45 but yeah usually i try to argue for the minority side 16:05:51 except for right now? 16:05:56 because, i don't know? 16:06:08 what? 16:06:13 and normally you just love minorities but it's important to you that you can use them as insults 16:06:16 the minority side = people who use them as insults 16:06:18 here 16:06:22 are you shitting me 16:06:31 no 16:06:37 seriously, what the fuck. 16:06:51 you're not a fucking oppressed minority because you call things "gay" as an insult. 16:06:56 are you joking? 16:07:24 i mean that in a conversation, if people are arguing for x, i rarely try to defend x, i try to find arguments for !x instead 16:07:32 i don't mean i'm an oppressed minority 16:07:35 if I ever design a language, I'm going to include a "feature" whereby all identifiers of the form "{$s}or" are the same as the corresponding "{$s}our" 16:07:38 http://www.independent.co.uk/news/uk/politics/boris-johnson-says-superrich-are-putupon-minority-like-homeless-people-and-irish-travellers-8946661.html 16:07:51 wow that's so great you're a fucking robot just arguing for this on the basis i'm arguing against it 16:07:54 (seems relevant somehow) 16:08:19 well i don't quite see it that way 16:08:53 you don't seem to see much in any way, since you keep changing why you're arguing and everything else every time i rephrase it to call you a shithead 16:09:03 coppro: you should include -ize and -ise. 16:09:10 http://the-toast.net/2013/10/02/no-more-devils-advocate/ 16:10:11 int-e: good idea 16:10:37 well i don't think i've really changed my opinion much, i don't think i really said that i consider "gay" okay 16:10:45 scroll up 16:10:47 for god's sake 16:11:33 * LinearInterpol walks into this argument. 16:11:35 this conversation is stupid 16:11:37 LinearInterpol: don't 16:11:43 jesus 16:11:44 -!- nooodl has left ("Ik ga weg"). 16:11:51 well i agree that i shouldn't've tried to explain to kmc why it could be okay to call someone "gay" 16:12:02 i should've said "i agree, stupid question" 16:12:19 s/gay/homosexual 16:12:19 i guess i was annoyed at him 16:12:30 to this entire conversation. 16:12:38 what did he say that was so annoying 16:12:43 corrected me 16:12:49 for 'retarded'? 16:12:51 yes 16:13:00 why is that annoying 16:13:14 why is you being annoyed justification to use these stupid insults and defend their use 16:13:29 I understand. Being corrected does hurt. (Sigh, isn't this channel supposed to be about esoteric *computer* languages?) 16:13:33 well i'm not annoyed anymore 16:13:39 great well i am 16:13:59 * LinearInterpol turns 180 degrees and walks out. 16:14:00 i was annoyed at first, but yeah i do agree that i should not use that word 16:14:03 int-e: as if anyone but ais cares about being on topic 16:14:06 and he was right 16:14:23 you are infuriatingly slimy 16:14:31 ok 16:14:49 why? you basically made me agree with you? 16:15:12 "retard" "don't do that please" "actually, [defends usage for hours]" "what the fuck" "wait i actually agreed with you the whole time" 16:18:40 the fact that you two are arguing over the usage and etymology of a word or words saddens me. 16:18:45 you make me sad. 16:19:53 don't make me sad. :( 16:20:03 you won't like him when he's sad 16:20:10 yeah, I cry a lot. 16:20:11 words are, on occasion, important. and i'll keep your sadness in mind next time i see an argument about whether python is Really A Functional Language Or Not 16:20:39 Bike: functional as in it does something or functional as in the paradigm? because I'm debating both. 16:20:40 :) 16:21:24 as in programmers are notoriously ridiculously pedantic but when i object to a dehumanizing insult i'm just being weird 16:22:06 if we were pedantic in our everyday speech, our annoyance factor would increase exponentially. 16:22:28 rather, *exstensively pedantic. 16:22:30 LinearInterpol: As, indeed, it does. :) 16:22:43 words are words. 16:22:51 thankfully, it's really pretty rare that i feel the need to object to somebody's language, since most people are mildly empathetic enough to not curse like fourteen year olds on xbox live 16:23:03 -!- `^_^v has joined. 16:23:08 if I got offended over the use of a word you didn't take offense to.. 16:23:19 would you defend me in the same manner? 16:23:25 depends on the word 16:23:30 nerds! 16:23:33 should I use some 19th-century example? 16:24:13 * int-e lights the pyre. 16:24:30 i haven't been arguing not to use 'gay' because of its history, just that people are going to feel bad when their identity is used as an insult 16:24:41 something like 'lunatic' or whatever silly thing you're thinking of isn't really comparable 16:24:52 it was then. 16:24:56 it isn't now 16:25:05 it is the 21st century if you haven't noticed 16:25:10 and now we're back to etymology.. 16:25:34 plus, i'm actually mentally ill, i have some position to judge what is and isn't offensive as far as the euphemism treadmill of insanity goes 16:25:42 so am I. 16:25:45 so you can just stop right now if you would 16:26:06 I have the same position to judge as you do. 16:26:10 great 16:26:46 if you are offended, then I am sorry. those who offended you should apologize and be dealt with. 16:26:53 as is courtious. 16:27:12 if you actually find 'lunatic' offensive than sure i'd stop, but it seems pretty likely that you're just using an irrelevant example for rhetoric to justify calling things gay 16:27:32 never did I ever justify calling things gay. 16:27:50 never did I ever justify using retard. 16:27:56 then why are you arguing with me 16:28:30 I'm pointing out that you and oklopol bitching back and forth about the meaning and usage of a word is counterproductive to solving you being offended. 16:28:39 how is it counterproductive 16:28:45 because it does nothing to remedy it. 16:28:48 :\ 16:28:55 yes it does, it prevents gay people from being insulted 16:29:05 and are you gay? 16:29:16 me? no, but my friend fiora is and she was bothered enough to leave 16:29:54 well then I think she deserves an apology, as do you. 16:29:59 I don't think that arguing will ever prevent anything. 16:30:14 (and I don't think #esoteric is the place for it, unless it's about esolangs) 16:30:26 mountain dew is the best soda ever made. 16:30:29 * LinearInterpol runs for cover. 16:30:47 mrhmouse: "poltiically correct english" seems esoteric enough ;-) (sorry, could not resist.) 16:31:00 You people :P 16:31:09 what do you mean "you people"? :P 16:31:17 arguing about anything is pointless, knowledge is impossible, opinions are inbuilt into people and unchangeable 16:31:17 * LinearInterpol ducks. 16:31:43 * int-e bows to Bike's superior wisdom and shuts up. 16:31:53 all is void 16:31:54 Bike: so focus on solving your own notion of offense. 16:32:01 what does that mean 16:32:12 means find a way to make you happy when you're offended. :P 16:32:15 solve the situation. 16:33:12 arguing is like target practice, only you're not shooting for the bullseye, you're shooting for a mountain that's completely out of the way, and none of your arrows/bullets will ever reach it, and even if they do, you'll never see it. 16:33:22 i have come up with a solution, which is to tell people that they're being offensive, and then about half the time they'll stop because it isn't really a big deal for them, and the other half of the time i'll argue with them for hours and learn that in this situation only argument is impossible and pointless and i'm just being excessively pedantic 16:33:25 you could be shooting at the bullseye. 16:33:26 * mrhmouse admirs the zen of LinearInterpol 16:33:33 s/r/er 16:33:36 can we just shut up, i already admitted i was wrong (in pm, to Bike, at least). 16:33:48 * LinearInterpol bows and sits. 16:33:51 i will try to behave 16:34:08 i have been saying years that i'm an asshole and asked why i'm never called out on it 16:34:13 . o O ( https://www.youtube.com/watch?v=kQFKtI6gn9Y ) 16:34:14 now i was called out on it 16:34:20 and i will do something about it. 16:34:34 so yeah, about those esolangs. 16:34:52 sorry oklopol, argument is pointless, you have to be an asshole since you were born that way 16:34:58 tragic imo 16:34:58 :) 16:35:23 well fuck u 2 lol 16:35:30 that's the spirit. 16:35:42 beer for everyone! 16:35:47 yuck. 16:36:29 $ALCOHOLICBEVERAGE for everyone! 16:36:53 I can't have alcohol; is there an alcohol-free substitute? 16:37:06 $DRINK 16:37:10 $PREFERREDBEVERAGE for everyone! 16:37:20 there, now we can't go wrong. 16:37:23 v0.3 16:37:42 99 bottles of $PREFERREDBEVERAGE on the wall, 99 bottles of ${PREFERREDBEVERAGE}... 16:37:48 (Isn't it funny how a "drink" tends to be alcoholic...) 16:37:50 XD 16:39:28 take one down, pass it around, 16:39:53 98 bottles of $PREFERREDBEVERAGE on the wall. 16:40:13 btw, I recommend to call it $REFRESHINGBEVERAGE instead 16:40:27 isn't that copyrighted by Coca-Cola? 16:40:51 Nevermind, that's "the drink that refreshes" I think... 16:40:52 $NONCOPYRIGHTEDREFRESHINGBEVERAGE 16:41:03 $FOSB 16:41:12 $COSB 16:41:14 -!- itsy has quit (Client Quit). 16:41:18 COSB? 16:41:29 cosb. 16:41:36 Cold Open Source Beverages? 16:41:40 yep. 16:41:50 still can't believe those actually exist 16:41:59 Me either. 16:42:09 People apparently forgot about recipies. 16:42:12 tap water. 16:42:23 which classify as Free Open Source Food. 16:42:51 (I'm living in one of those privileged countries where tap water is actually drinkable.) 16:42:51 well, you can copyright them, people just pirate the shit out of them or use ones old enough to be public domain 16:42:54 much like jazz 16:43:16 (Me too.) 16:43:18 -!- nooga has joined. 16:44:19 (Me too, technically. I don't recommend it.) 16:44:48 I'm so far up north that nobody in the U.S cares. 16:44:56 Yet we're still classified as a state. 16:45:15 Great water up here. 16:49:03 -!- impomatic has quit (Ping timeout: 272 seconds). 16:53:29 I'm so far up North that I'm at Canada. 16:57:38 lol, hi boily. 16:59:00 how's the weather in your southernorth? 16:59:15 feels like spring. 17:05:29 -!- Bike has quit (Ping timeout: 252 seconds). 17:07:31 -!- Bike has joined. 17:16:18 -!- Bike has quit (Ping timeout: 276 seconds). 17:17:51 -!- Bike has joined. 17:40:31 ~metar EFHK 17:40:31 EFHK 131720Z 32007KT CAVOK M13/M16 Q1014 NOSIG 17:40:38 Very springy. 17:41:59 -!- ^v has joined. 17:44:05 ~metar KBGR 17:44:05 KBGR 131653Z 18008KT 10SM FEW200 06/M05 A2999 RMK AO2 PRESFR SLP157 T00611050 17:51:50 Here they keep doing those water quality lab tests, and the tap water keeps beating the commercial bottled options. 17:54:03 (Though apparently that's just because of chlorination and not sitting in storage for ages &c.) 17:58:02 -!- FreeFull has joined. 18:00:21 oklopol: dude it's not "bullying" or "ganging up" to politely mention to someone when they have (often unintentionally) hurt someone 18:00:34 people often respond with "oh i'm sorry" and then go on with their fucking lives 18:00:39 people who are not you, that is 18:01:33 * LinearInterpol dives for cover. 18:02:01 Hm 18:02:19 I just got an idea for IOCCC. I guess I'll have to try to remember it for half a year 18:02:37 FireFly: write it down! 18:02:41 LinearInterpol: the point of "arguing about words" is that words shape the entire fucking world we live in 18:02:57 oh for the love of.. we just stopped this man, don't bring it back up. :\ 18:02:57 it's totally disingenuous to say "you're just arguing about words!!!" when we are arguing about how human beings should treat other human beings 18:03:19 sigh, that's not what I meant.. 18:03:28 and especially, about how human beings in a position of social dominance should treat human beings who are historically oppressed, often to the point of lethal violence 18:03:58 look, all I was trying to say is that arguing is pointless, and that those two should get down to solving the problem of being offended with something akin to an apology. 18:04:12 * LinearInterpol exits this conversation. again. :\ 18:04:25 well I agree that arguing with oklopol is pointless 18:04:39 I have actually changed people's minds with discussion in the past, and I've definitely had my mind changed 18:04:48 I used to be a lot worse about this stuff!! 18:04:59 we all learn from each other and get better 18:05:25 I agree that by the time "discussion" progresses to "arguing" it's often of negative net value 18:05:34 If you have things to say, you can say it, but yes it is a good idea to try to learn better, instead. 18:05:39 being offended essentially means that someone essentially took something from you, and you want something equivalent in return that'll make you happy again. 18:05:51 I don't agree with that 18:05:55 such as an apology, or a gift, or something. 18:06:01 just something to quell the situation. 18:06:23 it sounds like you are more interested in smoothing things over than in making our community more kind 18:06:35 -!- FreeFull has quit (Ping timeout: 260 seconds). 18:06:44 if it makes everyone happy, then that means kindness. 18:06:50 no it really doesn't 18:06:57 drama over IRC sucks. 18:06:58 * LinearInterpol leaves. 18:07:14 "making everyone happy" usually means making people in a position of power happy and making marginalized people decide to stay quiet 18:07:17 i.e. continuing the status quo 18:07:20 -!- LinearInterpol has left ("Hack the planet."). 18:08:01 god forbid we should have a channel that's 99.5% straight white men instead of 100% 18:09:43 It shouldn't matter if the channel is 99.5% or 100% straight white men; it is a completely irrelevant situation! If it ends up being 45% then that should be OK too, but if it ends up being something like 263% or -10% then clearly we have a problem, isn't it? 18:09:53 :D 18:09:56 zzo38 you are the best 18:09:58 -!- LinearInterpol has joined. 18:10:03 wb LinearInterpol 18:10:06 we done? 18:10:11 * boily hands LinearInterpol a zzo38 18:10:20 * LinearInterpol fumbles about with it. 18:10:43 you sure ragequit and never came back over that drama 18:10:52 for a whole two minutes and thirty-eight seconds 18:10:58 it was a long forever, elliott. 18:11:14 had to take a bathroom break, too. god it was boring. 18:11:24 arguing is fundamentally irrational and since nobody actually has a serious problem it won't last,, see 18:11:32 I don't actually know about QUIT, but there was PART. 18:11:34 * LinearInterpol bashes his head on his desk. 18:11:51 LinearInterpol: How hard is the wood in your desk? 18:12:02 hard. 18:12:08 LinearInterpol: well I'm rapidly running out of fucks to give... if this is the kind of community y'all want to have then who am I to fight it 18:12:18 but, no, I- 18:12:23 Hard enough to break your head? 18:12:23 you're making assumptions. :( 18:12:29 zzo38: at this rate, yes. 18:12:31 assumptions based on what you are literally saying 18:12:43 ffs. 18:12:49 fine, you wanna do this, let's do this. 18:12:55 -!- ChanServ has set channel mode: +o elliott. 18:12:58 -!- elliott has set channel mode: +q *!*@*. 18:13:00 let's not 18:13:03 and say we did 18:13:05 -!- mrhmouse has quit (Quit: liek omg becky called me a name wtfbbq highschool is hard). 18:13:39 -!- LinearInterpol has left. 18:13:50 -!- FreeFull has joined. 18:15:24 -!- elliott has set channel mode: -q *!*@*. 18:15:26 -!- elliott has set channel mode: -o elliott. 18:16:05 thanks mrhmouse, really feeling welcome here 18:17:10 " well I agree that arguing with oklopol is pointless" i'm not sure what you guys actually want, i agree that i was wrong, why is that not enough? 18:17:23 ow, why does 'hg grep' consider the whole history of files by default ... 18:17:34 oklopol: nah, i'm done, thanks though 18:17:35 If it gets muted like that, post your message on #esoteric#shadow and then it will remain logged too 18:17:47 iint-e: I don't know. 18:18:01 Was there a reason for +q *!*@* instead of +m or was it just an arbitrary choice? 18:18:05 Can you tell it not to consider the whole history of files? 18:20:02 ok 18:21:31 meanwhile, https://github.com/Katee/quietnet doesn't work as well as thought. 18:24:13 ion: I wanted to know too, but now there is work-around regardless which way is done 18:24:56 (So hg grep does not do what I expected it to do. Fine. Back to grep -r then.) 18:26:39 oklopol: I missed your most clear admission that you were wrong, above 18:26:51 thanks for admitting it :) 18:29:30 boily: what's the use case for such a program, besides exfiltrating data to nearby servers? 18:30:21 int-e: no idea. the novelty is tempting, if only for a few minutes of relaxation between to tickets. 18:30:32 -!- FreeFull has quit (Ping timeout: 245 seconds). 18:32:01 -!- Sellyme has quit (Excess Flood). 18:33:03 -!- Sellyme has joined. 18:34:07 (I understand that the NSA has various technologies for bridging air gaps. Sound would be a fairly obvious choice.) 18:39:05 the POC uses PSK31. seems it needs two very close machines, with good quality audio equipment, and a noiseless environment for it to work reliably. 18:40:07 so, bridging the air is very unlikely, unless the NSA uses Secret Mutant Waves with Exceptional Compression. probably something tachyon based. 18:40:39 You never know with the NSA 18:42:46 How about that acoustic sidechannel thing? They got p. impressive results out of it, and that was just listening to the sounds of OpenSSL; it sounds rather likely that, with some active help from the server you're listening to, you could get better. (I mean, it doesn't have to be near ultrasound, it can be just some acoustic steganography.) 18:44:19 -!- stuntaneous has quit. 18:44:48 Sorry, GnuPG. 18:45:15 if it's acoustic classification, with a constricted domain, that has already been proved with very interesting experiments. 18:45:27 http://www.cs.tau.ac.il/~tromer/acoustic/ "plain mobile phone placed next to the computer, or a more sensitive microphone placed 4 meters away" next server at a colo place doesn't sound entirely infeasible. 18:46:06 I guess those maybe don't come with microphones. 18:47:39 The keyboard-keys-from-typing-sounds one was funky too. 18:48:28 the one were they went into a medical clinic and gleaned off plenty of private informations :D 18:48:40 -!- conehead has quit (Quit: Computer has gone to sleep.). 18:49:31 At one time I could tell from the noise if the CPU is busy; I replaced the power supply now though. 18:50:04 With proper soundproofing/filters can you avoid this? 18:50:14 I can tell from the noise if the CPU is busy; but that's just the fans spinning up in response to more heat. 18:50:28 can you put a tinfoil hat on your desktop? 18:50:37 -!- peapodamus2 has joined. 18:50:39 -!- peapodamus has quit (Ping timeout: 272 seconds). 18:51:14 "Conversely, a sufficiently strong wide-band noise source can mask the informative signals, though ergonomic concerns may render this unattractive." (Countermeasures section of the Q&A-format summary.) 18:51:39 "Why does your computer sound like a jet engine taking off?" "Oh, I'm just foiling NSA here." 18:51:47 “strong wideband noise source,” aka. “your cow orker's radio” 18:52:07 fizzie: Yes, I suppose the fans too, but I wasn't talking about fans. 18:55:48 -!- conehead has joined. 18:59:25 -!- Bike has quit (Ping timeout: 272 seconds). 19:00:40 -!- Bike has joined. 19:02:42 That reminds me of this "BadBIOS" thing from last year 19:03:02 http://arstechnica.com/security/2013/10/meet-badbios-the-mysterious-mac-and-pc-malware-that-jumps-airgaps/ 19:03:39 nice pic 19:05:01 so, what's the verdict on that? is it really real, or just an overhyped simili-scam? 19:06:03 Signs point towards "real" (see NSA toy catalogue) but I have not seen any final verdict. (Then again I have not really been paying attention.) 19:07:08 People who I trust when it comes to security-related questions seem to believe it's real, anyway, but I haven't been paying much attention either 19:07:13 And I'm not saying that this was the NSA, just that such technology does exist. It still sounds quite wild. At least USB thumb drives are a plausible attack vector. 19:08:25 i didn't think bios/uefi-eating malware was uncommon 19:08:44 remember also that the NSA catalog is 7 years old 19:09:24 Bike: it's the detail that this one bridges airgaps that makes it so interesting. 19:09:56 sure, the article just makes bios-eating sound uncommon in itself 19:10:33 The main thing is that we don't have tools for finding such malware. It could be in any of the busmaster capable hardware devices, virtually all of which have their own firmware. 19:10:49 throw your computer into a river 19:11:08 computer proceeds to vibrate at a particular frequency, thus infecting the entire river 19:11:14 Don't trust a computer you cannot throw out of the window directly into the river. 19:11:22 good advice 19:11:29 we all know that it takes a steel foundry to really destroy malware. 19:12:05 is the St-Lawrence River good enough? it's long, it's large, it has fish. 19:12:16 fish are a notorious attack vector 19:12:28 There's a church of St Lawrence along the road from me 19:13:32 when dna computing based storage drives incorporated as your appendix become common y'all are fucked, imma gonna attack that shit 19:14:25 don't you dare append me, you vile scoundrel! 19:14:58 but don't you see, boily... the appendix was in you all along 19:15:24 noooooooo! betrayed by my own body! damn you, internal organs and various tidbits! 19:15:31 maybe we need to replace our airgaps with vacuum gaps 19:15:52 -!- zzo38 has quit (Remote host closed the connection). 19:17:21 http://natsec.newamerica.net/nsa/analysis coo 19:19:18 it seems like these days, one should always guess UTF-8 if the input is valid UTF-8 19:19:44 how often will real world EUC-KR text happen to be valid UTF-8? 19:24:38 Well, I guess it's fair to guess ASCII if the input is also valid ASCII in addition to being valid UTF-8 19:25:16 it depends on the purpose for which you're making a guess 19:26:01 for most purposes i would rather guess UTF-8 because then you have *some* chance of handling high-bit bytes correctly 19:26:23 also because there is no code but Unicode and UTF-8 is its transport 19:26:28 I suppose 19:26:54 inch'Unicode! 19:27:12 iä iä 19:27:55 oh, shit. fish have a disease called 'whirling disease'. that owns 19:28:09 «Fish "whirl" forward in an awkward, corkscrew-like pattern instead of swimming normally, find feeding difficult, and are more vulnerable to predators.» 19:28:11 -!- peapodamus2 has quit (Read error: Connection reset by peer). 19:28:20 my computer virus is also a nematode 19:29:50 i guess it would be more appropriate for it to be a computer /worm/, huh. 19:30:06 -!- peapodamus has joined. 19:32:22 libchardet is a bit naive when it comes to probabilities. As far as I can make out, "ä" encodes an empty string; it's merely a "shift" token that switches a decoder into EU-KR mode. 19:33:11 EUC-KR. 19:35:45 and s/lib//; libchardet is a C++ thingy while I looked at the chardet Python thingy. 19:37:56 Then again, by the looks of it, one of them is a direct port of the other. 19:39:04 # Contributor(s): 19:39:05 # Mark Pilgrim - port to Python 19:45:50 -!- Phantom_Hoover has joined. 19:46:33 how much effort woul be needed to unnaïvify chardet? 19:47:53 you know the thing where people say things that you more or less agree with, but they're so annoying about it that you feel bad about having an opinion similar to theirs 19:49:30 yes 19:49:33 do you have an example? 19:50:25 probably rude and pointless to name anyone in particular 19:50:51 maybe past versions of myself. what an obnoxious person :( 19:58:29 boily: I don't know. For UTF-8, it takes 1 - (0.495)^n as the probability if only 0 < n < 6, where n is the number of characters (well, code points) parsed. That looks very ad hoc. For EUC-KR, it somehow uses character frequencies, but I have not figured out the details. So I don't know whether all those "confidences" are comparible. What's missing as well, I think, is some reasonable a priory distribution of character... 19:58:35 ...encodings, so that Bayes' theorem can be applied. 20:02:17 how about the universal prior 20:03:21 -!- Bike has quit (Ping timeout: 252 seconds). 20:04:25 int-e: the unnaïvification is untrivial, eh? 20:12:36 -!- MindlessDrone has quit (Quit: MindlessDrone). 20:17:45 -!- impomatic has quit (Quit: impomatic). 20:20:11 http://www.stephenwolfram.com/publications/short-talk-about-richard-feynman/ 20:20:34 wolfram pushes boundaries of scraping the bottom of the barrel, makes breakthrough 20:31:58 -!- Bike has joined. 20:32:09 "a priory", i like that 20:32:35 makes me imagine a bunch of nuns hard at work doing math 20:32:36 -!- ais523 has joined. 20:39:45 "In agro, in mathematica analysis complexam, certis de quavis ratione lineam moduli totum integrale est in complexu per vias plano." 20:40:08 'the quickest way to the reals is through the complex plane'? 20:41:57 who am I to question the Ways of our Complex Plane? 20:50:32 -!- Bike has quit (Ping timeout: 245 seconds). 20:51:11 -!- Sellyme has quit (Excess Flood). 20:53:34 -!- Sellyme has joined. 21:06:23 -!- jix has quit (Ping timeout: 252 seconds). 21:06:31 -!- jix has joined. 21:12:05 -!- atrapado has joined. 21:16:12 -!- Bike has joined. 21:17:20 -!- nys has joined. 21:20:39 -!- callforjudgement has joined. 21:21:40 -!- ais523 has quit (Ping timeout: 246 seconds). 21:22:09 -!- Sellyme has quit (Excess Flood). 21:24:03 -!- Sellyme has joined. 21:24:21 callforjudgement: I like your hobbies. 21:24:33 -!- callforjudgement has changed nick to ais523. 21:24:38 -!- Sellyme has quit (Excess Flood). 21:26:34 -!- Sellyme has joined. 21:28:20 really don't feel comfortable here anymore :/ 21:30:34 kmc: I left #esoteric a while back because it was no longer talking about esoprogramming 21:30:39 and I don't really feel comfortable in social channels 21:30:49 I put it back on autojoin, though, hoping that it had got better 21:31:45 if i leave it might solve both of our problems 21:33:21 kmc: you aren't really contributing to the problem, from my point of view 21:33:39 except inasmuch as any channel with more than like 3 people is going to have differing opinions on what are and aren't acceptable offtopic subjects 21:34:31 i'm mostly upset because we seem to value avoiding "drama" more than standing up to bigots 21:35:06 I missed whatever it is that happened 21:35:29 I feel that the best option, when possible, is to avoid giving people a chance to be bigoted in the first place 21:35:37 but sadly you can't really do that with lax topicality rules 21:36:24 -!- Sellyme has quit (Excess Flood). 21:36:34 -!- Sellyme has joined. 21:36:51 i asked oklopol not to use "retarded" as a pejorative and his response was to start defending the use of the word "gay" as a pejorative, even though he admits it's wrong, because he wanted to annoy me for being a "bully" 21:37:01 that's something which could easily come up in discussion of esolangs 21:37:10 for example if i call someone's esolang "retarded" 21:37:21 right 21:37:27 -!- ^v has quit (Remote host closed the connection). 21:37:28 the channel used to be a lot /worse/ in that respect, actually 21:37:40 but most of the offenders just left naturally 21:37:41 yeah, i've heard 21:38:43 I would prefer it if people just used accuracy in their pejoratives 21:39:17 something like "stupid" would be fine, IMO, but saying "retarded" just creates confusion while offending people at the same time, which seems strictly worse 21:39:24 *nod* 21:40:26 i'm frustrated less by oklopol (who admitted in the end he was wrong) and more by all the other people who were like "ugh DRAMA" or "you're just arguing about words", as though how we treat each other isn't important 21:40:58 kmc, if I was one of the annoying people I'm sorry 21:41:06 Taneb: I didn't observe you to say anything at all, but thank you 21:41:47 Also, on a completely different and probably more on topic note, I am still trying to see if I can get an audience in front of which I can create an esolang live 21:41:52 I have problems moderating small-ish channels like this, I'm more used trying to moderate a channel with 1000+ users without having mod powers 21:42:02 that sounds hellish 21:42:14 when you can normally assume that there will be some trolls/troublemakers who will try to make things worse no matter what 21:42:27 my normal approach is to attempt to drown them out, which involves making a distraction 21:42:40 all this doesn't actually work in #esoteric, but I normally attempt it anyway because habit 21:42:41 Taneb: target IBNIZ for extra nerd cred 21:43:16 Taneb: create an esolang, as in spec? interp? 21:43:30 Spec 21:44:42 hey hey guys i have an idea for an esolang 21:44:56 nys: go on 21:45:24 alright so the idea of languages like iota and jot and SK is to make the smallest number of primitives that you can construct everything else from, right? 21:45:42 nys: yes, functionally 21:46:33 what if the goal was instead to find a relatively small set of combinators that you could transform practical algorithms into compactly 21:46:44 nys: that's where SKI come from 21:46:51 sounds like golfscript 21:46:52 SKI isn't compact though 21:46:53 although it's not that compact 21:47:18 the concatenative languages aim for practical combinators, often 21:47:29 something like Underlambda, which is unfinished, from the eso side 21:47:32 or Joy from the non-eso side 21:47:56 ais523, how is Underlambda going, by the way 21:47:58 even Underload's combinators aren't too bad ( (), ^ and : are Turing-complete by themselves, the rest are basically just there to allow you to approach a sensible coding style) 21:48:05 Taneb: I haven't worked on it for a while 21:48:16 especially now that type system design (and thus language design) is my day job 21:48:22 i was thinking of searching exhaustively through the possible combinators for a particular program 21:48:34 that takes a lotta time 21:48:40 even for very basic programs 21:48:43 :< 21:48:50 also it's impossible in general, you provably can't compare functions in general 21:49:00 although you can in many practically useful special cases 21:49:16 see http://blog.regehr.org/archives/923 21:49:31 ais523, oh? Where/on what are you working? 21:49:32 i've only read the original paper tho 21:49:51 Taneb: Birmingham University 21:50:00 *University of Birmingham 21:50:52 actually, the "you can't compare functions" thing came up just a couple of days ago 21:51:17 circuit equivalence is decidable 21:51:30 thus, any language without decidable equivalence obviously is unsuitable for compilation into hardware 21:51:46 which is a really nice quick sanity check for rejecting possible type systems 21:52:39 wait what 21:53:47 digital circuit equivalence, that is 21:54:03 I'm not sure about analog, it probably is too but real numbers screw things up 21:54:27 one method that's inefficient but works is to convert the entire thing to a state machine 21:54:29 this is a world i was not aware of until just now 21:55:17 well if you have a function that just takes in an inductively defined datatype, aren't there only so many cases to prove equivalent results for? 21:55:44 nys: well one thing you can do is restrict the types of loops, by requiring all loops to be bounded in advance 21:55:51 e.g. by the size of the data type you passed in 21:56:06 if you do that, you have a "primitive recursive" function, equivalence is decidable for those 21:56:20 but nonetheless, a lot of practical programs work with primitive recursive functions only 21:56:29 is Y one of those? 21:56:46 no, Y can't be done with primitive recursion only, it needs general recursion 21:57:28 actually the point of the Y combinator is to show that untyped lambda calculus supports general recursion without the need for extra combinators/constants 21:57:34 -!- Sprocklem has joined. 21:57:45 -!- Bike has quit (Ping timeout: 272 seconds). 21:57:46 this problem is starting to not sound like a good match for an untyped kinda system :D 21:58:06 (btw, the Y combinator is a specific implementation of a fixed-point combinator; normally people use "fix" if referring to fixed-point combinators in general) 21:58:24 ah 21:58:42 i'm spotty in general 21:59:00 sort-of like the difference between a fast fourier transform and a discrete fourier transform 21:59:50 I have a 9:30 practical in the morning :( 21:59:51 also there are two different Y combinators, one for strict (call-by-value) semantics and one for non-strict (call-by-name) 21:59:58 Taneb: that's not a very practical time is it 22:00:13 kmc, it means I have to get up earlier 22:00:24 Oh wait that was a funny 22:00:27 Sorry, I'm tired 22:00:33 wow i didn't know the distinction between fft and dft until now either 22:00:50 kmc: wow, that's such a weird way of looking at the difference between call-by-value and call-by-name 22:00:59 I'm rather skewed on this because I work almost exclusively with call-by-name 22:01:26 and see call-by-value as sugar for creating an assignable variable and initializing it with your function argument 22:01:51 hm 22:02:06 in a system where assignment forces evaluation? 22:02:39 kmc: yeah 22:03:23 actually it's the only way to force evaluation atm, apart from the FFI 22:03:30 and the if statement 22:03:38 and the while statement 22:04:03 -!- Bike has joined. 22:04:04 speaking of which have you heard of that thing showing how you convert an evaluator into an abstract machine or back? 22:04:22 futumura projections? 22:04:25 most languages also have strict arithmetic because they want to use machine arithmetic 22:04:30 but it's not the only way to do arithmetic 22:05:02 kmc: the implementation we're working on is a bit weird, we use hardcoded connections between circuits 22:05:34 which basically means that we can't have any values more complex than integers 22:05:46 -!- FreeFull has joined. 22:07:59 -!- tibuda has joined. 22:08:26 -!- tibuda has left ("Saindo"). 22:10:29 we have a paper where we implemented a recursive Fibonacci on this thing 22:11:02 it's even less efficient than the normal recursive Fibonacci because it has to go and subtract all the 1s from the argument over and over again 22:11:13 heh 22:11:44 we managed to get it published anyway though 22:12:02 i like that recursive fib is an example of an algorithm where computing f(n) takes f(n) steps 22:12:04 lol 22:12:07 http://www.cs.bham.ac.uk/~drg/papers/icfp11.pdf 22:12:16 kmc: isn't that connected to euclid's algorithm somehow 22:12:31 or maybe just the golden ratio. it's e-y 22:12:54 the closed form formula for fib(n) uses φ yeah 22:13:04 kmc: isn't that true of pretty much any algorithm that just forms numbers via adding up 1s? 22:13:15 sounds like it 22:13:23 Doesn't f(n+1)/f(n) approach phi in the limit? 22:13:33 Taneb: yes 22:13:49 this is because φ²=φ+1 22:14:00 well i mean, i know that, i'm trying to remember if this is connected to the time complexity bit 22:14:29 -!- mrhmouse has joined. 22:14:43 i have half a blog post written about learning linear algebra via one of the less stupid fib algorithms 22:15:01 > let fibs = fix ((0:) . scanl (+) 1) in (fibs !! 1000) / (fibs !! 999) 22:15:01 the closed form formula for fib(n) uses φ yeah 22:15:02 1.6180339887498951 22:15:06 the stupid one is one of the better recursion benchmarks, though 22:15:10 also the other solution to that one equation 22:15:24 > (1 + sqrt 5) / 2 22:15:25 1.618033988749895 22:15:34 wow pretty close 22:15:42 does that converge slow? 22:15:46 like the rational approximations do 22:15:58 > 13/5 22:15:59 2.6 22:16:01 Wait 22:16:05 > 13/8 22:16:06 1.625 22:16:06 gj 22:16:13 > 21/13 22:16:14 1.6153846153846154 22:16:22 > 34/21 22:16:23 1.619047619047619 22:16:38 I don't actually know how fast convergences generally are 22:16:48 -!- nooodl has joined. 22:17:19 well, like, the contfrac for phi is 1/(1+1/(1+1/...)) and that gives the best rational approximations 22:17:22 however, they all suck 22:17:33 ~eval 1 + 1 / (1 + 1 / (1 + 1 / (1 + 1 / 1))) 22:17:36 Error (1): 22:17:38 ~eval 1 + 1 / (1 + 1 / (1 + 1 / (1 + 1 / 1))) 22:17:39 1.6 22:17:43 like that 22:17:58 > let f x = 1 + 1/x in iterate f 1 22:17:59 [1.0,2.0,1.5,1.6666666666666665,1.6,1.625,1.6153846153846154,1.6190476190476... 22:18:09 hey, two significative numbers is pretty good in my book. 22:18:12 i like how it goes up and down 22:19:38 oh, the other thing I liked in that paper, was that I got to use Algol 60 for a serious reason, even though it was 2011 22:19:49 :) 22:20:37 my supervisor was surprised that I managed to get hold of a working Algol 60 compiler after this long 22:20:48 let's see, the square root of two is [1;1,2,1,2,1,2,...] i think, how do you haskell that 22:21:02 > 1 ++ cycle [1,2] 22:21:03 No instance for (GHC.Show.Show a0) 22:21:03 arising from a use of `M60779866017779691048889.show_M60779866017779691048... 22:21:03 The type variable `a0' is ambiguous 22:21:03 Possible fix: add a type signature that fixes these type variable(s) 22:21:03 Note: there are several potential instances: 22:21:07 er no it's [1;2,2,2,2] maybe 22:21:13 yes. 22:21:20 except with a bajillion 2's obv 22:21:26 lambdabot: that's a really useless error message 22:21:31 > 1 : cycle [2] 22:21:32 [1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2... 22:21:37 oh right 22:21:38 > let f x = 2 + 1/x in iterate f 1 22:21:39 [1.0,3.0,2.3333333333333335,2.4285714285714284,2.411764705882353,2.414634146... 22:21:47 Not like that 22:21:51 noted 22:21:55 the problem being that lambdabot had enough definitions floating around that it could somehow concatenate an int to a list? 22:22:04 :t ++ 22:22:05 parse error on input `++' 22:22:06 :t (++) 22:22:07 [a] -> [a] -> [a] 22:22:14 > map (\x -> 1 + 1 / x) $ iterate (\x -> 2 + 1 / x) 1 22:22:15 [2.0,1.3333333333333333,1.4285714285714286,1.411764705882353,1.4146341463414... 22:23:03 see, those are p. good 22:23:39 > let f x = 1 + 1/x in iterate f 1 !! 1e6 22:23:40 Could not deduce (GHC.Real.Fractional GHC.Types.Int) 22:23:40 arising from the literal `1e6' 22:23:40 from the context (GHC.Real.Fractional a) 22:23:40 bound by the inferred type of it :: GHC.Real.Fractional a => a 22:23:40 at Top level 22:23:45 > let f x = 1 + 1/x in iterate f 1 !! 1000000 22:23:46 *Exception: stack overflow 22:24:58 > let sums = map (foldr (\x y -> x + 1 / y) 1) . inits in sums (1 : repeat 2) 22:24:59 [1.0,2.0,1.3333333333333333,1.4285714285714286,1.411764705882353,1.414634146... 22:25:28 @let sums = map (foldr (\x y -> x + 1 / y) 1) . inits 22:25:29 Defined. 22:25:30 hth 22:25:39 > sums (1 : cycle [1,2]) 22:25:41 [1.0,2.0,1.5,1.75,1.7142857142857144,1.7333333333333334,1.7307692307692308,1... 22:25:45 > sqrt 3 22:25:47 1.7320508075688772 22:26:11 ) (1 + %)^:(<10) 1 22:26:12 FireFly: 1 2 1.5 1.66667 1.6 1.625 1.61538 1.61905 1.61765 1.61818 22:26:35 -!- boily has quit (Quit: FLYING CHICKEN!). 22:26:37 -!- metasepia has quit (Remote host closed the connection). 22:26:43 ) (1 + %)^:1e6 ] 1 22:26:44 FireFly: 1.61803 22:27:00 > let convergents = sums 22:27:01 not an expression: `let convergents = sums' 22:27:08 @let convergents = sums 22:27:09 Defined. 22:27:51 -!- atrapado has quit (Quit: Leaving). 22:27:51 https://en.wikipedia.org/wiki/List_of_letters_used_in_mathematics_and_science this is great 22:28:41 Um 22:28:45 Isn't there another similar list somewhere? 22:28:50 On Wikipedia I mean 22:29:07 Bike: now you gotta turn it into a song 22:29:17 i'm no lehrer. 22:29:19 i also saw Ш used for a pulse train i.e. a function f(x) which takes on the value 1 on a set of measure zero and 0 elsewhere 22:29:22 v. cute 22:29:26 ha. 22:29:34 https://en.wikipedia.org/wiki/Latin_letters_used_in_mathematics 22:29:43 Seems a bit.. redundant? 22:30:30 probably arabic letters have been used in algebra 22:30:35 but i'm not sure 22:30:40 what about https://en.wikipedia.org/wiki/Boxcar_function 22:30:41 maybe they used greek out of Tradition 22:31:18 i don't think algebra was symbolic enough during the persian period 22:31:31 they'd write out "a quantity divided by four" or wetf 22:31:42 -!- mrhmouse has quit (Quit: Leaving.). 22:32:08 ah 22:32:23 (oh was it from persia and not arabia? same script i guess, anyway) 22:32:33 probably both 22:32:45 better than hindustan though, where they'd write it out in verse 22:32:48 how's that for eso 22:33:21 -!- atrapado has joined. 22:33:53 http://31.media.tumblr.com/db46eea7c7b668193a6a7dbf4e9f636b/tumblr_mzbi1t3gol1rb9lj8o1_1280.png in doge news 22:36:27 is that ''real'' 22:36:56 is ''real'' ''real'' 22:37:06 i read one of the three books you gave me to read 22:38:56 which one 22:39:15 The Eye in the Pyramid 22:39:36 were the other two also illuminatus 22:40:03 yes 22:40:20 but somehow starting the second one is more effort than continuing to a new chapter 22:41:07 my illuminatus copy has all three in one, very convenient 22:41:24 so does this one 22:42:00 o 22:42:22 "India is marking three years since its last reported polio case, a landmark in the global battle against the disease." 22:42:32 sweet 22:42:39 isn't it still bad in... pakistan? i wanna say pakistan 22:43:05 afghanistan, nigeria, and pakistan 22:43:12 I'd sort of guess some "first world" country getting polio back due to vaccination paranoia 22:43:53 well, you need to have some extant polio for that, and it's pretty totally eradicated in many countries 22:44:25 yeah I think we're a long way from that still 22:44:55 there are other disases already coming back for that reason, though :/ 22:45:20 the cdc says that there hasn't been a polio case in the US since 1979 22:45:37 i don't think the virus sticks around in animals and stuff like, say, plague, which is still extant in the US 22:47:01 " Poliovirus is however strictly a human pathogen, and does not naturally infect any other species" yeah 22:52:09 -!- oerjan has joined. 22:56:00 that's convenient 22:58:01 of course, HIV is the same way, and that's been kind of hard to eradicate >_> 23:00:53 yeah well at least it can't be spread through contaminated food or water 23:01:55 eradicating polio in Pakistan is harder because the Taliban keeps killing the medical workers 23:02:08 Bike: well i suspect some apes may be included too. but they're probably not a major infection source at this time. 23:03:15 also, you've missed syria; polio has reappeared there during the war. 23:03:19 :/ 23:03:38 -!- Bike_ has joined. 23:04:25 oerjan: HIV is a mutant of the one that infects chimps 23:04:37 -!- Bike has quit (Ping timeout: 272 seconds). 23:04:44 oerjan: and yeah i heard about that, i was just glancing at a WHO page. i don't think it's actually epidemic there though? just like, a problem 23:04:47 -!- Bike_ has changed nick to Bike. 23:07:29 of course, HIV is the same way, and that's been kind of hard to eradicate >_> 23:07:33 can't vaccinate though 23:07:58 not yet 23:08:04 :) 23:08:09 vaccination means you can eliminate transmission in the human population, not being a zoonosis means there aren't any animal reservoirs to pop up after the vaccination passes over 23:08:22 (why am i saying this you surely know better than i) 23:08:46 yeah, i was just thinking of zoonosis 23:09:03 i wanted to come up with an example that was actually a virus, i mean plague is bacteria, or somethin 23:09:43 pig flu, bird flu, zebra flu, etc 23:10:24 flu flu 23:10:28 well those are species-specific too, they just mutate 23:10:37 there are virusy things that infect viruses, i think. weird shit 23:11:51 what's the current hip recursion meme, i think yo dawg and inception have both gone stale 23:12:25 maybe recursion memes have gone stale 23:12:29 -!- atrapado has quit (Remote host closed the connection). 23:12:37 maybe we don't need another one 23:12:45 also stuff like https://en.wikipedia.org/wiki/Viroid 23:12:46 there's some liquid water in my kitchen at 120°C 23:12:47 we will always need recursion memes 23:12:53 maybe we can make it a meme that recursion memes have gone stale 23:12:56 my chemistry textbook described viruses as "large molecules" which kind of rules 23:12:59 kmc, throw sand at it 23:13:04 Phantom_Hoover: yo dawg i heard you like recursion memes 23:15:49 * oerjan suddenly imagines little nanobot drones flying around vaccinating wild birds against flu 23:16:23 i suppose micro or milli may also do 23:16:48 -!- atrapado has joined. 23:16:53 bees 23:16:57 bees with vaccine stings 23:17:00 they could look like mosquitos, and handle malaria at the same time 23:17:16 the vaccine is also mosquito poison 23:17:40 Eradicate mosquitoes by 2050 23:17:43 you don't need to eradicate mosquitos if you eradicate malaria. of course you may want to anyway. 23:19:14 Bike: you're a large molecule 23:19:46 viruses that infect viruses? what? 23:20:12 oerjan: there might be nasty ecological consequences to eradicating mosquitos 23:20:21 https://en.wikipedia.org/wiki/Satellite_virus 23:20:41 it's um... once you get down to this level everything gets very blurry 23:20:41 kmc: which is why i didn't suggest it. well also a slight romantic disgust of eradicating species. 23:20:46 remember when mao tried to eradicate sparrows because they eat the crops and it turns out they also eat locusts which eat the crops way harder 23:21:10 359 nucleotides wow 23:21:21 yeah 23:21:50 Tomato bushy stunt? Turnip crinkle? 23:22:04 kmc: i suppose that's part of his 30% bad hth 23:22:52 some of you incl ais523 might like https://twitter.com/fbz/status/422844456958971904 23:23:09 thanks for the direct link 23:23:15 oerjan: only 30% bad? 23:23:16 the #! nonsense has a tendency of not working properly 23:23:24 oh I haven't seen the #! nonsense in a while 23:23:44 kmc: that's official! 23:23:49 maybe they got rid of it 23:23:51 I hope they did 23:24:36 kmc: tobacco mosaic, being the first virus found, has a ton of research on it, and i guess it was easiest to spread out into other plants 23:25:39 yep 23:26:31 is there a mosaic virus that does rule 110 patterns twh 23:26:46 https://en.wikipedia.org/wiki/File:Textile_cone.JPG 23:29:38 model species are so weird, i have a book on muscle that uses a lot of rabbit psoas, and guess what the lab i'm working in does twenty years later 23:35:21 what's rabbit psoas? a kind of stew? 23:36:43 i like stew but i prefer stew made without rabbits or psoas 23:37:24 olsner: filet mignon 23:41:47 that makes me think of rabbit phoas or rabbit ptas 23:44:16 rabbit phở 23:44:25 nom 23:44:44 Việt Nom 23:44:48 -!- Sgeo has joined. 23:44:50 hi Sgeo 23:46:45 the psoas is a muscle in the back that is also filet mignon 23:49:19 this is 23:49:23 no 23:49:24 nothing 23:49:34 actually i'm pretty pissed off 23:53:30 why, it's tasty 23:53:47 -!- Sellyme has quit (Excess Flood). 23:56:33 -!- Sellyme has joined. 2014-01-14: 00:01:48 -!- atrapado has quit (Quit: Bye). 00:20:25 olsner: what's a swedish rabbit who thinks everyone should listen to a bit of carmina burana 00:21:20 hmmmmm i have some bacon wrapped filets mignon in my freezer hmmmmmmmmmmmmmmmmmmm 00:22:19 2 lazy 2 cook 00:24:07 * oerjan thinks olsner might be idle. 00:25:22 i want to know the answer! 00:25:40 even though you don't know swedish? 00:26:12 that's a risk i'll just have to take 00:26:27 it's "lagom orff" hth 00:27:09 whoa, whoa, whoa, did you know that monomorphisms and epimorphisms are both a form of injectivity thing 00:27:17 ie injective and surjective functions 00:27:42 in particular "f is injective" means "(f .) is injective" and "f is surjective" means "(. f) is injective" 00:28:10 whoa 00:29:41 (except this works in any category, not just (->), otherwise it would be a silly definition) 00:30:10 -!- prooftechnique has joined. 00:30:31 and when they're surjective you get something stronger (but backwards) 00:30:34 shachaf: it disturbs me that two of your three commas are bolded 00:31:02 do bold spaces disturb you 00:31:06 no 00:31:13 the whole phrase is bolded. "whoa, whoa, whoa" is atomic 00:31:49 anyway if (f .) is surjective then f has a left inverse?? and (. f) -> right inverse? or something like that 00:31:50 I'm a Cablevisionary! 00:32:56 (Note: I'm not actually that excited about the cutesy name for Cablevision employees) 00:33:03 I just discovered that my classic, 81 Mercedes C123 coupe has its left wind welded into the ramp 00:35:01 i keep thinking that you are nooodl and then i realize that you are not nooodl so who even are you 00:35:07 names are confusing 00:35:17 sigh 00:35:29 grep logs 00:35:32 but nooodl would never say a thing like that. what's a wind anyway 00:35:42 wing* 00:35:51 i can't grep logs. no logs 00:36:04 http://tunes.org/~nef/logs/esoteric/ ? 00:36:12 no grep 00:36:31 wget them all and then can and grep 00:36:31 -!- glogbackup has quit (Remote host closed the connection). 00:36:34 cat* 00:36:36 ffs 00:36:49 what would i discover 00:37:06 hichaf 00:37:15 what IS a wind 00:37:22 wing 00:37:45 nooodl: we just don't know 00:37:45 hth 00:38:17 shachaf: you'll discover that I haunted this # for a long time 00:38:36 9-10 years maybe 00:38:50 i don't disbelieve you 00:38:55 cool 00:38:57 what about it 00:39:14 oh just grep the logs and infer who am I from it 00:41:49 wait 00:42:15 maybe this isn't the best idea 00:43:22 anyway, who's noodl? 00:43:46 anyway if (f .) is surjective then f has a left inverse?? and (. f) -> right inverse? or something like that 00:43:53 sounds about right 00:44:10 getting identity and getting everything seems equivalent 00:45:54 (Note: I'm not actually that excited about the cutesy name for Cablevision employees) <-- do you have a company anthem twh 00:47:30 gob gob 00:47:42 shachaf: nooga is the pole, that's easy to remember. 00:47:48 ha! 00:48:01 oerjan never fails 00:48:03 we've had other poles in here 00:48:06 or have we? 00:48:08 asiekierka? 00:49:28 shachaf: tbh i don't know who are you, you must be new here then 00:50:05 yes, i'm new 00:50:12 `? nooodl 00:50:14 noooodl is the correct spelling 00:50:22 `? noooodl 00:50:24 noooodl? ¯\(°​_o)/¯ 00:50:28 :'( 00:51:16 imo add a special case to bin/? for no+dl 00:51:32 there is one, but maybe not in the sense you want 00:51:46 you mean the one for output? 00:51:50 yeah 00:51:54 that is not no+dl 00:52:14 `cat bin/? 00:52:16 ​#!/bin/sh \ topic=$(echo "$1" | lowercase | sed "s/ *$//") \ topic1=$(echo "$topic" | sed "s/s$//") \ cd wisdom \ if [ \( "$topic1" = "ngevd" \) -a \( -e ngevd \) ]; \ then cat /dev/urandom; \ elif [ -e "$topic" ]; \ then cat "$topic" | rnooodl; \ elif [ -e "$topic1" ]; \ then cat "$topic1" | rnooodl; \ else echo "$1? ¯\ 00:52:20 it's no{3,9}dl or something 00:52:25 `cat bin/rnooodl 00:52:26 perl -pe 's/nooodl/"n@{[o x(3+rand 7)]}dl"/ge' 00:52:39 where are those prety graphs derived from the logs 00:52:49 nooga: ask fizzie 00:52:51 AFAIR fizzie made them 00:52:56 oh yes 00:53:14 somewhere on zem.fi 00:53:22 thx 00:53:44 `log zem[.]fi 00:54:16 No output. 00:55:08 hah, can't find them 00:55:08 `run sed -i '2s!s/!s/no\+dl/nooodl/;s/!' bin/? 00:55:13 No output. 00:55:21 hm oops 00:55:23 -!- glogbackup has joined. 00:55:26 `cat bin/? 00:55:27 ​#!/bin/sh \ topic=$(echo "$1" | lowercase | sed "s/no+dl/nooodl/;s/ *$//") \ topic1=$(echo "$topic" | sed "s/s$//") \ cd wisdom \ if [ \( "$topic1" = "ngevd" \) -a \( -e ngevd \) ]; \ then cat /dev/urandom; \ elif [ -e "$topic" ]; \ then cat "$topic" | rnooodl; \ elif [ -e "$topic1" ]; \ then cat "$topic1" | rnooodl; \ el 00:55:37 darn 00:55:40 `revert 00:55:44 Done. 00:55:54 `run sed -i '2s!s/!s/no\\+dl/nooodl/;s/!' bin/'?' 00:55:58 No output. 00:56:04 `? noooooooooodl 00:56:06 noooooooodl is the correct spelling 00:56:21 bash... 00:56:21 `? nodl 00:56:23 nooooooodl is the correct spelling 00:56:25 can I `run perl -e "fork while fork" ? 00:56:28 `? noooooooooooooooooooooooooooooooooooooooooodl 00:56:30 noooooooodl is the correct spelling 00:56:40 is the correct spelling random? 00:56:44 yeah 00:56:48 ais523: correct 00:56:54 is it ever the same as the original query? 00:57:43 It's between 3 and 9 os, I think? 00:57:47 `run cat bin/rnooodl 00:57:48 perl -pe 's/nooodl/"n@{[o x(3+rand 7)]}dl"/ge' 01:00:39 `run ls wisdom/n*dl* 01:00:41 wisdom/nooodl 01:01:51 `cat bin/? 01:01:52 ​#!/bin/sh \ topic=$(echo "$1" | lowercase | sed "s/no\+dl/nooodl/;s/ *$//") \ topic1=$(echo "$topic" | sed "s/s$//") \ cd wisdom \ if [ \( "$topic1" = "ngevd" \) -a \( -e ngevd \) ]; \ then cat /dev/urandom; \ elif [ -e "$topic" ]; \ then cat "$topic" | rnooodl; \ elif [ -e "$topic1" ]; \ then cat "$topic1" | rnooodl; \ e 01:02:18 `run sed -i '2s/no/noo/' bin/\? 01:02:22 No output. 01:02:27 `? nodl 01:02:28 shachaf: what, why? 01:02:29 nodl? ¯\(°​_o)/¯ 01:02:30 `? noodl 01:02:31 noooooooodl is the correct spelling 01:02:35 looks like something is broken 01:02:41 because one o is just broken 01:02:44 don't you think? 01:02:48 oh well ok 01:03:12 `learn nooodles are the invention of the chinese. they were brought to europe by marco polo, a distant ancestor of taneb. 01:03:17 I knew that. 01:03:26 hah 01:03:31 `? noooooooodles 01:03:33 noooooodles are the invention of the chinese. they were brought to europe by marco polo, a distant ancestor of taneb. 01:03:36 i've set up highlights on /no+dl/ before. people have called me nodl before as a result! history repeats itself 01:03:49 `? ndl 01:03:51 ndl? ¯\(°​_o)/¯ 01:04:18 oerjan: what's with not capitalizing wisdom entries 01:04:41 shachaf: rnoodle isn't case insensitive 01:04:44 i think 01:05:03 erm 01:05:06 rnooodl 01:05:30 `? nooga 01:05:32 nooga hate OS X. NOOGA SMASH. Hug not allowed. 01:05:35 wtf? 01:05:37 shachaf: namespacing 01:05:46 programmers use caps conventions for namespacing all the time 01:06:02 so in the future, we can make `? ALLCAPS do something completely unrelated to wisdom, for instance 01:06:09 -!- Sorella has quit (Read error: Connection reset by peer). 01:06:11 ? 01:06:15 I'm talking about the text, not the file name. 01:06:35 that's namespaced too, so if it's written in sentencecase, you know it's sarcastic, or something 01:06:47 ais523: ? _is_ case insensitive. 01:07:16 sure, have you ever seen an uppercase '?'? 01:07:28 `? NoOoOdL 01:07:30 nooodl is the correct spelling 01:07:32 -!- glogbackup has quit (Remote host closed the connection). 01:07:53 bye glogbackup 01:07:55 `run sed -i 's/n/N/;s/ t/ T/;s/taneb/Taneb/' wisdom/nooodles 01:07:56 sed: can't read wisdom/nooodles: No such file or directory 01:08:01 `run sed -i 's/n/N/;s/ t/ T/;s/taneb/Taneb/' wisdom/noodles 01:08:02 `cat bdsmreclist 01:08:03 sed: can't read wisdom/noodles: No such file or directory 01:08:04 YOU are out of order. 01:08:07 what? 01:08:11 help 01:08:32 `run echo wisdom/*odl* 01:08:34 wisdom/nooodl wisdom/nooodle 01:08:36 just as a hint, if an op goes and edits something to say you shouldn't do it 01:08:46 you should probably take the hint 01:09:28 Wait, what? 01:09:32 what? 01:09:50 Which hint did I miss? 01:09:58 oerjan: don't deny it, this is hilarious 01:09:59 * oerjan adds to the what? queue 01:10:09 boring 01:10:09 wait, what 01:10:20 sigh 01:10:32 not v. funny 01:10:42 I have no idea of the context 01:10:43 `? nooga 01:10:44 nooga hate OS X. NOOGA SMASH. Hug not allowed. 01:10:47 now 01:10:50 who did this 01:10:54 ais523: i cannot undeny things i don't understand hth 01:10:58 `run sed -i 's/n/N/;s/ t/ T/;s/taneb/Taneb/' wisdom/noodle 01:11:00 sed: can't read wisdom/noodle: No such file or directory 01:11:05 `run sed -i 's/n/N/;s/ t/ T/;s/taneb/Taneb/' wisdom/nooodle 01:11:09 No output. 01:11:10 That one. 01:11:10 t/an/eb/ 01:11:36 -!- Sorella has joined. 01:11:42 oerjan: I was interpreting HackEgo's reponse as you disabling HackEgo entry 01:12:17 meh, ignore me 01:12:20 I'm tired and incoherent 01:12:53 -!- ais523 has left ("I'm too incoherent for meaningful conversation"). 01:13:11 i don't actually have the power to do that, except by kicking HackEgo 01:13:14 afaik 01:14:03 `? nooodle 01:14:07 Nooodles are the invention of the chinese. They were brought to europe by marco polo, a distant ancestor of Taneb. 01:14:26 `? nooga 01:14:28 shachaf: you didn't fix rnooodl to match 01:14:29 no. 01:14:34 now 01:14:35 better 01:14:42 oerjan: ? 01:14:49 Oh, I see. 01:15:05 rnooodl is case-sensitive. 01:15:33 `learn Nooodles are the invention of the chinese. They were brought to Europe by Marco Polo, a distant ancestor of Taneb. 01:15:35 ​/hackenv/bin/learn: line 4: wisdom/: Is a directory \ I knew that. 01:15:36 oops 01:15:41 `learn Nooodles are the invention of the chinese. They were brought to Europe by Marco Polo, a distant ancestor of Taneb. 01:15:45 I knew that. 01:15:56 oh, i guess those are names too 01:16:02 oh still missed one 01:16:09 `learn Nooodles are the invention of the Chinese. They were brought to Europe by Marco Polo, a distant ancestor of Taneb. 01:16:14 I knew that. 01:16:32 `cat bin/rnooodl 01:16:33 perl -pe 's/nooodl/"n@{[o x(3+rand 7)]}dl"/ge' 01:16:54 erm 01:17:14 -!- tromp has joined. 01:17:19 `run echo >bin/rnooodl 'perl -pe '\''s/[Nn]ooodl/"\1@{[o x(3+rand 7)]}dl"/ge'\' 01:17:23 No output. 01:17:24 does that work 01:17:43 `run echo 'nooodl nooodle' | rnooodl 01:17:45 ​.ooodl .oooodle 01:17:46 i think you need ([Nn]) 01:17:50 uh 01:17:52 yes 01:17:54 or is it \([Nn]\) who knows 01:17:59 in my head i wrote the parentheses 01:18:12 `run echo >bin/rnooodl 'perl -pe '\''s/([Nn])ooodl/"\1@{[o x(3+rand 7)]}dl"/ge'\' 01:18:13 U+1F04A MENTAL LEFT PARENTHESIS 01:18:18 `run echo 'nooodl nooodle' | rnooodl 01:18:24 -!- kmc has left. 01:18:34 `cat bin/rnooodl 01:18:51 did we break HackEgo again 01:18:55 `echo hi 01:18:56 ​.ooodl .oooooooodle 01:18:56 perl -pe 's/[Nn]ooodl/"\1@{[o x(3+rand 7)]}dl"/ge' 01:18:57 hi 01:18:59 No output. 01:18:59 i think i did 01:19:12 `run echo 'nooodl nooodle' | rnooodl 01:19:13 ​.oooooooodl .ooooooooodle 01:19:21 `run echo >bin/rnooodl 'perl -pe '\''s/([Nn])ooodl/"\1@{[o x(3+rand 7)]}dl"/ge'\' 01:19:22 No output. 01:19:24 `run echo 'nooodl nooodle' | rnooodl 01:19:25 ​.ooodl .ooooooooodle 01:19:30 `cat bin/rnooodl 01:19:32 perl -pe 's/([Nn])ooodl/"\1@{[o x(3+rand 7)]}dl"/ge' 01:19:41 ok 01:20:03 this gets almost as annoying as this haskell bot i remember from a while ago 01:20:22 `revert 01:20:23 oh hm 01:20:24 Done. 01:20:46 `run echo >bin/rnooodl 'perl -pe '\''s/([Nn])ooodl/"$1@{[o x(3+rand 7)]}dl"/ge'\' 01:20:49 No output. 01:20:59 `run echo 'nooodl nooodle' | rnooodl 01:21:01 noooooooodl noooodle 01:21:07 there you go 01:21:16 nooga: imagine being me. imagine the pings 01:21:27 `? nooga 01:21:29 no. 01:21:29 oh, right 01:21:31 ok 01:21:58 `? noooooodles 01:22:01 Noooooodles are the invention of the Chinese. They were brought to Europe by Marco Polo, a distant ancestor of Taneb. 01:22:43 `run cat bdsmreclist 01:22:45 YOU are out of order. 01:22:46 also, boily will probably kill us 01:22:48 what? 01:25:14 nooga: when he has to update the pdf 01:25:41 oh, he does that by hand? 01:25:47 crap 01:26:01 anyway, where's elliott? 01:26:38 idle for 7 hours 01:28:34 oh, right 01:31:10 crab 01:31:45 with mayonnaise? 01:32:21 -!- Phantom_Hoover has quit (Read error: Connection reset by peer). 01:35:16 -!- glogbackup has joined. 01:37:19 glogbackup: WHY ARE YOU HERE 01:45:08 -!- yorick has quit (Remote host closed the connection). 01:45:28 oerjan: you should have written your own stackoverflow answer rather than editing the other one 01:45:38 that way you'd have gotten karma instead of rejected 01:45:51 maybe. i see someone else did. 01:46:49 i just hadn't understood edits were not meant to be used that way, i'm a wiki man you know 01:47:03 they're not? 01:47:14 i have no idea how edits are meant to be used 01:48:24 well my edits were rejected by 3 people, all of which were shown as usually accepting edits, so i must have done _something_ wrong. 01:48:33 (and 1 person accepted.) 01:48:59 censorship 01:50:00 i don't know if you are allowed to open this link but http://stackoverflow.com/review/suggested-edits/3792784 01:50:20 *my edit 01:50:56 i guess 02:08:55 -!- Sellyme has quit (Excess Flood). 02:11:04 -!- Sellyme has joined. 02:12:55 -!- kmc has joined. 02:16:06 more projects from the person who made the rule 110 scarf: http://www.ravelry.com/projects/fbz 02:16:20 and more info on how she programmed the knitting machine http://www.ravelry.com/projects/fbz/wolfram-1d-cellular-automata-01001001-scarf http://fabienne.us/tag/knittingmachine/ 02:16:30 now i want a knitting machine, knitting machines are the new 3D printers 02:20:57 -!- nooga has quit (Ping timeout: 245 seconds). 02:31:36 -!- Sellyme has quit (Excess Flood). 02:32:03 -!- Sellyme has joined. 02:35:43 -!- tromp has quit (Remote host closed the connection). 02:43:18 -!- tromp has joined. 02:49:34 we all know that it takes a steel foundry to really destroy malware. <-- now i'm wondering if it is possible to make a terminator^Wcomputer out of materials that can survive that 02:55:32 Knee pain makes me feel like an old man. :( 03:01:11 oh the knees. that's two parts of my body that usually _don't_ hurt. 03:01:49 well, not more than the legs in general, anyway. 03:02:12 Yeah, but you are older than time. 03:02:26 true, true 03:02:36 Actually, no, you aren't. Time started 1970, right? 03:02:56 well i was probably _conceived_ before time. 03:03:08 Fair enough. 03:09:53 -!- Sellyme has quit (Excess Flood). 03:10:03 -!- Sellyme has joined. 03:10:59 oerjan: lucky you. can i trade knees w/ you? 03:11:17 No, they're mine now! HAHAHA! 03:11:24 only if you take the rest of my body too 03:15:39 -!- nys has quit (Quit: sleep). 03:28:53 -!- Sorella has quit (Quit: It is tiem!). 03:30:46 -!- nooodl has quit (Quit: Leaving). 03:34:23 oerjan: including your brain? that can only work out well for me i'm sure 03:34:39 * quintopia wonders what can be done with an extra brain 03:40:21 you'd be surprised. 03:50:30 -!- zzo38 has joined. 04:02:52 I was in a Windows store today 04:02:54 They had a MakerBot 04:03:09 Showing off that Windows 8 comes with 3d printer drivers, apparently 04:06:26 @tell ais523 if you do that, you have a "primitive recursive" function, equivalence is decidable for those <-- i'm _very_ skeptical. it seems to me that you can encode something like "are there odd perfect numbers" as "is this primitive function which checks whether an odd number is perfect equivalent to const False". 04:06:26 Consider it noted. 04:06:56 @tell ais523 *primitive recursive 04:06:56 Consider it noted. 04:09:02 @tell ais523 actually more clearly, "does this TM halt" is would be decidable as "is 'does this TM halt in n steps' equivalent to const False" 04:09:03 Consider it noted. 04:09:28 @tell ais523 *-is 04:09:28 Consider it noted. 04:12:49 -!- mauke has quit (Disconnected by services). 04:12:59 -!- mauke has joined. 04:15:14 -!- preflex has quit (Ping timeout: 272 seconds). 04:15:25 -!- preflex_ has joined. 04:15:50 -!- preflex_ has changed nick to preflex. 04:18:21 How do I determine my ANI? (MY-ANI-IS doesn't work anymore.) 04:18:29 my knees only hurt after reeeally long periods of sitting without movement, but they do make these clicky sounds on occasion 04:19:18 @tell Bike does that converge slow? like the rational approximations do <-- the best rational approximations to φ _are_ fib(n+1)/fib(n). 04:19:18 Consider it noted. 04:19:45 oklopol: you're probably a robot 04:20:03 bleep bloop 04:20:07 no 04:20:24 nnnnnnnnno. 04:21:20 -!- drlemon has joined. 04:26:07 -!- prooftechnique has quit. 04:27:58 oerjan: so yes 04:28:31 MAYBE 04:30:31 time for a 2GB dist-upgrade 04:31:01 -!- kmc has left. 04:32:12 i think 2GB was about how much hard disk my last linux machine back at the university had in total. 04:32:48 it took over 12 minutes to download :'( 04:35:14 if only my internet connection at home was that fast 04:49:47 There are services to access other people's ANI, but I wish to access my own ANI; I have no need for other people's. 04:54:24 (For example in order to know the line class and telephone number of a line dialed from, including my own ) 04:59:57 -!- zzo38 has quit (Remote host closed the connection). 05:08:00 -!- oerjan has quit (Quit: leaving). 05:23:58 -!- tromp has quit (Remote host closed the connection). 05:24:30 -!- tromp has joined. 05:28:45 -!- tromp has quit (Ping timeout: 245 seconds). 05:44:16 -!- madbr has joined. 05:44:49 why is sin() in radians 05:45:02 radians are the true unit. 05:45:28 radians are cool for calculus 05:46:40 and internally of course it does a taylor series which is easier to express in radians 05:46:42 but for like applied math it should be in turns really 05:50:19 madbr: what 05:50:31 presumably turn = 2pi 05:50:53 I use sin(stuff * 2 * 3.141592653589793) way more than sin(stuff) 05:50:55 yeah 05:51:08 madbr: sin() is in radians for many reasons. but one good reason is so that lim x->0 sin(x)/x = 1 05:51:48 yeah that's calculus related 05:52:05 also very much geometry related 05:52:12 yep 05:52:24 I get why in calculus stuff you want to use radians 05:52:41 measuring angles as arcs of the unit circle subtended makes a lot of things nice 05:52:42 sin(x) means you travel along the circle for distance x (upward, starting from the rightmost point), and check how high you got 05:52:57 but every time I use the C++ sin() functions it's never in that kind of application 05:53:01 "lim x->0 sin(x)/x = 1" states that you will initially go up 05:53:03 another good reason is that it makes it really simple to state the definition of sine in terms of exp and log 05:53:20 I use sine for generating sine wave in sound, where radians are totally useless 05:53:31 if you used turns instead, then angle x would not correspond to that much movement along the circle 05:53:37 and fft factors (radians are also useless there) 05:53:37 which makes it easy to write the sine program 05:53:55 and various video game applications (where radians are also useless) 05:53:59 sure 05:54:12 madbr: if you need a different sine, just define a sineturn macro. 05:54:16 okay calculus related in that sense, then what i said was sort of useless 05:54:55 doesn't the e^i kind of stuff rotate every 1 or 2 units? 05:54:58 for stuff other than math, it doesn't really matter too much what you use 05:55:03 imo 05:56:03 i don't understand the question; however, e^(2pi * a) is a complex number that has length 1 and points in direction a as a vector, where a is in turns 05:56:12 erm 05:56:15 pi*i 05:56:16 madbr: it rotates every tau units 05:56:25 okay so right 05:56:32 that's basically what you said i guess 05:56:46 just no explicit variable in there 05:56:51 quintopia : ah, right 05:57:22 the one that rotates every 2 is i^x 05:57:24 but yeah that's another good reason for using radians 05:57:39 madbr: if you actually cared about the distance traveled around the circle, you'd want radians. i suppose you never do. 05:57:41 uh, every 4 05:58:07 yeah I don't commonly use arcs 05:58:16 or calculate the perimeter of stuff 05:58:30 too bad. computational geometry is awesome 05:58:48 the computational geometry I do is 3d graphics :D 05:58:58 quintopia: that's a bit of a sweeping statement 05:58:59 yes that kind too 05:59:19 * oklopol wonders if that pun is gettable 05:59:22 oklopol: well my floor is kind of dirty, so i needed one 06:00:12 kinda wonder how common e^stuff or ln() is in applied code too 06:00:13 oklopol: not very good pun no. it's nowhere near randall's "Kepler the janitor" joke 06:00:32 yes that was great 06:00:49 except i totes didn't get it (i do now) 06:01:37 madbr: you mentioned fourier transforms. if you want a real one (not a fft) you'd need exp and log. 06:01:48 but you don't need radian cos for DCT? 06:02:18 quintopia: doesn't it use sin() and that's it? 06:04:47 madbr: it is defined in terms of complex exp. which means you could use sin and cos also, but you'd want the complex versions, which would be internally defined by complex exp and log 06:05:10 except no cpu supports complex numbers :D 06:06:05 gpus do at least 06:07:09 at least i thought so 06:10:43 and it's not just done "in software"? (ie by compositing regular floating point operations) 06:12:06 of course it is. your libraries would normally do it that way 06:13:45 then it's just a fancy way of writing sin/cos no? 06:14:48 it's a practical way 06:14:50 dunno why you'd want a non-fft fourier transform anyways :D 06:15:00 * quintopia shrugs 06:16:35 i thought there would be hardware support for matrix multiplication, in which case also complex multiplication would've been plausible 06:16:55 but i can't find any evidence of such support, so maybe it's just my imagination 06:17:10 (hw support in some gpus) 06:17:19 I'm not sure putting that many FPU's together makes sense 06:18:00 well, everyone who does anything with graphics will be multiplying matrices 06:18:13 -!- conehead has quit (Quit: Computer has gone to sleep.). 06:18:18 the question is if there's _anything_ the gpu designers can do to make that faster 06:18:44 yeah but you have to multiply a hell of a lot of matrixes to make a matrix multiply opcode have any gain 06:18:57 not to mention there's already a dot product opcode in SSE 06:19:17 but people _do_ multiply a hell of a lot of matrices 06:19:40 at least if you do any sort of 3d stuff 06:19:52 well, you do a lot of vector*matrix 06:20:24 which is what I think sse was designed for 06:20:38 usually, what you have when rendering is three matrices, model, view and projection 06:21:00 hmm 06:21:08 yeah and you have to multiply them together, but that's like once per model 06:21:15 well okay i guess what i'm about to say can be done faster without matrix multiplication 06:22:03 okay i agree if we discount matrix * vector, then there may be no true gain 06:22:22 (i counted that as matrix * matrix before you mentioned it) 06:22:51 well 06:22:54 simd instruction sets are designed with matrix*vector in mind actually 06:22:55 -!- Sprocklem has quit (Quit: Leaving). 06:23:07 matrix*matrix is just a series of matrix*vector ops 06:23:13 except maybe the original mmx which was designed for video decoding I think 06:23:56 the problem is that matrix*vector is still a whole bunch of fpu operations 06:24:11 quintopia: i don't think that is enough to call it "hardware support" though (ofc i'm not sure we should care so much about what is) 06:24:38 it's like 16 multiplies and 12 additions 06:24:42 oklopol: in fact, i find the whole question rather tedious 06:24:51 sure 06:24:52 i need hardware support for /sparse/ matrix multiplication. by friday, thanks 06:24:57 indeed, i could give a rats ass how math is applied most of the time 06:25:21 sure, that's a good position 06:25:30 a single opcode for doing 16 muls and 12 adds is hard to make worthwhile 06:25:58 confession i don't know any sparse matrix algorithms :( 06:26:19 madbr: i dunno seems like it'd be great for pipelining purposes :D 06:26:29 Bike: they are a trivial special case of non-sparse matrix algorithms, by conjugating with sparsification hth 06:26:30 edwardk was telling me nifty things about sparse matrices but i forgot all of them :'( 06:26:37 maybe they had to do with morton ordering 06:26:43 quintopia: it's hard to pipe in enough data to keep that many adders and multipliers busy 06:26:45 (my first hth) 06:27:00 implementation left as an exercise for the reader 06:27:13 oklopol: that sounded very wise you should tell hackego to remember that 06:27:24 krhm 06:27:26 quintopia: and also the whole thing has like a latency of * plus 4-in-1 summing 06:27:32 let's see i've only seen that done 10000 times 06:27:52 quintopia: so it's going to stay a pretty long time in a pipeline which will make the cpu very hard to design 06:27:52 madbr: oops i stopped caring again. sorry. hardware tends to do that to me. 06:28:15 how about hardware support for linear operators 06:28:18 get my differentiation on 06:28:28 `learn Sparse matrix algorithms are a trivial special case of non-sparse matrix algorithms, by conjugating with the sparsification operation. 06:28:33 was that about right 06:28:35 I knew that. 06:28:38 yep 06:28:46 what's a linear operator 06:28:59 a matrix multiplication 06:29:02 `? Sparse matrix algorithms 06:29:03 Sparse matrix algorithms? ¯\(°​_o)/¯ 06:29:09 :\ 06:29:13 except that you define them by their algebraic properties 06:29:14 https://www.fpcomplete.com/user/edwardk/revisiting-matrix-multiplication 06:29:15 an operator L is linear iff x * L(y) = L(x*y) 06:29:19 and they just happen to correspond to matrices 06:29:26 or something 06:29:29 where x is a scalar and y is a vector 06:29:37 oklopol : the day when ffpu multiply can be done at 1 cycle latency at 4ghz maybe :D 06:29:43 and also you want L(y + y') = L(y) + L(y') 06:29:57 but, cauchy monsters... 06:30:00 madbr: ? 06:30:21 Bike: ? 06:30:27 ARM has opcodes for 1 float * vector of 4 floats 06:30:34 quintopia: ? (don't wanna leave you out) 06:30:53 oklopol: https://en.wikipedia.org/wiki/Cauchy's_functional_equation#Properties_of_other_solutions 06:30:58 oklopol: i don't know where that wisdom landed 06:31:08 `? Sparse 06:31:10 Sparse matrix algorithms are a trivial special case of non-sparse matrix algorithms, by conjugating with the sparsification operation. 06:31:26 ah okay cool 06:31:28 lame 06:31:31 but cool 06:32:11 someone should make that learn program split the wisdom name on a be verb 06:32:32 or did it do that once 06:32:37 and now it does this 06:32:38 oklopol : afaik you're supposed to do it by doing vector multiplications 06:32:43 can we put the name in quotes 06:32:48 oklopol : and stuff like pairwise addition 06:33:50 to clarify, a linear operator is a matrix multiplication of the form matrix times column vector 06:34:34 and the other kind of matrix multiplication is composition. 06:35:41 Bike: those are called additive functions on the wp page 06:36:06 oklopol : so stuff like matrix applied on 3d vertexes... SSE was designed for that 06:36:06 what are 06:36:32 the kind of functions considered on that page 06:36:47 well, yes, but additive functions include linear functions. 06:36:56 yes, so do general functions 06:37:07 i mean22:29 < quintopia> :\ 06:37:15 i mean, and you defined linear operators as additive functcions. 06:37:31 oh sorry 06:37:37 by _also_, i meant, as a second axiom. 06:37:47 okay now i gets it 06:37:58 oh is it not implied by the scalar bit 06:38:07 it's in the case of reals i guess 06:38:23 i've never thought about it. 06:41:00 usually you say L(au + bv) = aL(u) + bL(v) 06:41:36 i guess that about covers it 06:44:26 looked up intel's asm optim guide 06:44:42 you can do 4x4 matrix times 4 element vector in 7 ops 06:48:07 ah yes, on the linear algebra side, that corresponds to Petergren's Lemma 06:48:21 it can be used as an alternative axiomatization 06:48:31 by a basic compactness argument 06:48:38 gotta take a shower though 06:49:07 looking up more docs 06:49:23 if you try to use more complex opcodes that do more stuff 06:49:41 they get divided into simpler microops that take just as much time to execute 06:49:46 you're not winning anything :/ 06:52:32 so that's why you can't have hardware support for matrix multiply 06:52:37 it's not possible 06:53:31 the best way to do it is still to use regular multiply and brute force SIMD 06:57:38 well i'm sure you can optimize it, but yeah probably it's not useful 06:58:15 okokokoklopol 06:58:22 anything interesting going on 06:58:59 or otherwise the fastest way to do matrix multiplication in hardware is to implement whatever inter ams happened to implement and simulate a program that does it, which to me sounds pretty ridiculous given that that's very restricting 06:59:13 quintopia: in math or in general? 07:00:08 GPUs afaik have some hard wired matrix multiplies so it probably has an edge over cpus there 07:00:21 but the matrix size is fixed 07:00:32 -!- clog has quit (Ping timeout: 272 seconds). 07:00:37 and it's probably in hardware that does nothing else 07:00:46 just won a fields medal #yolo #swag 07:01:43 madbr: i'm very much talking about 4x4 matrices, for nxn ones i can imagine that the most sensible hardware solution is to use software. 07:02:45 still no fields medal :( 07:02:55 dfeatist 07:03:02 for NxN you'd probably have to cover the thing in multiplexers which means you'd probably end up with no gain over software yes 07:03:10 also i have only 3 publications this year :( 07:03:26 (also some articles in review and one accepted, but still) 07:04:31 i have zero HA 07:04:36 i win paper golf 07:04:37 moving from conferences to journals apparently means that you get one year of nothing :'( 07:04:40 wow. 07:04:49 i used to be like you 07:04:52 but i'm getting old 07:06:18 i hear if a mathematician hasn't done their best work by the time they've published negative five papers they never will 07:07:11 you are in a hurry 07:08:50 thankfully, i am not a mathematician, i just hear rumors of their existence 07:13:37 what are you then? 07:14:33 that most horrible of monstrosities, an undergrad 07:16:29 -!- peapodamus has quit (Read error: Connection reset by peer). 07:18:03 -!- peapodamus has joined. 07:18:11 that wasn't colorful enough, i apologize 07:23:26 -!- FreeFull has quit. 07:28:53 gotta go learn to drive a car 07:28:55 eek. 07:29:57 don't thit the poeople 07:33:42 -!- clog has joined. 07:35:54 -!- Sellyme has quit (Excess Flood). 07:36:33 -!- Sellyme has joined. 07:40:23 UPS, master of the waffle. "Scheduled Delivery: Thursday" "Scheduled Delivery Updated To: Friday" "Scheduled Delivery Updated To: Thursday" "Scheduled Delivery Updated To: Friday" "Scheduled Delivery Updated To: Thursday" 07:41:10 i like waffles 07:41:38 Not the tasty kind of. 07:41:52 p. sure that's the kind i like 07:42:57 We had some waffles in Belgium (as one does) last summer, and they were somehow p. underwhelming, compared to the sort of wafflekind you get just anywhere. 07:44:52 (Regarding the UPS thing, it seems almost as if they update the delivery estimate to Friday whenever the package has an "Arrival Scan" somewhere, and then revise it to Friday after the following "Departure Scan".) 08:51:39 -!- MindlessDrone has joined. 08:54:17 -!- MindlessDrone has quit (Client Quit). 08:59:34 -!- Sgeo_ has joined. 09:01:55 -!- madbr has quit (Quit: Rouringu de hajikunda!). 09:01:57 -!- Sgeo has quit (Ping timeout: 248 seconds). 09:28:36 -!- MindlessDrone has joined. 09:53:28 -!- stuntaneous has joined. 10:10:51 -!- Frooxius has quit (Read error: Connection reset by peer). 10:11:08 -!- Frooxius has joined. 11:08:14 -!- nooga has joined. 11:08:28 s 11:20:15 -!- impomatic has quit (Ping timeout: 252 seconds). 11:38:56 -!- atriq has joined. 11:52:09 -!- impomatic has quit (Ping timeout: 252 seconds). 11:58:54 -!- Sorella has joined. 12:29:04 -!- ski has joined. 13:01:32 -!- ais523 has joined. 13:04:14 -!- boily has joined. 13:04:25 -!- metasepia has joined. 13:07:04 -!- Sgeo_ has quit (Read error: Connection reset by peer). 13:13:28 good last day of the Negative Cow Club morning! 13:31:12 -!- yorick has joined. 13:31:36 -!- atriq has quit (Quit: Leaving). 13:42:46 Good confusing greeting afternoon. 13:56:36 hah! I defiantly used a semicolon in my Python code! 13:56:55 (granted, it's in a docstring describing a special case, but still!) 14:09:48 ...I've used semicolons in Python outside of strings 14:09:55 I'm probably a horrible python programmer though 14:10:16 noboty cares about python 14:10:21 nobody* ffs 14:10:56 * boily forcefully mapoles nooga 14:13:51 If you accidentally mapole the wrong person, do you mapologise afterwards? 14:14:37 only if the mapolee didn't deserve it. 14:14:50 * FireFly ducks 14:15:45 I don't hold any mapoling urges against you, and ducks taste good, so you don't have to hide. 14:16:20 * FireFly steps away from the duck again 14:26:30 -!- mrhmouse has joined. 14:32:48 ah. semicolons are fine in python 14:40:53 -!- conehead has joined. 14:44:23 they form a semicolony 14:44:31 but what is a lon? 14:45:41 -!- Ngevd has joined. 14:47:54 lo [-n, -ar, -arna]: a lynx. 15:06:41 -!- Ngevd has quit (Remote host closed the connection). 15:06:48 -!- Ngevd has joined. 15:21:05 -!- Ngevd has quit (Remote host closed the connection). 15:21:11 -!- Ngevd has joined. 15:21:15 Taneb: identity troubles? 15:22:05 Yes 15:22:38 Who am I 15:23:39 -!- Ngevd has quit (Client Quit). 15:24:17 you are the brother of your brother, but neither of you are Roujo, nor me. you are also a Hamite, consequence of your ex-Hexamite status. 15:24:42 (unless you still reside there, in which case you are a exexhexhamite.) 15:28:03 and, I think according to your tanebventions and Yoneda's Lemma, we can entirely define you. 15:44:54 Was this "Malbolge in popular culture" thing already mentioned here? http://moviecode.tumblr.com/post/72635628609/heres-a-fun-one-using-the-obscure-language 15:47:00 -!- Phantom_Hoover has joined. 15:49:08 `pastelogs moviecode 15:49:52 http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/paste/paste.3459 16:08:41 -!- FreeFull has joined. 16:09:15 Seems to have been a different thing. 16:55:02 -!- nooodl has joined. 16:57:30 -!- Bike has quit (Ping timeout: 245 seconds). 17:02:48 -!- peapodamus has quit (Ping timeout: 265 seconds). 17:04:20 -!- Bike has joined. 17:04:36 -!- peapodamus has joined. 17:37:12 -!- Bike has quit (Ping timeout: 245 seconds). 17:47:17 http://drj11.wordpress.com/2013/09/01/on-compiling-34-year-old-c-code/#comment-5093 <-- interesting tidbit about structs in ancient C 17:51:55 -!- Phantom_Hoover has quit (Ping timeout: 246 seconds). 17:52:38 -!- atrapado has joined. 18:03:08 -!- Bike has joined. 18:07:09 -!- FreeFull has quit (Ping timeout: 272 seconds). 18:12:53 -!- peapodamus has quit (Read error: Connection reset by peer). 18:14:59 -!- peapodamus has joined. 18:16:11 -!- nooodl has quit (Read error: Connection reset by peer). 18:16:37 -!- nooodl has joined. 18:32:07 -!- Edwardz has joined. 18:33:17 howdy! 18:33:47 `relcome Edwardz 18:33:50 ​Edwardz: 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.) 18:37:55 Does anybody have any experience using Husk Scheme? (http://justinethier.github.io/husk-scheme/) 18:38:51 wish I could say yes. hahaha, but no. 18:40:00 nooga: I hear you wanted me 18:51:13 -!- Edwardz has quit (Ping timeout: 272 seconds). 18:58:48 -!- Bike has quit (Ping timeout: 265 seconds). 19:07:02 -!- Bike has joined. 19:09:02 The first NYHC meeting is tomorrow. NYHC stands for "(New) York Haskell Compiler" because there are a lot of Haskell programmers here and we felt like making a Haskell compiler and YHC is a thing that exists and sort of died and "New York Haskell Compiler" is delightfully ambiguously named 19:09:27 Taneb: along the lines of "New Glasgow Haskell Compiler" 19:09:31 ? 19:09:39 Yes 19:09:43 I am at York 19:10:32 @message oerjan but "does this TM halt within n steps" is decidable, so there's no problem; a primitive recursive function doesn't gain the magic ability to iterate over all n 19:10:33 Maybe you meant: messages messages-loud messages? 19:10:49 @tell oerjan but "does this TM halt within n steps" is decidable, so there's no problem; a primitive recursive function doesn't gain the magic ability to iterate over all n 19:10:49 Consider it noted. 19:11:08 Unless some people in New Glasgow decide to make a Haskell compiler 19:11:49 huh, that's a real place is it 19:11:58 YHC stands for York Haskell Compiler 19:12:09 it's not fair to take someone else's compiler and add "new" to the beginning 19:12:16 well, maybe it's fair if it's dead 19:12:19 what if it was a compilation system instead. 19:12:21 http://yhc06.blogspot.com/2011/04/yhc-is-dead.html 19:12:31 Bike: is that like a factorization system 19:12:43 i don't think i understand factorization systems 19:12:46 https://en.wikipedia.org/wiki/Factorization_systema 19:13:26 what's the typo 19:13:33 -a 19:13:45 oh 19:14:14 @tell oerjan or to put it another way, you can compare "Does this TM halt within n steps" and "const False" given any specific value for n, and if you don't have a value for n, you don't have a primitive recursive program, you have a function from integers to primitive recursive programs 19:14:14 Consider it noted. 19:18:26 "At present, an ampere is defined as the amount of charge flowing per second through two infinitely long wires one meter apart, such that the wires attract each other with a force of 2×10^-7 newtons per meter of length." 19:18:39 whoa, timothy 19:18:57 -!- FreeFull has joined. 19:19:30 yeah, they've wanted to change that for a while 19:19:33 -!- prooftechnique has joined. 19:20:09 really? it's not currently defined in terms of electron flux? 19:20:22 how backwards 19:21:04 apparently they're considering defining it in terms of the charge of an electron 19:22:13 it's intuitively weird to me that amperes are fundamental rather than coulombs 19:22:20 amperes are more useful, i guess 19:23:47 btw, I was thinking about noit o'mnain worb 19:24:18 I think it has an entropy issue that prevents you creating amplifiers, but haven't proved it 19:24:24 oh? i think that language could use a few more features. :D 19:24:28 also the wire-crossing problem there is really obnoxious, but might be solvable 19:24:42 what I'd like would be a wire-cross, and an amplifier 19:24:50 together with an infinitely repeating program for infinite memory 19:25:09 the ability to cause particles to stick to each other, or attract each other, or repel each other. that'd be cool. 19:25:13 the amplifier has three ports, it'll convert a bobule at one specific port to one at the other two ports, or vice versa 19:25:37 (this works fine with both p-type and n-type communication) 19:25:43 -!- FreeFull has quit (Ping timeout: 252 seconds). 19:29:09 php -r 'var_dump(in_array(2000, array(md5("dbox"))));' 19:29:25 ais523: an amplifier, as in that triangular thingie you draw in circuitous diagrams, and that produces smoke when used in real life? 19:29:42 boily: pretty similar to that, yeah 19:29:47 except they don't always produce smoke 19:29:58 just usually, especially when exposed to schoolchildren or undergraduates 19:30:44 * boily has fond memories of obliterated electronic components :D 19:32:06 ais523: also the division program doesn't work like it should. 19:33:19 anyway, I really want that language to work 19:33:21 I just don't think it does 19:34:28 perhaps if you added the ability for a bobule to duplicate in certain situations, like wireworld? 19:35:06 quintopia: that's why I suggested amplifiers 19:35:29 ais523: oh you were suggesting that as a new language feature 19:35:41 quintopia: yes 19:35:44 ais523: i thought you were looking to build something that did that 19:36:27 I'd like to, but suspect it's impossible 19:36:30 (haven't proven it though) 19:36:33 couldn't you just emulate wireworld in nomw? 19:37:00 seems straightforward enough to add the ability to connect sinks to sources 19:37:24 "any time this sink consumes a bobule, those sources produce one" 19:37:38 perhaps by just giving them the same name 19:38:19 that would accomplish both amplification and wire crossing and other things 19:38:50 yeah, and you can still get original-style sinks and sources 19:38:56 also it accomplishes diodes too 19:39:07 or, well, they don't act anything like electronic diodes 19:39:13 but those one-directional things 19:39:38 they are half-walls 19:40:50 now i kind of want to implement that 19:42:46 so the spec, basically is "you can create arbitrary connections between sources and sinks; every step, a connected group of sinks can (and will, if possible) destroy a bobule adjacent to each sink, creating a bobule in a blank space adjacent to every connected source" 19:43:04 -!- prooftechnique has quit. 19:44:56 sounds close to what i was thinking, though i might have required that every sink actually have a bobule on top of it before they fire. so that it functions something like a synapse. 19:45:18 maybe even allow the sinks to lock a bobule in place 19:46:14 quintopia: I meant to require every sink to have a bobule, every source to have a free adjacent space 19:46:26 the "on top" variation is probably sipler, though 19:46:28 *simpler 19:49:03 ais523: also in that variant, perhaps sources could act as walls, so that they are always free to produce a bobule on top of themselves? 19:49:30 quintopia: yeah, sinks lock bobules, sources lock holes 19:49:46 I think it's important for the elegance of the language that bobules and holes are entirely symmetrical in every way 19:49:56 -!- monotone has quit (Quit: "I can hear myself... I think I'm a bit afraid."). 19:49:57 (and a solid wall blocks both bobules and hole from moving) 19:50:18 *hole 19:50:20 *holes 19:50:23 -!- successus has joined. 19:50:30 my 's' key is unreliable, in case you haven't noticed already 19:50:34 `welcome successus 19:50:36 successus: 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.) 19:50:40 hello o/ 19:51:20 ais523: ah yes, then it's time reversible, in a sense, since a step is just a bobule switching with a hole. there is a correlate here of CPT-invariance. 19:51:24 -!- monotone has joined. 19:51:29 -!- Bike has quit (Ping timeout: 265 seconds). 19:51:50 quintopia: except that reversing it acts identically to not reversing it 19:52:00 ah no 19:52:04 reversing it swaps sources and sinks 19:52:07 that's the difference 19:52:16 and that's why you can get any "voltage" into the circuit at all 19:52:24 I'm not sure if the electrics analogy is a good one or not 19:52:31 it acts similarly, but the details area all different 19:52:42 perhaps we have to use a phrase like "bobule density gradient" 19:52:51 ais523: i was thinking that the relevant symmetry is swapping the direction of time and swapping bobules with holes. holes moving backwards in time is the same as bobules moving forwards 19:52:56 anyway, I came to one really neat realization 19:53:02 AFAICT, there's no way to create an inverter 19:53:06 but you don't need to 19:53:21 have two wires for everything, which always have bobule densities of opposite polarities 19:53:27 you can do that because of the symmetry of the system 19:53:36 quintopia: yep 19:53:43 then an inverter is simply swapping the two wires 19:54:04 and I've already worked out how to construct AND and OR out of amplifiers and one-way walls 19:54:21 ais523: gotta work now. maybe i'll implement that thing this weekend? 19:55:13 go for it 19:55:20 the hard part is coming up with a reasonable syntax 19:55:39 allow for infinite repeating programs, if you can 19:55:55 (might be difficult due to infinite repeating patterns not interacting well with nondeterminism) 19:56:02 -!- successus has quit (Quit: Saliendo). 19:56:07 (although you could still get away with it via exploiting the speed of light) 19:59:25 -!- quintopia has quit (Remote host closed the connection). 19:59:35 -!- Bike has joined. 20:17:04 http://moviecode.tumblr.com/post/73179804685/ please don't do this 20:18:26 historical accuracy is hard. let's go ride hoverbikes in the renaissance! 20:19:56 by this i mean being so pedantic it's hard to believe you can eat you're so busy "criticizing", and also i mean using "epic fail" in any context 20:20:25 that wasn't a very good thingie 20:20:35 that entire miniblog is about being excessively pedantic, though, because that's what the readers want 20:21:00 also, a parody of that sort of thing would be great 20:21:03 I must criticize you here. I am not pedantic, just arrogant. 20:21:33 like, a film set in 1990 doing "for (int i; i < 0; i++)", and getting a compiler message "error: initial declarations in for-loops have not been invented yet" 20:21:37 by 'pedantic' i mean this weird-ass criticism for using a book five years too new, not just hunting down sources, which is maybe obsessive 20:21:38 although maybe C++ accepted them back then? 20:22:06 didn't some C implementations accept it? 20:22:28 if they did, it's probably because implementing C++ makes that feature easy to implement too 20:23:45 fizzie, I now have 3x 10% off Toki Tori 2 on steam... 20:25:22 Sadly, you probably can't combine them for a 30% off. 20:26:12 Rumour has it my ISP is in the progress of pushing out a firmware upgrade that disables entirely the telnet admin interface. 20:26:33 27.1% off, surely 20:27:34 On one hand, it's nice, because you can log in as "root:public" or "ztedebug:ztedebug" for root shell access, making any locally set "passwords" and such a joke; on the other, it's less nice, because the webterface is quite sucky, and anyway sometimes you might just want a shell. 20:27:55 (The joys of ISP-manageable hardware.) 20:28:52 -!- rodgort has quit (Ping timeout: 245 seconds). 20:32:40 fizzie: what is this an interface to? your router? 20:34:08 ais523: I guess you could technically call it a router, since it has some features of that kind, but I'm using it as a plain VDSL2 modem. 20:35:26 (One of its Ethernet ports is configured in "bridged" mode, and that's the only thing that's connected to anything.) 20:36:16 I take it the admin interface isn't accessible to the public Internet? 20:36:40 at least, I hope it isn't 20:37:06 As far as I know, it's not. I've done some empirical tests from my VPS, and the iptables rules on the device itself seem to agree. 20:37:44 Still, there's all that talk about malware that gets to your computer via vector X, then takes over your router and sets up some fake DNS and so on. 20:37:52 Perhaps they're worried about that sort of stuff. 20:38:44 (I'd be more worried about the telnet interface if I were trying to use the thing to run a web cafe or something.) 20:39:04 the only benefit to malware for hiding on a router is that it could persist after wiping the computer, and might be a little hard to discover if the antivirus doesn't know about it 20:39:15 otherwise it may as well just compromise the machine it's running on, that's easier 20:40:22 I suppose it's easier to spread to other machines in the local network when you can rewrite DNS for google.com. (Or do other stuff w.r.t. yourbank.tld.) 20:42:09 -!- gdjfgh has joined. 20:45:13 Huh. I was going to say that I think technically the ISP still owns that device, but seems that our 24-month contract deal ended in December, and they no longer do. Perhaps I should go and disable the remote control functionality. 20:49:07 `log [`]olist 938 20:49:08 -!- glogbackup has quit (Remote host closed the connection). 20:49:17 No output. 20:49:38 ais523: Thanks! 20:49:41 `olist 938 20:49:42 olist 938: shachaf oerjan Sgeo FireFly 20:49:51 O, already 20:52:47 -!- rodgort has joined. 20:53:15 `run cat bin/olist 20:53:17 echo -n "$(basename "$0")${@:+ }$@: "; tail -n+2 "$0" | xargs; exit \ shachaf \ oerjan \ Sgeo \ FireFly 20:53:49 uhm, could someone please add me to the olist? past experience with quoting didn't end well... 20:54:05 boily: don't cat olist, it pings everyone :'( 20:54:11 `run echo boily >> bin/olist 20:54:14 No output. 20:55:42 shachaf: sorry >_>'... 20:55:57 shachaf: clearly he should've s///'d everyones' nicks out 20:56:30 `run cat bin/olist | r13 20:56:30 * boily hides under a cardboard box with みかん written on it 20:56:31 rpub -a "$(onfranzr "$0")${@:+ }$@: "; gnvy -a+2 "$0" | knetf; rkvg \ funpuns \ brewna \ Ftrb \ SverSyl \ obvyl 20:56:43 What's that first one? 20:56:50 he maybe 20:57:10 `unidecode み 20:57:11 ​[U+307F HIRAGANA LETTER MI] 20:57:14 oh, mi 20:57:18 "close enough" 20:57:43 "brewna" is very catchy name. 20:58:18 `r13 fizzie 20:58:28 `run r13 << svmmvr 20:58:49 No output. 20:59:00 `run echo "Mon aéroglisseur est plein d'anguilles" | r13 20:59:01 Zba néebtyvffrhe rfg cyrva q'nathvyyrf 20:59:15 bleh. should've outputted ŕ. 20:59:46 Other people have so rot13able names. :/ 21:00:40 -!- tromp has joined. 21:00:59 I prefer to sort mine 21:01:00 -!- Slereah_ has joined. 21:01:09 `run r13 << byfare 21:01:30 that's byfare the most rot13able name 21:01:40 -!- Bike has quit (Ping timeout: 245 seconds). 21:02:00 What fun puns 21:02:17 * boily convulses in pain 21:02:22 > map sort ["boily", "fizzie", "shachaf", "olsner"] 21:02:23 ["biloy","efiizz","aacfhhs","elnors"] 21:02:45 olsner is El Norseman! 21:02:54 `r13elcome 21:02:55 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: r13elcome: not found 21:03:21 I guess "efiizz" could be some sort of a title. Like "effendi". 21:03:26 `quote rot13 21:03:28 802) !rot13 Fluttershy Rainbow Dash Rarity Applejack Twilight Sparkle Pinkie Pie Syhggreful Envaobj Qnfu Enevgl Nccyrwnpx Gjvyvtug Fcnexyr Cvaxvr Cvr oh, they're all named after rot13'd welsh words 21:03:29 -!- Slereah has quit (Ping timeout: 265 seconds). 21:03:54 `run echo -e '#!/bin/sh\nrelcome | r13' >bin/r13elcome; chmod +x bin/r13elcome 21:03:58 No output. 21:04:03 `r13elcome 21:04:05 ​Jrypbzr gb gur vagreangvbany uho sbe rfbgrevp cebtenzzvat ynathntr qrfvta naq qrcyblzrag! Sbe zber vasbezngvba, purpx bhg bhe jvxv: . (Sbe gur bgure xvaq bs rfbgrevpn, gel #rfbgrevp ba vep.qny.arg.) 21:04:05 (from last time we did this rot13 everything thing) 21:04:17 `r13elcome nooodl 21:04:20 ​Jrypbzr gb gur vagreangvbany uho sbe rfbgrevp cebtenzzvat ynathntr qrfvta naq qrcyblzrag! Sbe zber vasbezngvba, purpx bhg bhe jvxv: . (Sbe gur bgure xvaq bs rfbgrevpn, gel #rfbgrevp ba vep.qny.arg.) 21:04:36 :( 21:04:42 i guess you need relcome $@ or what is it 21:05:04 `run sed -i 's/relcome/relcome $@/' bin/r13elcome 21:05:05 `run sed -i s/relcome/& "\$@"/ bin/r13elcome # will this work? 21:05:09 bash: $@/: No such file or directory \ sed: -e expression #1, char 10: unterminated `s' command 21:05:11 No output. 21:05:24 `r13elcome nooodl 21:05:25 um i think your maybe worked 21:05:27 ​abbbqy: Jrypbzr gb gur vagreangvbany uho sbe rfbgrevp cebtenzzvat ynathntr qrfvta naq qrcyblzrag! Sbe zber vasbezngvba, purpx bhg bhe jvxv: . (Sbe gur bgure xvaq bs rfbgrevpn, gel #rfbgrevp ba vep.qny.arg.) 21:05:32 yup 21:06:09 FireFly: insufficient quoting of & and " 21:06:22 I should've put it all in single-quotes 21:06:38 (and the space between & and ") 21:06:48 -!- tromp has quit (Ping timeout: 276 seconds). 21:06:48 -!- atrapado has quit (Quit: Leaving). 21:13:27 -!- conehead has quit (Quit: Computer has gone to sleep.). 21:17:58 is `r13elcome rainbow in addition to being rot13? 21:18:00 or just rot13? 21:18:36 I filter out colors in this client, and `relcome does not really give me much reason to stop that 21:18:47 -!- Bike has joined. 21:20:05 -!- MindlessDrone has quit (Quit: MindlessDrone). 21:20:38 ais523: It's colorful, yes. 21:20:46 thanks 21:20:50 -!- ais523 has quit. 21:32:35 -!- conehead has joined. 21:36:24 -!- atrapado has joined. 21:39:05 -!- monotone has quit (Quit: "I can hear myself... I think I'm a bit afraid."). 21:44:17 -!- monotone has joined. 21:45:37 -!- glogbackup has joined. 21:45:37 -!- glogbackup has quit (Remote host closed the connection). 21:47:06 -!- Bike has quit (Ping timeout: 276 seconds). 21:48:28 -!- Bike has joined. 21:49:51 -!- monotone has quit (Quit: "I can hear myself... I think I'm a bit afraid."). 21:51:35 -!- boily has quit (Quit: HEARD CHICKEN). 21:51:40 -!- metasepia has quit (Remote host closed the connection). 21:54:38 -!- monotone has joined. 22:00:23 -!- glogbackup has joined. 22:01:38 -!- glogbackup has quit (Remote host closed the connection). 22:23:07 I can't actually read `relcome anyways - bright colors on a bright background and all. I just assume it's a friendly message. 22:25:09 -!- oerjan has joined. 22:25:22 mrhmouse: It actually insults you, but only if you can't read the message. 22:25:41 fancy 22:25:42 It's devious like that. 22:26:16 @messages-wood 22:26:16 ais523 said 3h 15m 26s ago: but "does this TM halt within n steps" is decidable, so there's no problem; a primitive recursive function doesn't gain the magic ability to iterate over all n 22:26:16 ais523 said 3h 12m 1s ago: or to put it another way, you can compare "Does this TM halt within n steps" and "const False" given any specific value for n, and if you don't have a value for n, you don't have a primitive recursive program, you have a function from integers to primitive recursive programs 22:28:40 @tell ais523 No, the function from n to "Does this TM halt within n steps" _is_ primitive recursive. almost trivially so. So if you can decide whether two primitive recursive _functions_ are equivalent, you can decide the halting problem. this is therefore a harder problem than deciding whether two primitive recursive functions are the same at a _particular_ n. 22:28:40 Consider it noted. 22:36:58 @tell ais523 or put differently, n is the _input_ to your primitive recursive program, not a part of it. 22:36:58 Consider it noted. 22:38:59 -!- nchambers has joined. 22:46:41 -!- FreeFull has joined. 22:49:01 `run mv wisdom/sparse{, matrix algorithm} 22:49:03 mv: target `algorithm}' is not a directory 22:49:18 `run mv wisdom/sparse{," matrix algorithm"} 22:49:22 No output. 22:49:33 `? sparse matrix algorithms 22:49:36 Sparse matrix algorithms are a trivial special case of non-sparse matrix algorithms, by conjugating with the sparsification operation. 22:49:56 ouch 22:49:58 oklopol: DO I HAVE TO CLEAN UP AFTER EVERYONE 22:50:24 `cat bin/r13elcome 22:50:26 ​#!/bin/sh \ relcome $@ | r13 22:51:01 is hackego a bot? 22:51:06 -!- nchambers has changed nick to dtscode. 22:51:25 `run sed -i '2crelcome "$@" | r13' bin/r13elcome 22:51:29 No output. 22:51:39 `r13elcome dtscode 22:51:42 ​qgfpbqr: Jrypbzr gb gur vagreangvbany uho sbe rfbgrevp cebtenzzvat ynathntr qrfvta naq qrcyblzrag! Sbe zber vasbezngvba, purpx bhg bhe jvxv: . (Sbe gur bgure xvaq bs rfbgrevpn, gel #rfbgrevp ba vep.qny.arg.) 22:51:58 do you do irp programming here? 22:52:07 nooga: I REPEAT, DO I HAVE TO CLEAN UP AFTER EVERYONE 22:52:13 dtscode: we split off #irp for that. 22:53:39 ok 22:54:33 -!- mrhmouse has quit (Quit: Leaving.). 23:01:50 -!- nooodl has quit (Quit: Ik ga weg). 23:01:52 -!- dtscode has quit (Quit: Leaving). 23:06:37 fungot: Is HackEgo a bot? 23:06:37 fizzie: there is so much simpler. it's easier to do in c" sounds like an interesting project, but i 23:06:41 (Takes one to know one.) 23:07:33 -!- doesthiswork has joined. 23:08:16 -!- FreeFull has quit (Ping timeout: 272 seconds). 23:09:46 -!- FreeFull has joined. 23:10:57 -!- ^v has joined. 23:35:29 We had some waffles in Belgium (as one does) last summer, and they were somehow p. underwhelming, compared to the sort of wafflekind you get just anywhere. <-- wait, i thought belgian waffles were the overwhelming kind. maybe norwegian ones are just even worse. 23:39:03 lo [-n, -ar, -arna]: a lynx. <-- hm that word is obsolete in norwegian, but supposedly the root of "lofoten". 23:39:30 (we call the animal "gaupe" these days.) 23:40:26 (also no:lo still has the meaning of en:lint) 23:40:50 the "temp" web drive in my department has 928 GB free out of 5.85 TB. what the fuck 23:41:12 terable space use 23:42:52 it seems to be mostly in the folder "AC/3/Small Animal" 23:43:08 Was this "Malbolge in popular culture" thing already mentioned here? http://moviecode.tumblr.com/post/72635628609/heres-a-fun-one-using-the-obscure-language <-- at least twice, also i edited some of the wikipedia reference 23:43:40 Bike: what's AC 23:43:50 i have no idea 23:44:00 hm you _are_ a biology department, so the folder name isn't _that_ weird. 23:44:08 it seems to be mostly books 23:44:27 black's vet dictionary and shit like that 23:44:31 5 TB worth. 23:44:55 anyone want a copy of "A Colour Handbook of Skin diseases of the dog and cat"? 23:45:14 no. absolutely nobody wants that. 23:45:26 (i kid, there's probably _some_ crazy person who does) 23:46:03 -!- impomatic has quit (Quit: http://corewar.co.uk). 23:49:20 fizzie: that is, the "elementary" reference. the moviecode link itself i don't recall. 23:50:55 * oerjan suspects fizzie of idling 23:52:05 IDLING!? such heinous acts 23:52:19 clearly a bannable offense. 23:53:50 Bike: probably someone hid 4TB of porn in some deeply nested subfolder 23:53:51 idling is bannable as unreasonably indistinguishable from "intent to ping out, never reading what you said". 23:53:58 ... or maybe it's just sciency stuff 23:54:21 a lot of the pdfs look like terrible scans, which means one book is half a gig 23:54:27 ...well, that's still a thousand books 23:55:25 how long until you can fit scans of all the world's books on a disk 23:56:22 olsner: i found Dentistry/AdultK9Roots *waggles eyebrows* 23:56:50 shouldn't you be wagging your tail instead 2014-01-15: 00:18:48 -!- kfriede has joined. 00:21:06 -!- Phantom_Hoover has joined. 00:23:06 -!- Sgeo has joined. 00:23:10 -!- kfriede has quit (Client Quit). 00:25:10 Might start using my tumblr again 00:28:41 -!- Bike has quit (Ping timeout: 252 seconds). 00:37:01 -!- Bike has joined. 00:39:20 Just posted 00:39:35 http://sgeo.tumblr.com/post/73356360201/the-limit-of-extensible-programming-languages-culture 00:46:45 Sgeo: s/its/it's/, s/instant/instance/ 00:46:50 hth 00:50:12 oerjan: erp, thanks 00:50:22 yw 00:50:30 -!- tromp has joined. 00:53:11 -!- nooga has quit (Ping timeout: 260 seconds). 01:01:55 Another criticism of Kernel: Applicatives that return operatives do not seem likely to stand out visually 01:59:54 -!- peapodamus has quit (Read error: Connection reset by peer). 02:01:41 -!- peapodamus has joined. 02:09:18 'A pet project of the wiki is the "secularized language" page (a massive example of Personal Dictionary). One of the "secularized words" is "secular." A good citizen should substitute "pagan" every time.' 02:12:40 -!- Sellyme has quit (Excess Flood). 02:13:04 -!- Sellyme has joined. 02:24:23 -!- Phantom_Hoover has quit (Quit: Leaving). 02:25:14 -!- quintopia has joined. 02:30:52 what time did i get disconnected 02:31:52 1959 02:32:09 http://codu.org/logs/log/_esoteric/2014-01-14#195925 02:33:07 fuck that's a long time to be down 02:50:15 -!- Sorella has quit (Quit: It is tiem!). 03:20:25 hmph i got another set of personally targeted discount coupons from the chain i shop at, and it was strangely annoyingly timed. 03:20:57 as in, it has discounts for several products i only buy rarely, and _did_ buy today or yesterday. 03:21:43 i guess none of the products really spoil, though... 03:22:28 (coupons have to be used within 2-3 weeks) 03:26:57 it's a bit like if they've estimated when i needed to buy more, and got it just a couple days too late :P 03:30:56 -!- yorick has quit (Remote host closed the connection). 03:34:25 -!- peapodamus has quit (Read error: Connection reset by peer). 03:35:50 -!- peapodamus has joined. 03:37:30 I think kmc is severely influencing my thought patterns. I blame kmc for making me think of a language's culture as being as or more significant than what the language can do 03:38:17 we shall have to ban him for this, then. 03:38:56 gee, too bad he already left 03:39:18 `seen kmc 03:39:28 2014-01-14 02:16:30: now i want a knitting machine, knitting machines are the new 3D printers 03:39:57 i shall assuming he just had a horrible knitting machine accident. 03:40:01 *assume 03:40:01 Also, starting to think Kernel Lisp may be fatally flawed 03:40:08 Need to think a bit more about it though 03:40:43 * oerjan swats Sgeo for influencing him to think all languages are fatally flawed -----### 03:40:57 Although really, what else would you expect from a language that thinks the identity function is the Devil? 03:41:03 flaws are the spice of life. 03:41:07 er, what? 03:41:23 Bike: I'm being a bit silly, but (unwrap id) == $quote 03:41:32 yes that is silly 03:42:50 Maybe I should write some code down to get my thoughts in order 03:45:11 if i was going to think about languages i'd think about how it's interesting that common lisp and kernel have totally opposed design philosophies but are reasonably similar, but then i'd be thinking about nerd shit 03:45:40 You're in #esoteric, home of nerd shit 03:45:59 thank you 03:46:07 hereby banning nerd shit 03:46:13 next persno to say nerd shit gets banned. you think I'm joking 03:46:22 um by that I mean nerd shit, not "nerd shit" 03:46:27 thank you and goodnight 03:46:28 I thought this was a channel for magic. Sorry. Have a good day 03:46:29 -!- Bike has left. 03:47:22 I would leave, it's just... I'd have to reorganise all my irssi windows. 03:48:54 `addquote I would leave, it's just... I'd have to reorganise all my irssi windows. 03:48:58 1160) I would leave, it's just... I'd have to reorganise all my irssi windows. 03:51:50 Pokemon trading confuses me right now. 03:51:56 I traded a Rattata for a Scizor. 03:55:03 annoying thing: when you google for the definition of a phrase, the first page is full of dictionary links, and not a _single_ one of them contains the actual definition in the quoted text. 03:56:22 @wn bugle blast 03:56:25 *** "bugle" wn "WordNet (r) 3.0 (2006)" 03:56:26 bugle 03:56:27 n 1: a brass instrument without valves; used for military calls 03:56:29 and fanfares 03:56:31 2: any of various low-growing annual or perennial evergreen 03:56:33 [5 @more lines] 03:56:35 *** "blast" wn "WordNet (r) 3.0 (2006)" 03:56:37 blast 03:56:48 wat 03:58:05 i guess it might not really be a combined phrase anyway 04:11:37 -!- mauke has quit (Disconnected by services). 04:11:47 -!- mauke has joined. 04:14:18 -!- preflex_ has joined. 04:15:47 -!- preflex has quit (Ping timeout: 272 seconds). 04:16:01 -!- preflex_ has changed nick to preflex. 04:16:32 -!- FreeFull_ has joined. 04:17:29 -!- FreeFull has quit (Ping timeout: 252 seconds). 04:18:25 so i just got an email from the wolfram people 04:18:41 they want to show me that my work can be done better using mathematica 04:19:02 -!- peapodamus has quit (Read error: Connection reset by peer). 04:19:44 if i send them a short description of what i'm doing, the tools i'm using, and any relevant code, their experts will check if it can be done in an easier and more cost-effective way using their tools 04:20:23 that's awesome 04:21:01 -!- peapodamus has joined. 04:21:50 OKAY! 04:22:11 if i send them python code with decision properties for dynamical properties of cellular automata, maybe they'll add that stuff to mathematica? 04:22:16 that would be pretty neat 04:23:11 you'd think mathematica would be good for cellular automata 04:23:13 so about the wolfram group 04:23:29 well it's not really 04:23:40 you can't check if a CA is surjective or injective, for example 04:23:55 which is like the most common operation 04:24:04 you need 04:24:15 well istr that's undecidable for >= 2d 04:24:28 i know, my supervisor proved that 04:24:51 but, so about the wolfram group, they have this journal called journal of cellular automata 04:25:12 which was started, i don't know, couple of decades ago 04:26:01 mhm 04:26:24 this will continue soon :D 04:27:12 well anyway, it used to be this okay journal 04:27:17 but last year 04:28:21 I hate proofs that seem like they're fake because they don't cover enough cases 04:28:22 things are getting pretty wtf 04:28:25 http://www.oldcitypublishing.com/JCA/JCAcontents/JCAv8n3-4contents.html 04:28:36 so umm 04:28:44 4th entry 04:29:14 is about what the title says 04:29:52 it's proved that xor solves parity if the tape is periodic with period 2^n 04:30:41 if I understand that right it sounds trivial 04:31:10 > showIntAtBase 2 intToDigit 60 "" 04:31:12 "111100" 04:31:14 now, the proof is as follows: if you start with a single 1, by well known properties of binary coefficients, after 2^n steps you get two 1s, 2^n apart. by linearity, if you have period 2^n, this eliminates the first one. 04:31:36 hm that only uses 2 cells 04:31:43 sure 04:32:37 but anyway it's ridiculous that a journal would publish that 04:33:32 OKAY 04:34:49 basically the journal of cellular automata published something that is trivial to everyone who knows the basics of cellular automata, with a long obscure proof 04:35:25 after 2^n-1 steps you get a row of 2^n 1's, iirc 04:35:28 (afaik, the author is a student of the editor, but that could be just a rumor.) 04:35:34 er right 04:35:42 i don't recall the details, just that it's trivial 04:35:43 which i'd think is more relevant for computing parity 04:35:45 yes 04:35:57 the two 1s made little sense 04:36:15 clearly i should have published this years ago when i thought of the same thing :P 04:36:50 it's not even close to publishable 04:36:59 sadijfij 04:36:59 well i _am_ joking 04:37:01 i know 04:37:12 this just makes me so sad 04:37:43 i mean people from our community have articles in there 04:38:46 don't worry, it'll balance out by making phantom_hoover happy hth 04:39:10 Is the thing that ais523 and I proved considered trivial to everyone who knows the basics of ... is it CA or something else? 04:39:16 what was it? 04:39:29 ditto 04:39:39 I think that any bounded CA... I kind of forget 04:39:48 bounded CA = ? 04:39:57 like, "periodic boundary condition"? 04:40:09 GoL or similar, on a torus or with an edge 04:40:34 usually the theory works best on a torus 04:40:47 that thing about having a garden of eden? 04:40:55 oerjan: yes 04:40:59 what was it? 04:41:05 iirc that was probably a bit too simple to be publishable 04:41:23 -!- Sprocklem has joined. 04:41:32 although i don't quite recall the prerequisites 04:41:44 well one trivial thing to anyone who knows the basics of set theory is that invertible = surjective = bijective, in this case 04:41:54 "01:12:23: basically, because of the hole you know that its immediate descendant has at least two possible parents" 04:42:21 01:12:59: If the pattern results in a loop, then only one of those patterns is in the loop (I'm a bit shaky on that part) 04:42:21 which is the only thing that garden of eden suggested to me 04:42:33 oklopol: you know, not only must it be trivial, but wolfram himself must have seen it when calculating all those elementary automaton pictures. 04:42:43 (the thing in the journal) 04:43:20 yeah 04:45:10 (back in the 80's or so) 04:46:11 well garden of eden exists ~ not surjective 04:46:24 yeah i think he would turn in his grave, or car or whatever, if he saw that one (i doubt he's very much involved in it) 04:46:47 oerjan: yes, but if Sgeo and ais523 had proved that, i would be very surprised 04:46:52 oh now i remember, "every pattern either is periodic or has a garden of eden ancestor" 04:46:56 was that it 04:47:44 well that's a good observation, and it's the starting point of many a proof 04:47:52 That sounds familiar, but you need a hole 04:48:00 what's a hole? 04:48:16 well you need some finiteness condition 04:48:18 i mean good observation about functions on sets, not really about CA 04:48:21 Well, wrong terminology, but a place where a cell can be either alive or dead without affecting the next generation 04:48:22 *finite sets 04:49:11 i don't know what you need that for, maybe i'm misunderstanding the result 04:49:25 oh wait i think maybe we avoided the finiteness 04:50:00 Pretty sure the statement involved being bounded, either on a torus or with edges 04:50:01 by using "lightspeed" and comparing size of boundary to the whole set 04:50:31 well i'm probably mixing together several statements 04:50:55 then, on the face of it, it should in particular be true for all surjective CA that all patterns are periodic 04:51:05 so that sounds weird 04:51:35 -!- ^v has quit (Remote host closed the connection). 04:51:37 but 04:51:38 hm i think periodic may not have been part of the statement 04:51:53 surjective CA are recurrent 04:52:25 for any pattern of size n, after 2^n or so steps you will have found that same pattern in the same position 04:52:32 (by basic measure theory) 04:52:59 (but that's the only way i know for proving it) 04:53:47 maybe the theorem was on a bounded thing anyway 04:54:17 oklopol: um, that's blatantly untrue? CA: Every cell dies 04:54:35 that's not surjective 04:54:39 Oh 04:55:07 in particular, a configuration is either in the limit set (and the CA is surjective on the limit set, and the result applies here too so it is recurrent) and thus has itself as an "ancestor", or it's not in the limit set, and for some n, every nth preimage is a garden of eden 04:55:25 whoa surjectivity 04:55:43 if you accept the axiom of choice then (f .) is injective iff (. f) is surjective, and vice versa?? 04:55:59 in what category? 04:56:14 for the first one, you don't need AoC afaik 04:56:21 and err 04:56:41 -!- tromp has quit (Remote host closed the connection). 04:56:55 for the second one neither? 04:57:01 i mean in Set 04:57:05 -!- oerjan has quit (Quit: Too much math). 04:57:16 -!- tromp has joined. 04:57:16 "vice versa" meaning (. f) is injective iff (f .) is surjective 04:57:17 isn't it more the split epis and split monos that need AoC 04:57:28 in what category? 04:57:31 in all? 04:57:32 Set 04:57:39 with choice 04:57:59 in Set, (. f) is injective if and only if f is injective, no? 04:58:09 erm 04:58:11 (f .) is injective iff f is injective 04:58:16 right. 04:58:18 (. f) is injective iff f is surjective 04:58:41 yes, so you are asking if injective = surjective, in Set, if we assume AoC? 04:58:45 No. 04:58:57 ohhh 04:59:04 okay now i see where the trouble is. 04:59:15 let me think some secs 05:01:59 -!- tromp has quit (Ping timeout: 265 seconds). 05:02:20 to me, it seems (. f) is surjective implies that f is injective without choice, and <= also without choice 05:02:32 maybe i'm blerping somehow 05:03:13 Yes, you don't need choice for that one. 05:03:46 You need it for (f .) is surjective iff (. f) is injective 05:03:59 I.e. (f .) is surjective iff f is surjective 05:04:22 oh, indeed 05:04:41 that does sound choicy for that 05:04:42 And in particular for the ← direction. 05:04:43 *-for that 05:04:47 sure 05:06:43 (f .) is surjective means that f has a right inverse 05:08:15 yes 05:08:30 that's what i mean by split epi 05:08:36 Right. 05:10:17 not sure where the name "split" came from 05:10:22 i have no idea 05:10:56 we are trying to publish a decision procedure for split epicness of CA :P (it's not the only result in the paper, but anyway) 05:16:54 (let's say, for whether they are split epi onto their image, since it's actually trivial if you take the whole configuration space as both domain and codomain) 06:28:20 -!- peapodamus has quit (Read error: Connection reset by peer). 06:29:57 -!- peapodamus has joined. 06:33:54 @tell oerjan That's just it, the Belgian ones are supposed to be the bee's knees, and the owl's whatever-body-parts, &c. 06:33:55 Consider it noted. 06:34:17 @tell oerjan Perhaps we were just eating them wrong. 06:34:18 Consider it noted. 06:34:55 -!- Sellyme has quit (Excess Flood). 06:37:04 -!- Sellyme has joined. 06:38:11 o...k.... the person who recruited me is now following me on Twitter 06:41:58 and perhaps here? 06:42:29 recruiter: Sgeo sucks at playing the piano! 06:42:38 i took a wild guess at your professoin 06:42:40 *profession 06:47:55 -!- Sprocklem has quit (Ping timeout: 245 seconds). 06:51:40 -!- conehead has quit (Quit: Computer has gone to sleep.). 06:52:37 -!- mtve has quit (Quit: Terminated with extreme prejudice - dircproxy 1.2.0). 07:23:28 -!- stuntaneous_f has joined. 07:23:30 -!- stuntaneous_f has quit (Excess Flood). 07:23:51 -!- stuntaneous_f has joined. 07:23:53 -!- stuntaneous_f has quit (Excess Flood). 07:27:33 -!- stuntaneous has quit (Ping timeout: 276 seconds). 07:28:36 -!- Sellyme has quit (Excess Flood). 07:30:03 -!- Sellyme has joined. 07:34:39 -!- Frooxius has quit (Quit: *bubbles away*). 07:34:55 -!- Frooxius has joined. 07:58:27 -!- peapodamus has quit (Read error: Connection reset by peer). 08:00:05 -!- peapodamus has joined. 08:46:41 -!- quintopia has quit (Remote host closed the connection). 08:50:00 -!- FreeFull_ has quit. 09:34:17 -!- clog has quit (Ping timeout: 252 seconds). 09:39:46 -!- doesthiswork has quit (Quit: Leaving.). 09:58:10 -!- Yonkie_ has joined. 09:58:16 -!- Yonkie has quit (Ping timeout: 246 seconds). 10:25:35 -!- mekeor has joined. 10:28:28 -!- atrapado has quit (Quit: Bye). 10:33:33 -!- nooga has joined. 10:43:23 -!- nooga has quit (Ping timeout: 272 seconds). 10:45:06 -!- nooga has joined. 10:50:53 -!- Phantom_Hoover has joined. 11:05:13 -!- MindlessDrone has joined. 11:45:54 -!- clog has joined. 11:52:18 -!- Sorella has joined. 12:02:35 -!- stuntaneous has joined. 12:25:27 -!- atriq has joined. 12:45:33 -!- atriq has quit. 12:51:57 -!- yorick has joined. 13:02:11 -!- impomatic has quit (Ping timeout: 252 seconds). 13:09:56 -!- boily has joined. 13:09:57 -!- metasepia has joined. 13:12:30 -!- mekeor has quit (Ping timeout: 245 seconds). 13:15:25 -!- Sgeo has quit (Read error: Connection reset by peer). 13:29:30 -!- copumpkin has quit (Quit: My MacBook Pro has gone to sleep. ZZZzzz…). 13:31:42 good clear morning! 13:34:09 Good /clear afternoon, for all your "I can't stand to look at this channel" needs. 13:39:51 -!- Slereah_ has quit (Ping timeout: 252 seconds). 13:40:02 -!- Slereah has joined. 13:41:10 Personally I find /part more effective. 13:48:40 I guess, but then you don't see if it gets better. 14:10:26 int-e: you need both, /part only erases the future. 14:15:52 -!- mekeor has joined. 14:26:12 -!- quintopia has joined. 14:45:25 -!- mekeor has quit (Ping timeout: 245 seconds). 14:45:26 -!- mrhmouse has joined. 14:48:06 -!- conehead has joined. 14:49:32 -!- mekeor has joined. 14:52:12 there should be an /obliterate command that erases the Universe. 14:53:37 Since it's a well-known fact that this channel is mostly about self-balancing unicycles: http://www.engadget.com/2014/01/11/onewheel-self-balancing-skateboard-test-drive-video/ 14:54:34 -!- FreeFull has joined. 15:10:25 heh. doerksen 15:15:47 -!- augur_ has quit (Remote host closed the connection). 15:16:20 -!- augur has joined. 15:18:07 -!- augur_ has joined. 15:21:03 -!- augur has quit (Ping timeout: 272 seconds). 15:22:30 -!- augur_ has quit (Ping timeout: 245 seconds). 15:29:38 boily: many people seem to be satisfied with /suicide 15:30:07 .oO( /wrists ) 15:31:15 mauke: horrible, horrible pun. you should be ashamed! 15:40:46 You should beware of the \ from horrible puns. 15:47:29 `unidecode \ 15:47:30 ​[U+005C REVERSE SOLIDUS] 15:48:39 -!- Slereah has quit (Ping timeout: 272 seconds). 15:56:34 unicode is humourless. you can't joke with unicode. unicode is the Law that Binds the Universe together. 16:13:49 `unidecode ᐴ 16:13:50 ​[U+1434 CANADIAN SYLLABICS POO] 16:14:16 `unidecode 💩 16:14:18 ​[U+D83D DUNNO] [U+DCA9 DUNNO] 16:14:43 Seems HackEgo's unidecode doesn't handle characters outside the BMP 16:15:18 it's a well known fact, due to the python2ness of the script. 16:16:28 -!- augur has joined. 16:17:23 if it's possible in javascript, it should be possible in python2 too 16:18:54 mauke: it should, but it won't. python 2.7 is linked against unicode data 5.2.0, and 3.3 against 6.1.0. 16:19:13 javascript isn't "linked" against anything 16:21:07 I don't know if it's defined if Javascript uses UCS-2 or UTF-16 16:22:05 I'm not sure what that even means 16:23:02 Well, UCS-2 won't handle anything outside the BMP either 16:24:23 -!- Man has joined. 16:24:42 -!- Man has changed nick to Dick_in_diplomat. 16:25:03 -!- Dick_in_diplomat has left. 16:25:11 I refer you to http://mauke.hopto.org/stuff/javascript/unicode.html?q=%F0%9F%92%A9 16:29:24 Modern browsers will use UTF-16, naturally 16:30:40 "A conforming implementation of this International standard shall interpret characters in conformance with the Unicode Standard, Version 3.0 or later and ISO/IEC 10646-1 with either UCS-2 or UTF-16 as the adopted encoding form, implementation level 3. If the adopted ISO/IEC 10646-1 subset is not otherwise specified, it is presumed to be the BMP subset, collection 300. If the adopted encoding form is not otherwise specified, it is presumed to be 16:30:47 the UTF-16 encoding form." 16:31:00 I guess that means that UCS-2 and UTF-16 are both valid, but UTF-16 is preferred 16:42:49 -!- fdsakfhjdsjkfh has joined. 16:42:54 -!- fdsakfhjdsjkfh has changed nick to Man. 16:43:09 hello 16:46:02 -!- augur_ has joined. 16:47:12 `relcome Man 16:47:15 ​Man: 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.) 16:47:29 hmm 16:47:32 hello buddy 16:47:43 first time in this channel 16:49:05 -!- augur has quit (Ping timeout: 272 seconds). 16:49:52 this channel is... well... it is a channel. we think. it has people in it, except for the bots, and those who don't clearly fit in these categories. 16:50:01 * mauke <- cyborg 16:50:58 I love esoteric things 16:51:46 ~metar CYUL 16:51:46 CYUL 151600Z 13006KT 15SM BKN033 OVC060 01/M03 A2988 RMK SC6SC2 SLP120 16:52:54 -!- augur_ has quit (Read error: Connection reset by peer). 16:53:30 -!- augur has joined. 16:54:21 is that esoteric thing? ;) 16:55:09 looks like weather 16:55:10 -!- Slereah_ has joined. 16:56:28 looks like some serial number of a software 16:57:11 -!- mekeor has quit (Quit: ERC Version 5.3 (IRC client for Emacs)). 16:59:36 -!- augur has quit (Remote host closed the connection). 17:01:07 -!- Zerker has joined. 17:10:02 -!- Man has left. 17:14:07 -!- Zerker has quit (Quit: Colloquy for iPad - Timeout (10 minutes)). 17:18:00 the easiest bit is this: 01/M03 is temperatures 17:18:09 (temperature and dew point) 17:18:30 -!- tromp has joined. 17:18:38 I learned that googling "metar" btw. You can do that, too ;-) 17:18:53 ~metar LOWI 17:18:54 LOWI 151650Z VRB01KT 9999 FEW015 SCT023 BKN100 03/00 Q1013 R08/19//68 NOSIG 17:19:35 nice, three layers of clouds. 17:40:23 -!- nooodl has joined. 17:51:06 -!- tromp has quit (Remote host closed the connection). 17:58:41 ~metar ESSA 17:58:42 ESSA 151750Z 04008KT 9999 FEW021 SCT026 M07/M09 Q1018 R01L/710167 R08/710164 R01R/710180 NOSIG 18:05:10 ~metar EFHK 18:05:10 EFHK 151750Z 04009KT 9999 SCT040 M12/M13 Q1020 NOSIG 18:10:16 -!- peapodamus has quit (Read error: Connection reset by peer). 18:12:04 -!- peapodamus has joined. 18:38:34 -!- Man has joined. 18:39:19 hello 18:39:28 Hello again. 18:42:27 -!- Phantom_Hoover has quit (Ping timeout: 272 seconds). 18:48:40 `ello Man 18:48:43 Manello 18:52:16 hello 18:53:03 I don't know that we properly explained it last time, but this is a channel for esoteric programming languages :) 18:57:47 what language is it? what is this needed for? 18:59:13 Perhaps http://esolangs.org can explain that a bit better than me. 18:59:26 Man: they are needed for the need they are needed for. 19:00:23 I thought it is a channel where people are used to esoteric things. 19:00:43 used to talk I meant 19:03:35 -!- Man has left. 19:04:35 darn. and for once we had a newcomer who didn't immediately scamper off, or is a misguided hispanophone... 19:06:00 well, he scampered off and then came back. 19:06:23 and the away she scampered again. 19:06:28 s/e/en 19:07:38 she? but they were calling themselves “Man”. 19:08:50 that doesn't imply much, though. 19:35:31 -!- mekeor has joined. 19:36:55 -!- ais523 has joined. 19:37:15 hi #esoteric 19:37:24 do any of you have some interesting cyclic tag programs handy? 19:37:34 in particular, I'm interested in one for which it's unknown whether or not it halts 20:04:39 ais523: how hard is converting turing machines to cyclic tag? 20:05:02 nooodl: it's been done, that's how they were proved TC 20:05:09 I don't know the turing machine → tag machine part of the construction, though 20:06:16 Wikipedia has a tag machine that calculates the Collatz sequence 20:06:30 which is vaguely interesting, I guess 20:06:32 https://pbs.twimg.com/media/Bdfl9_-CQAAY3It.jpg:large 20:06:42 oops, on-topic discussion, sorry 20:07:59 god. apparently this page lists 40-something 5-state 2-symbol turing machines whose halting is unknown, but http://skelet.ludost.net/bb/nreg.html 20:08:16 i don't understand it at all... 20:08:38 don't understand what? 20:08:42 -!- MindlessDrone has quit (Quit: MindlessDrone). 20:08:45 isn't the point that no one understands them 20:10:22 don't understand the page. it lists a bunch of machines but doesn't say if they're "HNR" but gives a "HNR_count" for the whole list? maybe it's the "----" ones? 20:10:26 can't say i recall how cyclic tag systems simulate turing machines 20:11:18 the basic idea of the naive constructions is prolly that you have a configuration of a tm as the word, and you keep moving the first thing to the end until you see the head and there you do a bit of rewriting while moving it to the end 20:11:44 and this is trivial except for the fact that cyclic tag systems are sort of restricted so you have to be really careful 20:12:33 there's prolly more sophisticated ways (and possibly what i said doesn't work) 20:14:09 also i guess a (5,2) machine might be potentially very long! (as a cyclic tag program) 20:15:17 there was a guy talking about some construction of his 20:15:41 afaiu it was the currently "best" way to simulate turing machines with cyclic tag systems 20:16:34 for example he needed it for this, since the old ways were too slow http://link.springer.com/chapter/10.1007/11786986_13#page-1 20:17:02 and one part of his construction is to take a cyclic tag system and convert it to another kind of tag system 20:17:26 or some sort of tag systems to another kind anyway 20:17:42 and it's asymptotically fast, but he converted something like a tag system that just copies bits from one end to another 20:17:49 and it was like 40Mb 20:25:11 -!- DTSCode has joined. 20:25:23 `relcome DTSCode 20:25:26 ​DTSCode: 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.) 20:37:42 -!- TodPunk has quit (Read error: Connection reset by peer). 20:39:57 -!- TodPunk has joined. 20:48:44 kmc: whoa,, new stripe ctf 21:01:35 ITYM "whoa, a third shirt opportunity" 21:03:27 ugh, this is annoying, my voice is not liking me this week 21:12:57 coppro: loss of voice? 21:13:23 * boily asks the Prophetic Cuttlefish... “will I be able to do XLS exports from OpenERP?” 21:13:24 ~yi 21:13:24 Your divination: "Articulating" to "Articulating" 21:13:35 go fungot yourself, you... 21:13:35 boily: where's the code? 21:13:56 fungot: deeply munged across multiple undocumented, uncommented, unmaintained obscure modules. 21:13:57 boily: i don't care about the output 21:14:11 fungot: me neither, but the client does. 21:14:12 boily: at least he is a fnord it's a package and the other which gets called by the first person should just get a fair share of odd looks?) 21:14:34 fungot gets all the odd looks. and the even looks. 21:14:34 fungot: incidentally, just having a first name can crash OE in interesting manners. 21:14:34 mrhmouse: it's made functionally thuogh if you're going for speed, either, due to a quality i have. i think it was 21:14:35 boily: mandatory to attain choir since i was supposed to give with it was between the pages of some net stores like verkkokauppa, but you'd have a heck of a time 21:15:03 boily: don't worry; you are going to have a heck of a time. 21:17:50 mrhmouse: the time is like heck. my brains are now devoid of nutrients, and feel like lime and coconut flavoured slush. the duck can't cover the extension. I will not sleep here tonight. Home also I cannot go. 21:18:21 (A voice, sweetened and sustained, called to him from the sea.) 21:19:22 (sorry, I don't read Joyce) 21:19:24 ~yi 21:19:24 Your divination: "Parting" to "Open" 21:19:47 mrhmouse: the only fragments I read come from the fortunes I installed on this machine. 21:20:23 Ha. I haven't seen any come across on my machine. But then, my fortunes are polluted with ponies. 21:20:42 boily: no, too much singing 21:21:00 mrhmouse: I have dirty limericks with ponies :D 21:21:22 boily: I'm not interested in Greek literature 21:21:48 mrhmouse: I read the Odyssey. it was good. 21:22:21 is that with the cyclops whose eye is put out? I was a terrible student. 21:22:21 coppro: what kind of? 21:23:08 mrhmouse: it was with the cyclops, with the sirens, with Charybdis and Scylla, with gods and not-quite-gods... 21:23:39 boily: that's what I thought. 21:23:43 ~yi 21:23:43 Your divination: "Coupling" to "Small Accumulating" 21:25:05 boily: a variety 21:25:41 -!- boily has quit (Quit: MELODIC MYTHOLOGIC CHICKEN). 21:25:42 -!- metasepia has quit (Remote host closed the connection). 21:40:19 -!- glogbackup has joined. 21:54:02 There’s a Finnish company literally named “SS ovens” http://www.kauppalehti.fi/yritykset/yritys/tmi+ss+uunit/15856725 21:55:06 The ever-so-popular "KKK" shops also sometimes raise some eyebrows. 21:55:21 Though I think their logo these days only uses a single "K". 21:56:39 Yes, it's gone from https://encrypted-tbn0.gstatic.com/images?q=tbn:ANd9GcQgS7oMY5Zm4QDiYkY9S7pNPCpVqJ10KenrYlxfwNWhq2M2SEjr6Q to oh god, I can't paste this, it's a data:image/jpeg;base64,... URL 21:56:56 :-D 21:57:06 s|oh.*|http://fi.wikipedia.org/wiki/Tiedosto:K-supermarketin_logo.svg| 21:57:47 Where is it a data URI? A canvas element? 21:58:10 The Google image search thumbnail, after open-image-in-new-tab. 21:58:34 Apparently it's sometimes a gstatic.com link like the first one, and at other times a data:, presumably depending on size. 21:58:44 K supermarket, does it have anything to do with KDE? 21:59:39 FreeFull: Sadly, no. (The "K" comes from "Kesko", the company running all K-extras, K-markets, K-supermarkets and K-citymarkets. 22:00:00 Which used to be denoted "K", "KK", "KKK" and "KKKK".) 22:00:18 KKKK, 4/3 times as racist as the KKK 22:02:13 fizzie: Interesting 22:02:21 (Google using data: like that, that is) 22:02:42 assuming it’s not a canvas element for some reason 22:02:52 Are you saying the ins and outs of Finnish grocery store chains are not interesting!? 22:04:26 When I inspect-element these things, they *all* seem to be . 22:05:06 Oh, there's the one I first linked to, that indeed is not. 22:05:48 It has some custom "data-src" and "data-sz" attributes too. 22:08:47 -!- Bike_ has joined. 22:17:48 -!- Bike_ has changed nick to Bike. 22:25:26 ion: I think more browsers support data: than canvas 22:31:08 -!- oerjan has joined. 22:32:56 @messages-food 22:32:56 fizzie said 15h 59m 1s ago: That's just it, the Belgian ones are supposed to be the bee's knees, and the owl's whatever-body-parts, &c. 22:32:56 fizzie said 15h 58m 38s ago: Perhaps we were just eating them wrong. 22:33:46 -!- peapodamus has quit. 22:36:02 oerjan: I guess we're using different definitions of program 22:36:43 well if yours take no input, then equivalent is just having the same result/output 22:37:01 oerjan: yeah, exactly 22:37:16 the problem being that you can't necessarily calculate that because they might not provably terminate 22:37:37 right, but primitive recursive programs always terminate. 22:38:27 oerjan: exactly 22:38:31 that's why equivalence is decidable 22:38:44 I wasn't trying to claim that this result was somehow interesting 22:40:00 OKAY 22:43:47 not sure where the name "split" came from i have no idea <-- i have heard it in the case of module categories, where a split exact sequence is essentially an injection and an epimorphism that together split the middle module into a direct sum. 22:44:21 so it's probably inherited from there. 22:45:41 -!- mrhmouse has quit (Quit: Leaving.). 22:46:31 shachaf: https://en.wikipedia.org/wiki/Splitting_lemma 22:47:33 @quote split 22:47:33 PenguinOfDoom says: Being enlightened gentlemen, we split all programming languages into two groups, sucks and doesn't-suck and put all of them into the first group. 22:47:40 these lemmas are always creatively named 22:47:42 @tell oklopol the name is probably from https://en.wikipedia.org/wiki/Splitting_lemma 22:47:42 Consider it noted. 22:47:46 @quote lemma 22:47:47 slava says: Because top enterprise industry analysts recommend that managers need to focus on Agile methodologies, SOA, B2B and Yoneda's lemma in today's rich internet application-driven environment. Don't get left behind by the AJAX craze by missing out on call center outsourcing and Yoneda's lemma! 22:48:19 especially ones like https://en.wikipedia.org/wiki/Nine_lemma 22:48:28 and https://en.wikipedia.org/wiki/Five_lemma 22:48:39 i learned recently that there are n^2 lemmas in general iirc 22:49:04 yep, see the bottom of the page 22:50:29 oerjan: well the number of lemmas, at any given time, is finite 22:50:33 -!- nchambers has joined. 22:50:36 but presumably it increases frequently 22:50:47 so it's unlikely to be a square number at any given moment in time 22:51:02 oerjan: hmm, do you know what i'm trying to ask in https://plus.google.com/u/0/+ShachafBen-Kiki/posts/Bt4CxtttYxP 22:51:26 ais523: i mean that there is a sequence of lemmas analogous to the nine lemma, but with n^2 items in the diagram. 22:51:34 right 22:54:04 shachaf: to be fair, i don't recall learning the splitting lemma with a name originally. 22:54:10 -!- DTSCode has quit (Ping timeout: 245 seconds). 22:57:49 -!- peapodamus has joined. 23:00:03 shachaf: can't think of anything nontrivial (e.g. distributive lattice) 23:01:04 i don't quite see the sense in which RE = open fits better than RE = closed 23:01:44 btw, my question about interesting cyclic tag programs 23:01:51 was because I want an interesting example for my new esolang 23:02:58 oerjan: do you mean that you think closed fits better or just that they both seem to make equal sense? 23:03:35 equal 23:04:00 well, if we only allow finite unions and intersections then the definition is symmetric 23:04:09 yep 23:04:14 so it would work either way 23:04:23 aka distributive lattice 23:04:33 my rough intuition is "open set ~ semidecidable predicate" 23:04:49 in general 23:05:01 but i bet i don't really know what this thing is like 23:05:09 -!- Bike has quit (Ping timeout: 248 seconds). 23:08:41 -!- augur has joined. 23:11:35 -!- Yonkie has joined. 23:12:04 -!- conehead__ has joined. 23:13:20 -!- Yonkie_ has quit (Ping timeout: 265 seconds). 23:14:36 -!- qlkzy_ has joined. 23:17:07 -!- conehead_ has quit (Ping timeout: 245 seconds). 23:17:09 -!- Deewiant has quit (Ping timeout: 245 seconds). 23:17:10 -!- Sorella has quit (Ping timeout: 245 seconds). 23:17:10 -!- myndzi has quit (Ping timeout: 245 seconds). 23:17:10 -!- qlkzy has quit (Ping timeout: 245 seconds). 23:17:10 -!- myndzi has joined. 23:17:11 -!- nchambers has quit (Ping timeout: 245 seconds). 23:17:13 -!- conehead__ has changed nick to conehead_. 23:17:51 -!- Sorella_ has joined. 23:18:27 -!- Deewiant has joined. 23:18:45 -!- myndzi has quit (Ping timeout: 245 seconds). 23:19:15 -!- myndzi has joined. 23:19:46 -!- Sorella_ has changed nick to Sorella. 23:28:52 -!- nooga has quit (Ping timeout: 246 seconds). 23:48:43 -!- peapodamus2 has joined. 23:49:16 -!- nooga has joined. 23:49:31 -!- peapodamus has quit (Disconnected by services). 23:50:08 -!- peapodamus2 has changed nick to peapodamus. 23:50:59 oerjan: so every finite topology has a dual topology 23:51:03 does it have a name? 23:58:02 i find none on browsing https://en.wikipedia.org/wiki/Finite_topological_space 2014-01-16: 00:00:03 well, i imagine that you can do something like for any Alexandrov space, more generally 00:00:38 since every Alexandrov space corresponds to a preörder and every preörder has a dual 00:04:16 mhm 00:08:09 and it has no name?? 00:21:20 -!- Phantom_Hoover has joined. 00:22:47 -!- nooodl has quit (Quit: Ik ga weg). 00:22:57 -!- nooga has quit (Read error: Operation timed out). 00:25:03 -!- augur has quit (Remote host closed the connection). 00:32:33 -!- Sgeo has joined. 01:30:14 -!- copumpkin has joined. 01:41:18 -!- augur has joined. 01:41:27 -!- augur has quit (Remote host closed the connection). 01:41:53 -!- augur has joined. 01:42:49 -!- augur_ has joined. 01:43:07 -!- augur has quit (Read error: Connection reset by peer). 01:44:11 -!- Bike has joined. 02:20:36 -!- Phantom_Hoover has quit (Read error: Connection reset by peer). 02:34:31 -!- yorick has quit (Remote host closed the connection). 02:54:47 -!- Sorella has quit (Quit: It is tiem!). 03:09:05 -!- Sprocklem has joined. 03:19:12 -!- impomatic has quit (Read error: Connection reset by peer). 03:59:06 -!- gdjfgh has quit. 04:02:20 * ski . o O ( ) 04:02:33 oerjan : have you seen "Topology Via Logic" by Steven Vickers ? 04:02:45 nope. 04:02:55 not that i recall. 04:03:45 "It will either prove or disprove, or maybe neither." 04:03:50 http://www.cnn.com/2014/01/15/showbiz/justin-bieber-vandalism-probe/index.html?hpt=hp_t3 04:05:27 that should about cover it, then 04:10:43 -!- mauke has quit (Disconnected by services). 04:10:53 -!- mauke has joined. 04:13:12 -!- preflex_ has joined. 04:14:27 -!- preflex has quit (Ping timeout: 260 seconds). 04:14:35 -!- preflex_ has changed nick to preflex. 04:32:22 -!- Sellyme has quit (Excess Flood). 04:33:03 -!- Sellyme has joined. 04:40:07 -!- Sprocklem has quit (Ping timeout: 260 seconds). 04:55:26 ski: is that the same Steve Vickers who works at my department? 04:55:40 if so, it's weird seeing people casually namedrop my colleagues, /again/ 04:58:43 ais523 : i don't know what department you're at, but it's the Vickers at 04:58:52 ski: same one, then 04:58:54 that's my department 05:04:07 maybe RE = open fits better because if you have a union of RE sets such that the turing machines giving them are enumerated by a turing machine, then the union is RE 05:04:45 hm good point 05:05:33 @tell shachaf see oklopol in logs 05:05:33 Consider it noted. 05:09:44 hmm, my Turing-completeness-without-player-action proof for Magic: the Gathering is almost complete 05:10:10 any Magic fans (b_jonas?) here happen to know a way to cause an arbitrary creature to stop being a creature, while keeping its rules text around? 05:10:14 it's OK if it's silly 05:10:44 when you discuss for example the full shift S^\Z for a finite set S (that is, the cantor space), you want to talk about open sets which are somehow computable, and closed sets which are somehow computable 05:10:55 what you do is say you have an "RE open set" 05:11:19 which means that a turing machine outputs words w such that every word with central pattern w is in your set 05:11:27 and you have coRE closed sets 05:11:40 by outputting words w such that no word with w in the center is in your set 05:13:26 well i don't know what percentage of humans would say that, but you certainly could say that 05:13:48 actually I think you can just turn it into a copy of a licid until end of turn, but that doesn't really work for what I want as then it gets enchant creature, which I don't want either 05:13:59 basically the idea is that it needs to be able to survive infinitely many -1/-1 effects 05:16:00 o.O at Unexpected Results 05:20:50 "You can concede a game while Platinum Angel on the battlefield. A concession causes you to leave the game, which then causes you to lose the game (Once you concede, you no longer control a Platinum Angel, so its ability can't prevent you from losing the game)." 05:21:05 Why did there need to be a ruling on this? 05:21:18 As in, did someone concede then dispute the concession? 05:22:59 -!- oerjan has quit (Quit: You're asking whether geeks did something ridiculously pedantic?). 05:23:18 yeah, I like oerjan's explanation for this 05:23:58 hi ais523 05:24:04 hi quintopia 05:24:51 ais523: do you want to review the language we discussed the other day before I post it to the wiki 05:24:58 which one is that? 05:25:27 the empowered NOMW 05:25:51 ais523: what's oerjan's explanation? 05:26:04 Sgeo: see the quit message 05:26:09 "(Quit: You're asking whether geeks did something ridiculously pedantic?)" 05:26:24 quintopia: not sure I remember, what does NOMW stand for? 05:26:24 oh 05:26:48 noit o' mnain worb 05:28:12 quintopia: ah right 05:28:21 you may as well just post it, and then I can look at it there 05:28:25 ais523: also are you working on refining the MTG TM? remove the requirement that a player has an option? 05:28:32 quintopia: yep 05:28:37 I'm trying to remove phasing altogether 05:28:44 :O 05:28:45 via inventing an esolang that maps more directly than a TM does 05:29:02 actually, I guess just giving these creatures all creature types would work 05:29:16 can you give a creature all creature types? 05:29:27 artificial evolution only changes the creature type right 05:29:35 it was a mechanic in lorwyn block 05:29:47 I'm pretty sure at least one card granted it to arbitrary creatures 05:30:45 yes 05:30:50 it's a red pump spell 05:30:57 actually there's an entire cycle 05:31:00 "X of velis vel" 05:31:04 just checked gatherer 05:31:13 also amoeboid changeling, which has it as a tap ability 05:31:13 ah 05:31:26 I could only remember the red one, plus nameless inversion 05:31:29 err, not a cycle 05:31:35 red, white, and blue 05:31:38 but no green or black 05:32:05 how bizarre 05:32:26 you clearly know mtg much better than me 05:32:31 anyone know how many creature types there are offhand? this construction needs like 200 05:33:49 more than that, surely? 05:33:54 I think so 05:38:38 http://www.reddit.com/r/magicTCG/comments/1vc7ot/if_a_future_civilization_found_a_complete_set_of/ 05:39:40 so can you design a magic deck such that with probability 1, no matter what the players do, a particular computation emerges 05:39:43 Sgeo: the "what happens if you play Floral Spuzzem and you're using that Un-card that removes errata" has become something of an inside joke 05:39:48 i guess they can just say "okay i give up"? 05:40:01 but other than that, how likely is it that you can do that 05:40:03 I believe the current opinion is that the Floral Spuzzem gets a loss for slow ply 05:40:04 *play 05:40:15 oklopol: they could also not play any spells 05:40:21 there aren't any cards that force you to play them 05:40:30 no could there be, reasonably, it'd be impossible to enforce 05:42:49 why? 05:44:15 because nobody but the person holding them would know that they'd drawn them 05:44:29 there are many card games with such rules though 05:44:50 it feels really wrong but works in practice 05:45:06 the Magic designers are really worried about that sort of cheating, for some reason 05:45:07 because people are honest 05:45:20 they were worried even about designing cards that gave you a bonus if you played them immediately upon drawing them 05:45:36 ? 05:45:37 or cards that let you look at a set of cards from your deck without changing their order 05:46:00 both of which are enforceable by the opponent, but only if they pay attention to how your hands are moving 05:46:17 i see 05:46:31 -!- conehead has quit (Quit: Computer has gone to sleep.). 05:46:55 so, i need to do some linear algebra homework, invert matrices and stuff 05:47:24 that sucks. 05:47:35 sucks huge ass 05:47:58 also yesterday my gf was watching and kept saying "why did you write 99 there btw?" 05:48:02 so i had to explain 05:48:03 everything 05:48:14 the worst part is she was always right and it was supposed to be something else 05:48:27 lol 05:48:49 i'm sure i have much to teach these people 05:49:56 like, "why did you write 99?" 05:49:59 oh, good quesiton 05:50:01 *question 05:50:13 see what i did was realize that i am interested in the span of these vectors 05:50:26 and i know that if i sum these vectors like this, then the span does not change, but 05:50:34 "NO NO i mean 90 + 5 is 95, not 99" 05:51:13 http://www.smbc-comics.com/index.php?db=comics&id=2039#comic 05:51:53 :P 05:52:43 (she does know matrices though, i just lecture to everyone equally) 05:58:59 Both Factor and Rebol look backwards sometimes, and forwards other times 05:59:11 I'm pretty sure both prefix-only and postfix-only suck 06:03:48 ais523: http://esolangs.org/wiki/Not_The_Main_Worb 06:03:58 quintopia: I like the name :-) 06:04:41 also, that's a really good reason to have image-based source code 06:06:42 quintopia: it's not Turing-complete unless you give it infinite memory somehow 06:06:53 ais523: i didn't say it was 06:07:05 say by tiling the plane with it, with different tiled copies being taken to have different labels 06:07:22 you said you could construct TC families 06:08:09 I do think that construction at the bottom proves it NP-hard to determine whether a stable state exists for any given NTMW program, though 06:08:15 ais523: which implies that one is allowed to generate circuits with a limited TM, yes? 06:08:32 quintopia: yeah but TCness doesn't work like that 06:08:52 being able to produce arbitrary circuits is proof of NP difficulty, though 06:09:04 ais523: I'll change it to LBA then. happy? 06:09:08 what's more interesting is whether that's PSPACE-complete 06:09:18 quintopia: no because it doesn't take input, that's part of the definition of LBA 06:09:41 ais523: we can define input size as "number of raw sources and sinks" 06:09:50 there's a whole different set of complexities for things with finite memory, like that finite state machine 06:09:53 that's code size, not input size 06:10:09 ais523: they function as input to the circuit 06:10:25 err, no? 06:10:30 why do i keep pinging you no one else is talking 06:10:45 because they act deterministically, there's no input being received from outside 06:10:52 and if there /were/, you still wouldn't have an LBA 06:11:03 there's no input being received from outside when a TM starts with its input on the tape also 06:11:04 because the amount of data storage you have is not proportional to the size of the input you've received 06:11:16 Turing machines also aren't LBAs, though 06:11:33 the LBA restrictions of Turing machines require you to implement a separate input mechanism 06:11:41 i'm just saying your objection to calling parts of the code "input" is invalid 06:12:03 I'm saying you can't arbitrarily define some lines of code (or pixels of code, in this case) to be input 06:12:07 because that makes no sense 06:12:17 why not? 06:12:18 input isn't part of the code, by definition 06:12:41 why can't i draw a line across the image and say "everything on this line is input, everything else is code" 06:12:52 now, you could define a preprocessor that compiled input into circuitry, then you probably would have an LBA 06:12:53 " being able to produce arbitrary circuits is proof of NP difficulty, though" ? 06:13:15 maybe the circuit is something different than i imagine 06:13:48 oklopol: because if you can create an arbitrary circuit out of AND/OR/NOT/delay (even random delay), you can create a binary counter and a check circuit 06:13:51 and use it to solve 3SAT 06:13:56 or even pick out a set of pixels and say "these particular pixels are not code. they are input." 06:14:29 but usually if you can make arbitrary evaluate-only circuits, you get P completeness (you get any computation, but it's deterministic), or if the circuit has loops, you get PSPACE-hardness (because you can run any computation in the polynomial space that the logspace transducer gave you in the form of the circuit) 06:14:35 quintopia: because it doesn't make sense, for a particular program, for its data storage to be proportional in the size of the input, because the input has a fixed size 06:14:41 being a specific set of pixels 06:14:43 okay, so PSPACE-hard 06:14:51 because you can also check QSAT 06:14:57 with that same algo 06:14:57 oklopol: good, I was wondering if it was also PSPACE-hard 06:15:05 but didn't know how to prove it 06:15:29 quintopia: PSPACE-hardness is one of the highest computational classes an FSM can have, so I think the language is fulfilling its purpose pretty well 06:15:50 * ais523 looks up QSAT 06:15:52 yeah circuits don't get higher than that 06:15:55 ais523: okay imagine that the circuit family definition expands in a particular way, so that every time you add one pixel of input, you add a fixed number of other pixels that serve that pixel's input? 06:16:08 fsvo circuit 06:16:18 quintopia: then it's an LBA, agreed 06:16:27 i thought we were talking about circuit families all along here and now i find out you were talking about one particular circuit 06:16:38 right 06:17:04 this is the "input via preprocessor" idea I explained above 06:17:33 you could call it that. or you could just call it "the definition of the circuit family" 06:19:00 anyway, what if adding a pixel of input required adding a circuit proportional in size to the depth of the circuit you're adding to and increasing the depth by 1, so that the circuit size grows quadratically with input size? what is that? 06:19:48 * oklopol mumbles something about logspace-uniform circuit families 06:20:00 fuck uniformity! :D 06:20:19 wow, so it seems that the strongest known "P≠NP"-like result in the normal chain of complexity classes is "NL≠PSPACE" 06:20:23 * oklopol has been reading too much complexity theory lately 06:20:28 that's… not a very strong result 06:20:28 ais523: so should i just say it can "probably" allow the creation of PSPACE-complete circuit families? 06:20:40 quintopia: you can say that it's PSPACE-hard 06:20:52 um 06:20:56 actually, I think it's trivially PSPACE-complete 06:21:16 ok? 06:21:29 ais523: the thing is in the usual chain, there's only a "space steps" exponential jumps apart, and "time steps" exponential jumps apart. 06:21:30 given that oklopol proved it PSPACE-hard and it obviously doesn't take more than nondetrminstic polynomial space to simulate 06:21:33 and NPSPACE = PSPACE 06:21:41 the thing is, we cannot compare space and time in a nontrivial way 06:21:54 ah right 06:21:58 i'll put that then 06:22:03 well PSPACE is know to be a subset of EXPTIME 06:22:22 however, we have stronger separation results than just that an adding an exponential amount of space gives you new languages 06:22:41 right 06:22:45 and similarly for time 06:22:47 I'm not very good at complexity theory 06:22:55 like, I know the very basics, just not much more than that 06:23:21 well i know more than the basics, but it's more of a hobby for me 06:23:34 ais523: I thought we at least had P != PSPACE 06:23:52 (although we're probably gonna publish some gadget stuff soon) 06:23:55 coppro: not according to Wikipedia, apparently that's still an open problem 06:23:58 and definitely have P != EXPTIME, right? 06:24:00 coppro: we don't have that 06:24:08 P != EXPTIME because both are time classes 06:24:12 yeah, you have P≠EXPTIME 06:24:16 right, ok 06:24:31 P=PSPACE would be even more surprising than P=NP, of course 06:24:33 i know how to prove Savitch's Theorem and...I know Dick Lipton's theorem about how the polynomial hierarchy collapses, but I don't recall the proof since it's been so long since I was in his class. 06:24:48 P vs NP? no one knows because they are different types of classes. P vs PSPACE? no one knows because they are different types of classes. (except for trivial relations) 06:25:00 similarly for quantum stuff, but now there are no comparisons... 06:25:28 interestingly, randomness can be compared in nontrivial ways 06:25:37 (you come up with fun ways to approximate sizes of sets) 06:26:10 There exists an oracle separation between BQP and BPP at least 06:26:17 which is actually kinda surprising 06:26:36 yeah oracle separations exist for many things 06:27:53 i don't really know what BQP is 06:28:01 BPP except with a quantum computer 06:28:12 but it's coming up soon in my complexity theory bedtime stories book 06:28:23 huh, P_{CTC} (deterministic computations with closed timelike curves) = PSPACE 06:28:38 cool 06:28:46 not that surprising 06:29:12 oh i guess that's basically what i said about circuits with self-loops 06:29:13 at the very least, it's obvious that P_{CTC} contains NP 06:29:18 but in a fancy disguise 06:29:27 yeah 06:30:02 okay so next 06:30:06 find solutions to 06:30:16 x+3y-2z+u=-2 06:30:22 draughts is EXPTIME-complete? that's surprising 06:30:28 2x+7y+3z+4u=16 06:30:40 -x-y+4z+15u=6 06:30:56 oklopol: i'm not your CAS. invert your own damn matrices. 06:31:03 isn't that just linear programming? 06:31:20 also, where's the fourth equation 06:31:26 what's a CAS? 06:31:29 you could do it without matrices 06:31:34 oklopol: Computer Algebra System 06:31:38 like Maple or Mathematica 06:31:41 oh right 06:32:03 HE DOESN'T EVEN SPECIFY THE FIELD, HOW ARE THE STUDENTS SUPPOSED TO GUESS 06:32:16 ais523: doing elimination of large systems by hand is annoying. so is taking determinants. so is taking inverses. so, no, use a CAS. 06:32:19 that particular problem, I'd guess it's rational numbers 06:32:47 quintopia: that thing isn't large enough that I'd be annoyed at having to use elimination or substitution on it 06:32:49 quintopia: there's no fourth equation 06:32:53 it's clearly the finite field of order 23 06:32:56 that's why this is problem 6 already. 06:33:38 oklopol: so your answer is supposed to be another equation? 06:34:02 "find solutions" probably means "give the solution set in a more explicit form" 06:34:10 @messages-lead 06:34:11 oerjan said 1h 28m 37s ago: see oklopol in logs 06:34:22 i just said something about RE vs open 06:34:30 a good cas oughta be able to do that shit for ya 06:34:39 or matlab or whateverthefuck 06:34:59 making people do matrix computation by hand is pointless and cruel. 06:35:50 oklopol: the solution set should be a line right?????????????????????????????????? 06:36:35 the typical solution will be 1-dimensional, yes 06:36:53 i have no idea about this particular one yet 06:37:35 it cannot be unique, but it can be also two or three dimensional in theory 06:39:15 ah true 06:39:37 but those equations LOOK LIKE THEY ARE PROBABLY INDEPENDENT 06:39:48 yes 06:40:06 why are you reading this book oklopol 06:40:07 this reminds me that i didn't know until a few months ago that solving systems of polynomials is A Hard Problem 06:40:23 because, i don't know, i'm an idiot probably 06:40:29 if someone asks you if a matrix is invertible, you can always safely say yes 06:40:35 haha 06:40:41 i knew a fun fact about that... 06:41:01 oklopol: is the zero matrix invertible??????????????????? 06:41:16 but you will encounter that during your lifetime with 0 probability, even if you live forever. 06:41:25 oerjan: Right, so it's more complicated than "finite union", I guess. 06:41:28 assuming you only look at real matrices 06:41:29 i think it was like, if you have the set of matrices with normal random entries around zero, then the average matrix is singular and the singular matrices are measure zero 06:41:31 oh 06:41:59 you meant "if someone asks you if a randomly selected real matrix is invertible..." 06:42:00 i guess it probably doesn't matter if they're normal 06:42:22 every time you analyze a joke a frog dies, quintopia, and they are an important part of many ecosystems. 06:42:43 wait what 06:43:01 was that a joke?????? oklohelpol!!!! 06:43:09 :D 06:43:15 yeah it was a joke 06:43:21 a reeeeally funny one 06:43:30 basically what Bike said 06:44:32 the joke being that the singular matrices are generally measure zero, but you're still going to run into them because mathematicians don't sample uniformly, they look for the most pathological bullshit possible :p 06:44:48 yes, like the all zero matrix 06:44:57 where do they come up with that stuff! 06:44:59 i thought i was making that joke 06:45:00 the bullshit matrix 06:45:11 eaifheifhaiefh 06:45:20 fasdfsdfrefrewf 06:45:34 ...it seems i have yet to solve my equation 06:50:52 okay it's done 06:52:46 (i got {(7,-1,3,0) + u(28,-9,1,1) | u \in \R\} as the set of solutions) 06:53:01 plausible. 07:15:06 -!- b_jonas has quit (Remote host closed the connection). 07:26:31 -!- FreeFull has quit. 07:35:26 Screw concatenativity, I want mixfix 07:36:54 1 > 2 if [ "Math broke" print ] [ "Math didn't break" print ] 07:37:29 Words could take in both a past stack and a future stack 07:38:21 Sgeo: without the print it would actually look nice 07:39:11 Hmm, what's wrong with the print? But this should be valid too 07:39:23 1 > 2 if [ "Math broke" ] [ "Math didn't break" ] print 07:40:02 Hmm... if print took a future argument instead, this would kind of not work 07:40:16 print 1 > 2 if [ "Math broke" ] [ "Math didn't break" ] 07:40:38 print might be satisfied by the result of 1 > 2, which I don't want 07:40:59 Thank you myname 07:41:12 just make booleans unprintable :p 07:41:20 who needs that anyways 08:03:55 You could use paratheses 08:04:06 print (1 > 2 if ["Math broke"] ["Math didn't break"] 08:04:08 ) 08:04:41 where stuff in parantheses are treated as regular arguments in any other language 08:04:53 that way you can write 5 6 + (concatenativ/stackish) 08:05:07 or + (5 6) or possibly even + (5) (6) 08:06:00 i.e you delay the function and evaluate the stack of the expression in the parantheses first 08:06:03 and then run the function 08:07:49 Uh, any ideas? I have this gstreamer command line that used to work; it involves a multifilesink location='frame%08 err, never mind, I see the problem. 08:08:54 (Was supposed to be frame%08d.jpg but had written frame%08.jpg instead -- it generated the files "frame (nil)g", "frame 0x1g", "frame 0x2g", and so on.) 08:17:12 -!- nooga has joined. 08:19:49 "giblib warning: couldn't load font yudit/12, attempting to fall back to fixed. giblib warning: failed to even load fixed! Attempting to find any font. feh ERROR: Couldn't load font to draw a message" huh 08:20:05 -!- mtve has joined. 08:33:58 lol, i just realized that the Karma page on the wiki still says it is not known whether it is Turing-complete 08:34:50 fizzie: does it actually say 'feh' 08:34:52 and I just found a file on my computer from March 2009 that contains an implementation of BCT in Karma 08:35:00 i should probably post that 08:44:53 -!- nooga has quit (Ping timeout: 248 seconds). 08:57:44 oklopol : sounds ok 08:58:32 (the RE and coRE stufF) 08:58:45 ski: Hmm, did you see the question I asked earlier about that? 08:59:59 heh, %08.jpg 09:00:09 Bike: feh is a program 09:00:41 % = start of format specifier 09:01:02 0 = set the zero flag 09:01:14 8 = set minimum field width to 8 09:01:26 . = equivalent to .0, i.e. set precision to 0 09:02:01 j = length modifier (the following format refers to an intmax_t/uintmax_t) 09:02:14 p = void * pointer 09:02:30 a marvellous world of printf specifiers. 09:03:15 I'm pretty sure 0, .0, and j are invalid/undefined with p 09:03:50 and passing an int where a void * is expected is also undefined behavior 09:04:12 but what you end up with is integers printed as memory addresses as if by %8p 09:04:32 oh, and the g is just a g 09:06:39 Sometimes. 09:07:23 boring 09:08:56 -!- nooga has joined. 09:10:24 mauke: Is if (argv[0] && argv[0][0]) { Prog = argv[0]; } a standard idiom for you? 09:11:04 yes 09:11:09 why? 09:13:20 I don't know. Does that exist anywhere else? 09:13:50 I don't know 09:44:55 ski: i mainly meant that i've more often seen arithmetical hierarchy terminology used for this stuff 09:45:26 so like \Pi^0_1 instead of coRE 09:45:54 (not that there's a difference in meaning) 09:48:15 shachaf : no 09:51:40 it was https://plus.google.com/+ShachafBen-Kiki/posts/Bt4CxtttYxP 09:51:52 I don't know how much of that was brought up in the discussion here. 09:55:43 shachaf : perhaps you could repeat the question ? 09:55:46 * ski . o O ( re "split", ) 09:56:04 someone point me at a language that we don't know if it's TC or not 09:56:47 a retract situation consists of one morphism `s : A -> B' and one morphism `r : B -> A', satisfying `r . s = id_A' 09:57:08 `r' is said to be a retraction (of `s'), and `s' is said to be a section (of `r') 09:57:12 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: r': not found 09:57:42 if we define `i = s . r', then `i . i = s . r . s . r = s . id_A . r = s . r = i', so `i' is then an idempotent 09:58:24 (in a retract situation, `r' is also known as a "split epi(morphism)/epic" and `s' as a "split mono(morphism)") 09:59:21 given any idempotent `i', if we can find `r' and `s' such that `r . s = id' (a retract situation), and `s . r = i', then `i' is called a split idempotent, we say that `i' splits 09:59:31 shachaf : perhaps that helps ? 10:01:19 That's yet another thing that's called "split", not the epi or the mono but their composition (in the other direction) 10:01:42 split splat splut 10:01:50 Oh, maybe it's being used as an adjective. 10:02:20 The epi and mono are "split" from the idempotent. 10:02:25 yes 10:02:36 OK. 10:02:46 (that's as far as i understand it) 10:02:50 Anyway, the question in a rough form is in the Google+ post above. 10:03:27 I will probably delete the post later, as I do. 10:03:43 Someone commented so I'd feel a bit bad deleting it. :-( 10:06:24 shachaf : did you see Martín Escardó's "Synthetic topology of data types and classical spaces" in 2004-11 at ? 10:07:21 No. 10:08:47 "Semidecidable property ≈ open set" is mentioned in chapter 1 10:09:25 Oh, well, I've heard that analogy before, sure. 10:10:58 Is that exactly what I'm trying to get at here? 10:13:08 "Given a family `p_i(x)' of properties, in order to observe that the disjunction `\/_i p_i(x)' holds it suffices to observe that one of the disjuncts `p_i(x)' holds. Hence arbitrary disjunctions of observable properties are observable. ..(some qualifications to that).." 10:13:56 btw, everyone: http://esolangs.org/wiki/StackFlow 10:14:06 not bad for 2 and a bit days' work :-) 10:14:23 Qualifications described in a later chapter in that PDF, I guess. 10:14:42 Thanks for the link, I'll probably read it tomorrow or something. 10:15:16 ais523: what is "sufficiently large that the language remains Turing complete"? doesn't that need to be unbounded? 10:15:38 coppro: no, it just needs to be large enough to implement at least one interpreter for a Turing complete language 10:16:19 and I have one that uses 5 stacks, 20 symbols, 41 rules 10:16:33 the program it interprets is input using the initial contents of the stack, which interpreters can't put bounds on 10:16:46 ah 10:16:52 also, I love the markdown 10:17:13 "This is a program implements a cyclic tag system in StackFlow." 10:17:16 thanks 10:17:27 err, right 10:17:29 let me fix that 10:17:37 btw, it's untested because I don't have an interp yet 10:18:27 incidentally, is StackFlow the first esolang designed for literate programming? it may be 10:18:33 perhaps 10:18:42 it does look kind of cool 10:19:21 coppro: I'm not sure what made me think of Markdown-based syntax, but when I did, the opportunity was too good to pass up 10:28:04 ais523: Neat. 10:28:25 (The StackFlow page.) 10:28:41 * shachaf goes to sleep, should have gone 2 hours ago 10:29:39 -!- Bike has quit (Ping timeout: 272 seconds). 10:50:46 -!- MindlessDrone has joined. 10:51:04 (About Time Walk) 10:51:06 "Combos well with a deck." 10:51:44 -!- MindlessDrone has quit (Client Quit). 11:02:59 -!- MindlessDrone has joined. 11:16:53 -!- impomatic has quit (Ping timeout: 248 seconds). 11:56:38 -!- peapodamus has quit (Read error: Connection reset by peer). 11:58:41 -!- peapodamus has joined. 12:04:07 -!- Taneb has quit (Read error: Operation timed out). 12:04:11 -!- ski has quit (Read error: Operation timed out). 12:04:24 -!- ski has joined. 12:04:33 -!- Taneb has joined. 12:05:34 -!- qlkzy_ has changed nick to qlkzy. 12:10:19 In Mergesort, does it particularly matter how you divide the list? 12:11:22 Taneb: no, although particularly stupid divisions (like always dividing into 1 element, and the rest) hurt the computational class 12:11:39 *computational complexity 12:12:10 Okay, so just alternating elements is fine? 12:12:54 yep 12:13:20 a good way to think about it is this: if a sort algorithm cares what order the list was in originally, it's probably broken 12:13:20 Sweet 12:14:04 I have a Haskell function called "notQuickSort", which, true to its name, is not quicksort 12:15:02 there are a lot of functions that aren't quicksort 12:15:09 ais523: I wouldn't call a (comparison-)sort function that's O(n log n) worst-case but O(n) best-case for an already-sorted list "broken". 12:15:29 fizzie: it's O(n²) worst case 12:15:34 oh, I see 12:15:41 I wouldn't call that "caring", in that case 12:16:00 in the sense of the output being different 12:16:16 ais523, I was aiming to write Quicksort, but I wasn't including the pivot except in the singleton list case 12:16:25 right 12:16:32 so the pivots just disappear? 12:18:13 Yeah, it was me being stupid. It's fixed now, though 12:32:03 -!- ais523 has quit. 12:52:30 -!- nooga has quit (Ping timeout: 245 seconds). 12:55:54 -!- nooga has joined. 12:58:48 -!- boily has joined. 12:58:59 -!- metasepia has joined. 13:14:31 -!- yorick has joined. 13:16:32 -!- Sgeo has quit (Read error: Connection reset by peer). 13:28:50 -!- Sorella has joined. 13:58:01 -!- copumpkin has quit (Quit: My MacBook Pro has gone to sleep. ZZZzzz…). 14:13:33 here's a php puzzle: http://paste.scsys.co.uk/291607?tx=on 14:38:55 "virtual bool aku::PhnReader::next_frame(): Assertion `m_current_frame >= m_cur_phn.start' failed." 14:39:04 Helpful. 14:42:54 fungot: aku PhnReader'nglui Cthulhu fhtagn? 14:42:54 boily: m-- m-1 doesn't work? 14:43:15 fungot: no it doesn't, the m_cur_phn.start fails the assertion. 14:43:15 boily: how big was the code 14:43:18 fungot: big. 14:43:18 boily: and sorry, no :) or :(? it would be 14:44:01 -!- epicmonkey has joined. 14:44:06 It would be big, yes. 14:44:08 -!- epicmonkey has quit (Read error: Connection reset by peer). 14:44:10 (It's not all that big.) 14:44:27 I think it doesn't like a gap in this file, is all. 14:54:39 -!- impomatic has quit (Ping timeout: 272 seconds). 14:54:50 -!- mrhmouse has joined. 15:01:42 -!- conehead has joined. 15:06:24 -!- conehead has quit (Remote host closed the connection). 15:07:03 -!- conehead has joined. 15:15:17 -!- quintopia has quit (Ping timeout: 248 seconds). 15:15:34 -!- tertu has joined. 15:18:24 -!- nooodl has joined. 15:24:27 fungot: you should fix the code 15:24:27 FireFly: i believe. 15:24:36 fungot: stop being creepy 15:24:36 FireFly: give the short example, or a file:// url which refers to my pseudofilesystem. 15:24:45 ._. 15:25:22 I'm fairly sure fungot is sentinent 15:25:23 FireFly: so cl and elisp have it, but i discovered that the library system is intended to provide a way to make 15:25:42 oh yeah, lisp is popular in AI research 15:32:24 pseudofilesystem? 15:32:35 FireFly: it is a well known fact that fungot is sentient. blame fizzie. 15:32:35 boily: in soviet russia, crow scares you!! 15:32:41 FireFly: see ↑ 15:32:56 ._. 15:33:31 fungot: in regular #esoteric, you scare me 15:33:32 FireFly: and it was for computer science, and forcer isn't just going to ask you earlier. i mean even if he explains lots of dynamic libraries :) you already call two internal lambdas, just make your cffi and use mpi... 15:35:41 -!- Bike has joined. 16:17:53 -!- Sellyme has quit (Excess Flood). 16:20:34 -!- Sellyme has joined. 16:21:44 -!- Sellyme has quit (Excess Flood). 16:23:03 -!- Sellyme has joined. 16:28:20 -!- Sellyme has quit (Excess Flood). 16:29:34 -!- Sellyme has joined. 16:35:15 fungot: What, exactly, do you believe? 16:35:15 fizzie: the compiler is happy, " as well" you only need one! :) 16:42:08 * boily gives fungot a loch ness plushie 16:42:09 boily: well as i can't use a serialiser while it's already in use) 16:43:50 what are you serializing, fungot? 16:43:50 mrhmouse: i'd like to have the thread stay alive and accept future messages, i get pretty fnord 16:44:45 pretty fnords. heh ^^ 16:52:46 -!- Phantom_Hoover has joined. 16:52:51 -!- Phantom_Hoover has quit (Changing host). 16:52:51 -!- Phantom_Hoover has joined. 16:53:57 `ello Phantom_Hoover 16:54:00 Phantom_Helloover 16:54:19 impressive 16:54:25 `paste bin/ello 16:54:29 http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/bin/ello 17:00:20 `words 17:00:25 rheiro 17:00:30 `run ello `words 10` 17:00:34 ferello 17:00:41 `run ello "`words 10`" 17:00:45 tesheaf gaya reprovemon egellorguer kalm gester dire warpe ostv fedeipenne 17:01:26 I feel like "tesheaf" should produce "teshellaf" 17:02:31 Ah, I see the issue. It's operating on the list all at once 17:03:22 `run for word in $(words 10); do ello $word; done 17:03:32 holtykkellabellon \ appomellorstag \ fimello \ gaffenello \ albrevello \ lebranello \ wasschedello \ clepellosit \ damello \ acarello 17:04:04 `ello Ngevd 17:04:07 Ngevdello 17:04:11 fungot: It can get pretty fnord if you're trying to serialize a thread, yes. 17:04:12 fizzie: am almost done downloading it. ( which i don't use it any more 17:04:51 fungot: then why are you downloading it? 17:04:51 mrhmouse: it's _not_ a useful observation if the means of a lambda would mean having a regular expression srfi defined actual regular expressions, do it well 17:22:09 Are there any esoteric templating/markup languages? 17:22:30 Specifically, ones that translate to HTML? 17:26:02 fungot: downloading srfis, eh+ 17:26:02 FireFly: actually i think it's just so that i don't 17:26:14 fungot: oh, okay, not downloading SRFIs then 17:26:14 FireFly: yay. i will correct this anyway, it should only work on a ppc, then? lists? 17:26:41 Pretty sure you're talking about srfi-1, fungot 17:26:41 FireFly: just that when i tried 17:27:20 `words --help 17:27:22 Usage: words [-dhNo] [DATASETS...] [NUMBER_OF_WORDS] \ \ options: \ -l, --list list valid datasets \ -d, --debug debugging output \ -N, --dont-normalize don't normalize frequencies when combining \ multiple Markov models; this has the effect \ of making larger dataset 17:27:41 `run words -l | xargs 17:27:44 valid datasets: --eng-1M --eng-all --eng-fiction --eng-gb --eng-us --french --german --hebrew --russian --spanish --irish --german-medical --bulgarian --catalan --swedish --brazilian --canadian-english-insane --manx --italian --ogerman --portuguese --polish --gaelic --finnish --norwegian --esolangs default: --eng-1M 17:28:04 `run words --german-medical 10 | xargs -n 1 ello 17:28:11 beridiertellome \ akzellon \ gregelseptellom \ pertemototelloniumcin \ retrinmesierello \ silandsello \ lungseinfallello \ pellonsen \ helllyopiege \ krebello 17:28:16 mrhmouse, I haven't heard of any. Not sure how you could go about creating an interesting one either. Interesting idea though. 17:39:32 -!- atrapado has joined. 17:42:45 * peapodamus switches to #esoteric 17:42:49 PEAPODAMUS IS IN THE HOUSE 17:42:51 ┏(-_-)┛┗(-_-)┓┗(-_-)┛┏(-_-)┓ 17:43:23 lol dead channel 17:43:28 * peapodamus switches to #Windows95 17:43:34 PEAPODAMUS IS LEAVING THE HOUSE 17:43:35 ┏(-_-)┛┗(-_-)┓┗(-_-)┛┏(-_-)┓ 17:43:38 \o_ _o/ \o/ 17:43:38 | | | 17:43:39 >\ >\ >\ 17:44:10 woohoo 17:44:12 party on 17:44:18 party on mothafucka party on 17:44:18 wo 17:44:19 wo 17:44:19 wo 17:44:20 The party is now on. 17:44:21 party on 17:44:22 so on 17:44:23 woohoo 17:45:01 O O 17:45:14 what was the ocular pattern for myndzi? 17:45:32 O.O 17:45:35 (or firework, or whatever that flowery thing is supposed to be) 17:45:37 O | O 17:45:43 -!- FreeFull has joined. 17:45:48 \/ 17:46:15 U+1F440 (f0 9f 91 80): EYES [👀] 17:46:20 ~party 17:46:21 --- Possible commands: dice, duck, echo, eval, fortune, metar, ping, yi 17:46:31 `party 17:46:33 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: party: not found 17:46:38 `celebrate 17:46:40 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: celebrate: not found 17:48:05 `wl lala 17:48:08 You get NOTHING! You LOSE! Good DAY sir! 17:48:18 oh. Win/Lose 17:48:52 `rot256 secret 17:48:54 secret 17:49:05 `rot0 secret 17:49:07 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: rot0: not found 17:49:52 `cat `type -p fsck` 17:49:56 cat: `type -p fsck`: No such file or directory 17:50:47 `ln -s /usr/bin/cat /hackego/bin/rot0 17:50:49 ln: invalid option -- ' ' \ Try `ln --help' for more information. 17:50:53 `run ln -s /usr/bin/cat /hackego/bin/rot0 17:50:55 ln: creating symbolic link `/hackego/bin/rot0': No such file or directory 17:51:04 `run ln -s /hackego/bin/rot0 /usr/bin/cat 17:51:05 ln: creating symbolic link `/usr/bin/cat': Read-only file system 17:51:10 `run cat `type -p fsck` 17:51:13 cksum /dev/urandom 17:51:50 methinks that will not terminate 17:51:57 `fsck 17:52:12 ln operand order is like cp 17:52:22 o.o 17:52:29 Oh, not that either 17:52:32 `run ls -l /hackego/bin/rot256 17:52:58 !celebrate 17:53:00 No output. 17:53:04 Hm 17:53:06 ls: cannot access /hackego/bin/rot256: No such file or directory 17:53:17 `run ls -l `type -p rot256` 17:53:19 lrwxrwxrwx 1 5000 0 9 Sep 25 13:06 /hackenv/bin/rot256 -> /bin/echo 17:53:33 ^celebrate 17:53:33 \o| c.c \o/ ಠ_ಠ \m/ \m/ \o_ c.c _o/ \m/ \m/ ಠ_ಠ \o/ c.c |o/ 17:53:33 | c.c.c | ¯|¯⌠ `\o/´ | c.c.c | `\o/´ ¯|¯⌠ | c.c.c | 17:53:34 /| c.c |\ /< | | /< c.c >\ | |\|/< c.c /| 17:53:34 /´¯|_) /´\ 17:53:34 (_| (_| |_) 17:53:36 There we go 17:53:39 FreeFull: tsk, you had the wrong directory. 17:53:40 c.c! 17:53:49 thanks FireFly. 17:54:22 `wl 17:54:25 You get NOTHING! You LOSE! Good DAY sir! 17:54:34 :( 17:55:27 Is hackenv/bin not in PATH? 17:55:48 Should be 17:55:55 Weird 17:55:58 `run echo $PATH 17:56:00 ​/hackenv/bin:/opt/python27/bin:/opt/ghc/bin:/usr/bin:/bin 17:56:08 I have rot0 in there but HackEgo errors when I try to run it 17:56:12 -!- monotone_ has joined. 17:56:18 `wl en de hippopotamus 17:56:20 Flusspferd 17:56:21 `run rot0 /dev/urandom 17:56:23 bash: rot0: command not found 17:56:30 `run /hackenv/bin/rot0 /dev/urandom 17:56:32 `run ls -l bin/rot0 17:56:32 bash: /hackenv/bin/rot0: No such file or directory 17:56:34 lrwxrwxrwx 1 5000 0 12 Jan 16 17:54 bin/rot0 -> /usr/bin/cat 17:56:36 -!- monotone has quit (Ping timeout: 252 seconds). 17:56:38 Oh 17:56:39 `which cat 17:56:41 ​/bin/cat 17:56:55 Stupid error messages 17:57:36 Made it echo rather than cat anyway 17:57:40 `rot0 Meow 17:57:42 Meow 17:58:23 -!- monotone_ has changed nick to polytone. 17:58:28 `wl en de Xenos 17:58:42 Traceback (most recent call last): \ File "/hackenv/bin/wl", line 52, in \ q = query(continue_id) \ File "/hackenv/bin/wl", line 44, in query \ response = urllib2.urlopen(url).read() \ File "/opt/python27/lib/python2.7/urllib2.py", line 126, in urlopen \ return _opener.open(url, data, timeout) \ File "/opt/python27/lib/ 17:58:53 Yay erros 17:59:29 `wl en de Xenos 17:59:32 My hovercraft is full of eels. 17:59:40 yay. 17:59:49 (It was meant to do that.) 17:59:50 I thought that was hu→en 17:59:57 http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/bin/wl is a fun read 18:00:54 FireFly: you have to find any wikipedia page with empty 'languages' block. 18:03:03 I see 18:03:30 `wl sv en Pero micca 18:03:33 You get NOTHING! You LOSE! Good DAY sir! 18:03:55 `wl sv en "Pero micca" 18:03:56 `run wl sv en "Pero micca" 18:03:56 -!- conehead has quit (Quit: Computer has gone to sleep.). 18:03:58 You get NOTHING! You LOSE! Good DAY sir! 18:03:59 Traceback (most recent call last): \ File "/hackenv/bin/wl", line 52, in \ q = query(continue_id) \ File "/hackenv/bin/wl", line 44, in query \ response = urllib2.urlopen(url).read() \ File "/opt/python27/lib/python2.7/urllib2.py", line 126, in urlopen \ return _opener.open(url, data, timeout) \ File "/opt/python27/lib/ 18:04:15 `````````````````````````````````````````````````` 18:04:16 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: `````````````````````````````````````````````````: not found 18:04:32 `thankjames 18:04:33 `cat bin/` 18:04:34 Thanks, James. Thames. 18:04:35 exec bash -c "$1" 18:05:40 `` echo 123 18:05:43 123 18:06:18 `` echo $PATH 18:06:20 ​/hackenv/bin:/opt/python27/bin:/opt/ghc/bin:/usr/bin:/bin 18:08:08 `env PATH 18:08:11 env: PATH: No such file or directory 18:08:20 I guess you have to grep it 18:08:26 oh, right, it takes a command to run 18:09:16 int-e: huh? a special `thank case? 18:11:15 `perl -e'$,=",";print @ARGV,"\n"' $PATH 18:11:17 Scalar found where operator expected at -e line 1, near "'$,=",";print @ARGV,"\n"' $PATH" \ (Missing operator before $PATH?) \ syntax error at -e line 1, next char $ \ Execution of -e aborted due to compilation errors. 18:11:20 `̀thanks thanks 18:11:22 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: ̀thanks: not found 18:11:40 `` perl -e'$,=",";print @ARGV,"\n"' $PATH 18:11:42 ​/hackenv/bin:/opt/python27/bin:/opt/ghc/bin:/usr/bin:/bin, 18:13:26 boily: Apparently, though I have no idea why. 18:13:42 `` cat $(type -p thankjames) 18:13:44 thanks James 18:14:33 `` echo ${PATH//:/ } 18:14:36 ​/hackenv/bin /opt/python27/bin /opt/ghc/bin /usr/bin /bin 18:16:08 -!- conehead has joined. 18:16:24 `which run 18:16:26 No output. 18:16:43 `run which `run 18:16:45 bash: -c: line 0: unexpected EOF while looking for matching ``' \ bash: -c: line 1: syntax error: unexpected end of file 18:16:54 `` which run 18:16:56 No output. 18:17:00 `run which run 18:17:02 No output. 18:17:04 * int-e shrugs 18:17:13 * boily wobbles 18:17:23 * int-e bounces 18:17:58 `run than run! 18:18:00 that* 18:18:01 bash: than: command not found 18:20:38 `info 18:20:40 info: Writing node (dir)Top... \ File: dir,Node: TopThis is the top of the INFO tree \ \ This (the Directory node) gives a menu of major topics. \ Typing "q" exits, "?" lists all Info commands, "d" returns here, \ "h" gives a primer for first-timers, \ "mEmacs" visits the Emacs manual, etc. \ \ In Emacs, you can click mouse bu 18:21:33 `` echo $IRC_SOCK 18:21:36 No output. 18:24:11 `man ls 18:24:14 man: can't open the manpath configuration file /etc/manpath.config 18:24:26 `vi 18:25:01 I guess it didn't like that 18:25:04 Vim: Warning: Output is not to a terminal \ [1;24r[?25h[?8c[?25h[?0c[27m[24m[0m[H[J[?25l[?1c[2;1H[1m[34m~ [3;1H~ [4;1H~ 18:25:06 `cat /hackenv/share/maze.c 18:25:08 main() { asm("xor %edi, %edi\n" "inc %edi\n" "mov %rsp, %rsi\n" "go: movl $0xb195e2, (%rsi)\n" "rdtsc\n" "and $1, %al\n" "add %al, 2(%rsi)\n" "mov %edi, %eax\n" "xor %edx, %edx\n" "mov $3, %dl\n" "syscall\n" "jmp go"); } 18:25:12 (huh?!) 18:25:28 hackenv is cwd I'm fairly sure 18:25:42 `pwd 18:26:17 `run pwd 18:26:32 poor thing 18:26:36 hm. it is stuck. 18:26:45 * boily unsticks HackEgo with his trusty mapole 18:27:09 -!- Slereah has joined. 18:27:31 -!- FreeFull has quit (Ping timeout: 260 seconds). 18:27:57 -!- Slereah_ has quit (Ping timeout: 252 seconds). 18:28:30 -!- atrapado has quit (Ping timeout: 252 seconds). 18:28:30 -!- glogbackup has quit (Ping timeout: 252 seconds). 18:29:01 ​/hackenv 18:29:21 ​/hackenv 18:30:22 good boy 18:30:59 good mapole 18:38:01 ~metar CYUL 18:38:01 CYUL 161800Z 21006KT 15SM FEW030 FEW120 M01/M08 A2996 RMK CU1AC2 CU TR SLP147 18:38:56 http://0-media-cdn.foolz.us/ffuuka/board/tg/image/1336/15/1336155252526.jpg 18:39:41 heh 18:39:45 :D 18:40:04 Oh look, here's Urist! 18:41:34 -!- atrapado has joined. 18:51:01 I should go back to dorf fortress 18:51:03 it has been a while 18:51:26 `? tanea 18:51:33 Tanea plays Minecrafs, Dware Fortresr, and lives in Hexhal. 18:52:31 *playr, anc liver im? 18:52:54 `run sed -i s/Hexhal/Yorj/ wisdom/tanea 18:52:57 No output. 18:53:43 Let's create a new world! 18:53:57 A fuck huge world 19:04:05 and call it Yorj! 19:04:32 (I like the sound of “Yorj”. /jɔʁʒ/) 19:05:46 "Oh this looks like a great place to build a fortress!" 19:05:49 *snow everywhere* 19:05:50 Noooo 19:10:42 ~eval "With an updated cabal..." 19:10:43 "With an updated cabal..." 19:13:44 -!- FreeFull has joined. 19:18:26 -!- augur_ has quit (Remote host closed the connection). 19:18:52 -!- augur has joined. 19:19:15 -!- FreeFull has quit (Ping timeout: 252 seconds). 19:23:33 -!- augur has quit (Ping timeout: 272 seconds). 19:26:10 -!- FreeFull has joined. 19:34:03 "Minecrafs", is there a point to that typo? 19:34:21 `? .doorstop 19:34:24 You do not have the clearance necessary to view this entry. 19:42:12 -!- FreeFull has quit (Ping timeout: 252 seconds). 19:47:39 -!- Phantom_Hoover has quit (Ping timeout: 276 seconds). 19:50:44 -!- Bike has quit (Ping timeout: 272 seconds). 19:52:08 -!- nchambers has joined. 19:56:39 -!- SirCmpwn has quit (Ping timeout: 260 seconds). 19:57:51 int-e: yes 19:58:05 the same point as with the other typns in that line 19:58:12 -!- Bike has joined. 20:05:17 -!- augur has joined. 20:05:38 -!- heroux has quit (Ping timeout: 264 seconds). 20:10:01 typns typns typns typns typns... ♪ 20:10:06 -!- heroux has joined. 20:20:28 -!- nchambers has changed nick to DTSCode. 20:30:42 -!- DTSCode has changed nick to DTSCode-Work. 20:35:35 boily: I can't help but read that as a Patapon chant 20:35:45 ~duck patapon 20:35:45 Patapon is a video game published for the PlayStation Portable handheld game console combining gameplay features of a rhythm game and a god game. 20:36:19 You do chants to spur your little force of warriors on in battle, or to give them commands such as "retreat". 20:37:38 I don't have a PSP :( 20:37:59 I want to control little characters by rhythming unpronounçable syllables! 20:38:50 -!- Sprocklem has joined. 20:39:47 boily: I don't own a PSP either, I've only seen the game and thought it interesting. 20:40:59 * boily scands “tnuctip tnuctip tnuctip tnuctipun” 20:51:52 -!- SirCmpwn has joined. 20:53:08 I don't own a PSP either, but I have an annoyingly long list of PSP games that I'd like to play 20:53:33 * FireFly swats Nippon Ichi for not making more games for Nintendo consoles 21:11:22 -!- MindlessDrone has quit (Quit: MindlessDrone). 21:14:41 -!- CADD_ has joined. 21:14:59 -!- CADD_ has quit (Client Quit). 21:16:11 -!- Bike has quit (Ping timeout: 265 seconds). 21:19:39 -!- FreeFull has joined. 21:23:48 ~echo test 21:23:48 test 21:24:10 ooookay... something weird happened to the metasepia logs. now everything is in bold light blue... 21:24:39 \033[1;31mtest 21:24:58 '[1;31mtest 21:25:18 `run echo -e '\e[1;31mhi boily' 21:25:28 ​[1;31mhi boily 21:25:35 hm 21:25:42 it worked. bold red. 21:26:00 `run echo -e '\e[0mnormality!' 21:26:02 ​[0mnormality! 21:26:13 Maybe you want to strip control sequences 21:26:25 maybe I really want to strip that stuff. 21:26:35 oh well. time to disappear in the Great Cold Outside. 21:26:41 -!- boily has quit (Quit: REFRIGERATED CHICKEN). 21:26:42 -!- metasepia has quit (Remote host closed the connection). 21:26:59 `run echo $'\004aare you using irssi?\004a' 21:27:01 ​aare you using irssi?a 21:27:54 * FireFly wonders what ^D would be mnemonic for 21:28:09 "dammit" 21:28:10 oh, maybe some kind of extended colour thing? 21:28:20 considering it's one after ^C 21:28:57 Most of the other IRC formatting control-codes are mnemonic, so I figure ^D would be too 21:29:03 -!- Bike has joined. 21:30:14 `run echo $'are you using \004 are you using I wish I was, now, since I'm curious what I'm missing out on 21:31:55 \004a is 21:32:02 \004 hell yea 21:32:58 Ah 21:33:00 well, I'm seeing red ^D for 004 :) 21:34:10 using irssi with http://int-e.eu/~bf3/tmp/colorhack.pl 21:35:14 "The eval function works with text variables to implement a powerful text macro facility." hey Gregor did your evil eval paper mention matlab because i've got some choice quotes here 21:38:08 IT IS TIME TO TRY TO BAKE A CAKE 21:38:17 godspeed 21:39:05 A class of functions, called "function functions," works with nonlinear functions of a scalar variable. That is, one function works on another function. 21:40:16 functional. 21:56:25 * ski . o O ( `@(x,v) x .* v + w' ) 21:56:40 -!- oerjan has joined. 21:58:50 ski: thanks for the reference to that paper yesterday, looks relevant to something or other that i'm probably trying to figure out 21:59:01 will know more after reading it 22:05:10 -!- atrapado has quit (Quit: Leaving). 22:07:11 "Weak Limited Principle of Omniscience" is a p. hesitant name 22:07:34 i don't recall whether i asked you whether you had seen Steven Vicker's "Topology Via Logic" 22:07:40 shachaf : hehe 22:08:32 -!- nchambers has joined. 22:08:37 also "Lesser Limited Principle of Omniscience" 22:08:44 (not the same thing) 22:08:46 ski: I have seen it -- we talked about "topological systems" as related to Chu spaces at one point. 22:09:10 (I don't remember who recommended it to me before, but thanks for the recommendation if it was you.) 22:09:13 (Hmm, it probably was.) 22:11:40 -!- DTSCode-Work has quit (Ping timeout: 245 seconds). 22:12:03 ,,, 22:12:21 also LEM/PEM is called PO (Principle of Omniscience) by Bishop 22:16:35 (and Markov's Principle, MP, is considered an Omniscience Principle (though not a Brouwerian one, but a Markovian one). so reducing something to it amounts to a Markovian (counter-)example, rather than a Brouwerian (counter-)example) 22:17:34 shachaf : did the Escardó paper mention WLPO, or which ? 22:17:55 http://www.cs.bham.ac.uk/~mhe/papers/universe-indiscrete.pdf did 22:18:23 Which is related to a different question I was asking at one point. 22:19:13 hm, interesting, haven't read this one before 22:22:17 , 22:27:55 -!- atrapado has joined. 22:29:47 whoa, Andrej Bauer responded to my post 22:30:48 "There is another, fancy aprroach to this, called synthetic topology. Instead of doing all this computable stuff we just do ordinary topology, but we do it in intuitionistic logic. Then we can interpret such intuitionistic topology in any topos. When we pick the effective topos, we get back exactly computable topology." 22:31:53 -!- nchambers has quit (Ping timeout: 252 seconds). 22:32:54 Hang on 22:32:58 I was going to make a cake 22:33:17 so is there a Greater Principle of Ignorance 22:36:36 I Don't Know. 22:38:28 `espletive 22:38:30 befuck 22:39:07 apparently there's a Hawking's Principle of Ignorance. 22:39:21 `cat bin/espletive 22:39:23 words --esolangs 5000 | grep -o "\w\+fuck\w*" || espletive 22:40:30 `espletive 22:40:30 is 5000 too high? it (potentially) reduces the number of invocations, but I wasn't sure how much work `words is doing 22:40:33 brainfuck 22:40:57 never heard about that language 22:41:01 ever. 22:41:04 `espletive 22:41:06 brainfuck 22:41:25 `run for f in $(seq 10); do espletive; done | xargs 22:41:28 Hrm. Seems to be stuck there. Earlier I got oozlybubblefuck, which doesn't appear on the wiki. 22:41:41 blangintfuck brainfuck madbrainfuck befucks minifuck hydrainfuck alpainfuck infuck drainfuck rainfuck norfuck brainfuck 22:42:21 a good program. 22:42:34 -!- augur has quit (Read error: Connection reset by peer). 22:42:41 maybe it should have infix fucks (infux) too 22:42:54 -!- augur has joined. 22:42:59 Bike: it should. "\w\+fuck\w*" 22:43:14 it matched befucks at least 22:45:41 oh missed that. 22:47:46 `run sed -i 's/espletive/exec espletive/' bin/espletive 22:47:50 No output. 22:47:53 `espletive 22:47:59 brainfuck \ norfuck \ brainfucks 22:48:04 wat 22:48:10 `revert 22:48:12 Nice job 22:48:23 Done. 22:48:26 `espletive 22:48:29 infuck 22:48:44 oh of course 22:49:07 you cannot exec while you're still running other commands in the pipeline :P 22:49:16 but wait 22:49:25 you _shouldn't_ be doing that, should you 22:50:43 `` while ! words --esolangs 5000 | grep -o "\w\+fuck\w*"; do :; done 22:50:47 crainfuck 22:51:15 -!- augur has quit (Remote host closed the connection). 22:51:36 -!- Bike has quit (Ping timeout: 252 seconds). 22:53:07 `` sed -i 's/fuck/${1-fuck}' bin/espletive 22:53:09 sed: -e expression #1, char 16: unterminated `s' command 22:53:24 `` sed -i 's/fuck/${1-fuck}/' bin/espletive; cat bin/espletive 22:53:28 words --esolangs 5000 | grep -o "\w\+${1-fuck}\w*" || espletive 22:53:37 `espletive 22:53:40 brainfuck \ skullfuck 22:53:44 `espletive funk 22:53:47 memfuck 22:53:53 `run repeat 5 espletive 22:54:07 crainfuck thatefuck celiumbrainfuck minifuck brainfuck ballfuck memfuck 22:54:30 `cat repeat 22:54:31 cat: repeat: No such file or directory 22:54:43 `run cat $(which repeat) 22:54:45 args=$* \ for f in $(seq $1); do ${args[@]:1} ; done | xargs 22:54:53 `` sed -i 's/$/"$@"/' bin/espletive; cat bin/espletive 22:54:57 words --esolangs 5000 | grep -o "\w\+${1-fuck}\w*" || espletive"$@" 22:55:08 `` sed -i 's/"/ "/' bin/espletive; cat bin/espletive 22:55:12 words --esolangs 5000 | grep -o "\w\+${1-fuck}\w*" || espletive"$@" 22:55:17 meh. 22:55:19 `revert 22:55:21 Done. 22:55:35 `` sed -i 's/"\$/ "$/' bin/espletive; cat bin/espletive 22:55:39 words --esolangs 5000 | grep -o "\w\+${1-fuck}\w*" || espletive "$@" 22:55:46 `espletive funk 22:56:03 no funk? or did I mess this up completely now? 22:56:17 No output. 22:56:25 `espletive brain 22:56:31 pbrainstateflip 22:56:47 `espletive 22:56:50 infuck 22:56:56 int-e: very nice :) 22:57:07 i could imagine no \w+funk 22:57:35 someone with better sed skills than me should change that + to a * 22:58:09 `run words --esolangs 5000 | wc 22:58:11 ​ 1 25 203 22:58:14 `` sed -i 's/\+/*/' bin/espletive; cat bin/espletive 22:58:14 `run words --esolangs 5000 | wc 22:58:19 ​ 1 25 178 22:58:21 `run words --esolangs 5000 | wc 22:58:21 words --esolangs 5000 | grep -o "\w\*${1-fuck}\w*" || espletive "$@" 22:58:23 ​ 1 25 185 22:58:37 `` sed -i 's/\\*/*/' bin/espletive; cat bin/espletive 22:58:41 ​*words --esolangs 5000 | grep -o "\w\*${1-fuck}\w*" || espletive "$@" 22:58:51 int-e: methinks \* is not the same as * 22:58:56 hah, no. 22:58:58 `revert 22:59:00 ok if it only has one line, wtf does it sometimes print more than one hit 22:59:01 Done. 22:59:02 mrhmouse: it's not. 22:59:07 `` sed -i 's/\\\*/*/' bin/espletive; cat bin/espletive 22:59:11 words --esolangs 5000 | grep -o "\w*${1-fuck}\w*" || espletive "$@" 22:59:29 oerjan: you mean when we were running it in loops? 22:59:37 `run repeat 5 espletive 22:59:47 infuck wordfuck migolfuck brainfuck memfuck golfuck norfuck 22:59:54 mrhmouse: no, it did that sometimes even when run once 22:59:56 can words --esolangs 5000 fail? 23:00:14 int-e: it can, hence the recursive tail 23:00:41 `` for i in $(seq 10); do words --esolangs 5000 > /dev/null || echo fail!; done 23:00:43 well, `grep can fail... I don't actually know if `words can fail. 23:00:48 No output. 23:01:16 I'm still confused how espletive can produce several words in a single run. 23:01:37 oh, never mind 23:02:15 Didn't know about that `` shortcut for `run... 23:02:57 whoa 23:03:46 `espletive 23:03:52 brainfuck 23:03:57 `espletive 23:04:01 timefuck \ brainfuck 23:04:08 magic! 23:04:23 oh.. oh! 23:04:26 `cat bin/espletive 23:04:27 words --esolangs 5000 | grep -o "\w*${1-fuck}\w*" || espletive "$@" 23:04:34 It's because `words sometimes produces multiple lines 23:04:44 does it? 23:04:46 and sometimes more than one line matches the regex 23:04:51 That must be it 23:04:53 `run words --esolangs 5000 | wc 23:04:53 `` sed -i 's/-o/-o -m 1/' bin/expletive; cat bin/espletive 23:04:54 | 23:04:54 >\ 23:04:55 ​ 1 25 166 23:04:55 sed: can't read bin/expletive: No such file or directory \ words --esolangs 5000 | grep -o "\w*${1-fuck}\w*" || espletive "$@" 23:05:05 `run words --esolangs 5000 | wc 23:05:07 `` sed -i 's/-o/-o -m 1/' bin/espletive; cat bin/espletive 23:05:07 | 23:05:07 ​ 1 25 185 23:05:07 /^\ 23:05:11 words --esolangs 5000 | grep -o -m 1 "\w*${1-fuck}\w*" || espletive "$@" 23:05:19 mrhmouse: i haven't managed to make it do that... 23:05:36 -o/, really? 23:05:39 `run words --esolangs 5000 | wc 23:05:42 ​ 1 25 204 23:05:48 umm 23:05:55 What happened with my output 23:06:15 `` echo a b c | grep -o '[^ ]' 23:06:17 a \ b \ c 23:06:23 `run words --esolangs 50 | wc 23:06:25 `` echo a b c | grep -o -m 1 '[^ ]' 23:06:26 ​ 1 25 181 23:06:27 a \ b \ c 23:06:35 so -m doesn't help. grmbl. 23:06:38 `revert 23:06:41 Done. 23:06:50 head -n 1 ? 23:07:20 `` sed -i 's/||/| head -1 ||/' bin/espletive; cat bin/espletive 23:07:23 oh -o takes more than one hit? 23:07:24 words --esolangs 5000 | grep -o "\w*${1-fuck}\w*" | head -1 || espletive "$@" 23:07:32 oerjan: yes 23:07:49 from man grep: Print only the matched (non-empty) parts of a matching line, with each such part on a separate output line. 23:09:27 that'd do it. 23:09:37 this proved more amusing than I thought it would... 23:10:08 `espletive 23:10:10 No output. 23:10:22 YOU DON'T SAY 23:10:31 (head might always succeed) 23:10:36 grand. 23:11:11 oerjan: oh. hmm. 23:11:45 maybe after the recursive call? 23:11:54 yeah. 23:12:00 `revert 23:12:03 Done. 23:12:22 the number of nested processes isn't going to reduce by this... 23:12:28 `` sed -i 's/$/ | head -1/' bin/espletive; cat bin/espletive 23:12:32 words --esolangs 5000 | grep -o "\w*${1-fuck}\w*" || espletive "$@" | head -1 23:12:33 do we care? 23:12:40 `espletive 23:12:43 haifuck 23:13:08 -!- atrapado has quit (Ping timeout: 252 seconds). 23:13:45 We *could* turn it into a loop. 23:13:52 -!- mrhmouse has quit (Quit: Leaving.). 23:15:08 `` sed -i 's/\(.*\)||.*|/while ! \1; do :; done |/' bin/espletive; cat bin/espletive 23:15:12 while ! words --esolangs 5000 | grep -o "\w*${1-fuck}\w*" ; do :; done | head -1 23:15:31 `espletive 23:15:35 norfuck 23:15:39 `espletive brain 23:15:42 brainlove 23:15:57 `espletive normal 23:16:16 Now that Andrej Bauer commented on my post I don't want to delete it anymore. :-( 23:16:28 No output. 23:16:42 shachaf: fiendish 23:17:21 oerjan: are you happier now? 23:17:38 slightly 23:17:39 is oerjan a fiend 23:17:50 `espletive hell 23:17:55 clearly i'm a fr?iend 23:18:06 will you buy my soul 23:18:08 hell 23:18:32 sorry, all out of infernal cash 23:19:33 `espletive argh 23:19:40 `espletive gon 23:19:45 forthagonal 23:19:54 argh 23:19:55 Now I want to make forthagonal 23:20:13 that does sound promising 23:20:23 `` espletive ' ' 23:20:28 pointer minimallenter 23:21:24 `run for i in $(seq 5); do espletive gon; done | xargs 23:21:38 ` espletive .* 23:21:40 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: : not found 23:21:51 shogonatorycombie thagonal pogonata pogonata thagonal 23:22:04 oh 23:22:07 `espletive .* 23:22:10 redcodan iota zt xsm q-ball /// c-lon rever2pi bytejump nump redgree kayak tree aargfak p'' tri divzeros bf-pda tg that trits objector mine adjust tlwnn 23:22:54 Oh well. Validation of arguments is left as an exercise to the first one to complain about this feature. 23:25:05 `espletive sex 23:25:16 `` espletive '[0-9]\{2\}' # surely this is a feature 23:25:18 ozone9000 23:25:36 No output. 23:25:42 Why am I not surprised? 23:26:35 int-e: istr searching for "sex" on the wiki and the only mention was ironically on Taneb's user page. although that was whole-word only. 23:27:52 `espletive ex 23:28:01 hex 23:29:37 well, not as a substring either on either of language or joke language lists 23:30:07 -!- augur has joined. 23:30:48 -!- Phantom_Hoover has joined. 23:32:57 -!- peapodamus has quit (Read error: Connection reset by peer). 23:34:49 -!- peapodamus has joined. 23:57:57 -!- augur has quit (Ping timeout: 248 seconds). 23:59:50 -!- Sprocklem has quit (Ping timeout: 252 seconds). 2014-01-17: 00:13:54 -!- nooodl has quit (Ping timeout: 252 seconds). 00:30:55 -!- Bike has joined. 00:34:39 oerjan, ironic considering my sexual orientation 00:40:07 yes 00:42:20 Also, I have made a cake 00:42:25 It may or may not be edible 00:48:47 as long as it isn't yellowcake 00:55:31 I don't think it is 00:55:35 It ought to be marble cake 00:56:31 also the game 00:56:41 -!- nooga has quit (Ping timeout: 272 seconds). 00:58:05 * oerjan suddenly imagines using a 3d printer to place the light and dark batter precisely 01:04:27 Well, I have just removed it from the tin and it is the most... flat cake I have ever seen (excluding pancakes etc) 01:04:48 ok, 2d printer then hth 01:06:18 -!- yorick has quit (Remote host closed the connection). 01:12:44 i found a printer for printing _on_ cakes, but not one for the whole dough 01:14:42 -!- stuntaneous has quit (Ping timeout: 272 seconds). 01:20:39 `url bin/paste 01:20:41 http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/bin/paste 01:27:43 -!- Sgeo has joined. 01:38:15 -!- copumpkin has joined. 01:39:16 `which wl 01:39:17 ​/hackenv/bin/wl 01:39:24 `cat bin/wel 01:39:26 cat: bin/wel: No such file or directory 01:39:27 `cat bin/wl 01:39:28 ​#!/usr/bin/env python \ \ import os \ import sys \ import json \ import urllib2 \ \ proxy_handler = urllib2.ProxyHandler({'http': os.environ['http_proxy']}) \ opener = urllib2.build_opener(proxy_handler) \ urllib2.install_opener(opener) \ \ def lose(): \ print 'You get NOTHING! You LOSE! Good DAY sir!' \ sys.exit() \ \ def eels(): \ 01:39:51 `url bin/wl 01:39:53 http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/bin/wl 01:40:30 oerjan, getting closer, http://www.theverge.com/2014/1/16/5315248/hershey-3d-systems-3d-printed-chocolate-candy-partnership 01:48:43 `wl sv en smörgåsbord 01:48:46 Smörgåsbord 01:49:42 `wl no en matpakke 01:49:44 Packed lunch 01:53:22 -!- Sprocklem has joined. 01:53:32 `which spot 01:53:34 No output. 01:53:54 `run echo "echo Woof!" >bin/spot; chmod +x bin/spot 01:53:57 No output. 01:54:02 `run spot run 01:54:04 Woof! 01:54:14 -!- tertu has quit (Ping timeout: 272 seconds). 01:56:25 -!- peapodamus has quit (Read error: Connection reset by peer). 01:58:55 -!- peapodamus has joined. 02:04:17 -!- prooftechnique has joined. 02:04:20 -!- tertu has joined. 02:05:50 -!- Phantom__Hoover has joined. 02:08:51 -!- Phantom_Hoover has quit (Ping timeout: 252 seconds). 02:17:02 The “This is a leading compression solution” picture. http://www.logitech.com/en-ca/webcam-communications/articles/9443 02:20:43 ion: clearly they misspelled "misleading" hth 02:20:52 hah 02:23:22 -!- Phantom__Hoover has quit (Quit: Leaving). 02:23:58 Looks like that's "compression" by xoring with another video. 02:35:51 -!- ter2 has joined. 02:39:32 -!- tertu has quit (Ping timeout: 265 seconds). 02:43:11 I was in a Microsoft store recently 02:48:22 My condolences. 03:02:11 -!- prooftechnique has quit. 03:05:25 -!- tertu3 has joined. 03:09:19 -!- ter2 has quit (Ping timeout: 272 seconds). 03:14:43 lolwtf 03:14:48 the blocks are wavy like his shirt lol 03:15:01 that's some nonsense 03:17:47 -!- augur has joined. 03:24:13 -!- peapodamus has quit (Read error: Connection reset by peer). 03:26:01 -!- peapodamus has joined. 03:26:43 -!- quintopia has joined. 03:26:57 ~seen mqrius 03:27:28 @seen mqrius 03:27:29 MqriUs 03:27:46 @seen MqriUs 03:27:46 mQRIu5 03:27:52 what 03:28:29 that command has been removed. 03:28:44 well how the hell do i search all channel logs 03:28:52 when i don't have access to my own logs 03:29:15 `seen mqrius 03:29:20 not lately; try `seen mqrius ever 03:29:25 `seen mqrius ever 03:29:26 oh its hackego does that 03:29:30 can never remember 03:29:33 lambdabot used to. 03:29:55 why was it removed 03:29:56 No output. 03:30:24 is . a legal character in nicks? 03:30:35 -!- oerjan has set topic: Don't join if you're afraid of bots | 22nd IOCCC results: http://ioccc.org/years.html#2013 | https://dl.dropboxusercontent.com/u/2023808/wisdom.pdf http://codu.org/logs/_esoteric/ http://tunes.org/~nef/logs/esoteric/. 03:30:58 no. 03:31:10 well damn 03:31:19 preflex: @seen mqrius 03:31:20 mqrius was last seen on ##javascript 1 year, 176 days, 13 hours, 51 minutes and 24 seconds ago, saying: How do I add a body to a document with javascript? 03:31:34 ah aha 03:32:00 of course that depends on whether he's been in the same channel as preflex ... 03:32:38 oh 03:32:44 i found him 03:32:49 he's not been here 03:32:55 but he is in another channel i'm in 03:33:01 got confused 03:33:18 -!- Sorella has quit (Quit: It is tiem!). 03:33:21 i wanted to cite him for helping on the language i'm adding to the wiki, but he has no wiki account so... 03:33:29 you can use /whois to check if someone is on freenode right now hth 03:34:15 i didn't want to know if he was on freenode. i wanted to know if he'd ever been here 03:34:31 oh hm 03:34:44 `pastequotes mqrius 03:34:49 http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/paste/paste.15150 03:35:08 oops 03:35:14 `pastelog mqrius 03:35:32 THE KEYS ARE LIKE JUST NEXT TO EACH OTHER 03:35:44 http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/paste/paste.13870 03:36:00 still no 03:36:26 `seen ... ever tends to time out if it's been too long since 03:36:28 yeah i'm getting a definite no vibe 03:48:57 -!- Sprocklem has quit (Ping timeout: 252 seconds). 03:50:12 -!- peapodamus has quit (Read error: Connection reset by peer). 03:51:24 -!- peapodamus has joined. 03:53:07 -!- luser0 has joined. 03:53:36 -!- luser0 has left. 04:01:17 -!- Sellyme has quit (Excess Flood). 04:02:30 -!- tertu3 has quit (Ping timeout: 245 seconds). 04:02:37 -!- Sellyme has joined. 04:03:43 -!- Sprocklem has joined. 04:09:47 -!- mauke has quit (Disconnected by services). 04:09:57 -!- mauke has joined. 04:11:45 -!- preflex has quit (Ping timeout: 272 seconds). 04:12:08 -!- preflex_ has joined. 04:12:34 -!- preflex_ has changed nick to preflex. 04:21:29 -!- subleq_ has joined. 04:21:50 hello 04:31:25 -!- tertu3 has joined. 04:41:46 hi 05:08:53 -!- Sprocklem has quit (Ping timeout: 248 seconds). 05:13:01 -!- prooftechnique has joined. 05:40:13 -!- conehead has quit (Quit: Computer has gone to sleep.). 06:01:31 -!- oerjan has quit (Quit: nite). 06:01:35 -!- prooftechnique has quit. 06:34:40 -!- Sellyme has quit (Excess Flood). 06:35:33 -!- Sellyme has joined. 06:57:20 -!- esowiki has joined. 06:57:25 -!- esowiki has joined. 06:57:25 -!- esowiki has joined. 06:58:00 -!- esowiki has joined. 06:58:04 -!- esowiki has joined. 06:58:05 -!- esowiki has joined. 06:58:40 -!- esowiki has joined. 06:58:45 -!- esowiki has joined. 06:58:45 -!- esowiki has joined. 06:59:12 -!- esowiki has joined. 06:59:16 -!- esowiki has joined. 06:59:16 -!- esowiki has joined. 06:59:57 -!- esowiki has joined. 07:00:01 -!- esowiki has joined. 07:00:01 -!- esowiki has joined. 07:00:22 -!- esowiki has joined. 07:00:26 -!- esowiki has joined. 07:00:26 -!- esowiki has joined. 07:00:28 -!- glogbot has joined. 07:00:30 -!- EgoBot has joined. 07:00:30 -!- HackEgo has joined. 07:00:43 -!- FireFly has quit (Ping timeout: 260 seconds). 07:00:58 -!- samebchase has quit (Ping timeout: 245 seconds). 07:01:23 -!- Gregor has quit (Ping timeout: 245 seconds). 07:01:52 -!- samebchase has joined. 07:02:35 -!- FireFly has joined. 07:05:05 -!- Gregor has joined. 07:05:08 -!- tertu3 has changed nick to tertu. 07:37:26 task in haskell: write a function largestOddDiv n that calculates the largest odd divisor of all even numbers up to n using list comprehension 07:37:33 result i got: largestOddDiv n=[x|j<-[0..(length [y|y<-[1..n] ,even y] -1)],x<-[1..(div n 2)],x==maxuneventeiler ([y|y<-[1..n] ,even y]!!j)] 07:37:41 most excellent troll ever 07:51:07 -!- FreeFull has quit. 08:20:28 he could have at least done f x|odd x==x 08:23:08 > let f = maximum $ [x|x<-[1..n], n `mod` x == 0, not . even $ x] in f 15 08:23:09 Couldn't match expected type `a0 -> t0' 08:23:10 with actual type `Debug.SimpleReflect.Expr.Expr' 08:23:35 > (maximum $ [x|x<-[1..n], n `mod` x == 0, not . even $ x]) $ 15 08:23:36 Couldn't match expected type `a0 -> t0' 08:23:36 with actual type `Debug.SimpleReflect.Expr.Expr' 08:23:47 Well... it works in my ghci . 08:24:32 I'm wondering if I can write maximum as list comprehension too 08:25:04 oh well 08:25:07 they are ordered anyways 08:25:09 last should de 09:11:07 mroman: missing \n -> 09:11:11 -!- MindlessDrone has joined. 09:12:11 i should learn about topoi, i guess 09:12:17 oerjan: are you an expert thereon 09:12:42 ("thereon"? does that even make any sense?) 09:13:47 oh. yeah @\n 09:16:48 > (\n -> maximum $ [x|x<-[1..n], n `mod` x == 0, not . even $ x]) $ 15 09:16:50 15 09:16:55 > (\n -> maximum $ [x|x<-[1..n], n `mod` x == 0, not . even $ x]) $ 15876 09:16:56 3969 09:20:41 -!- impomatic has quit (Ping timeout: 265 seconds). 09:27:18 myname: What are you actually? 09:27:43 that you pose haskell tasks to others. 09:34:09 i am a teaching assistant 09:35:13 neat 09:39:12 I'd probably've trolled you too ;) 09:40:39 If the tasks aren't really interesting I'd just obfuscate the code to make it so :) 09:42:15 thinking about letting them proof by induction at the blackboard ;) 09:43:35 aaand i'm out :) 09:43:57 I don't know induction. 09:45:36 if P is true of zero and P being true of n implies that it's also true of n+1, it's true of all positive integers 09:51:30 that sentence is oddly formulated 09:51:47 if P holds true for zero, n, and n+1 it implies, that P is true for all positive integers 09:53:11 what's n? 09:53:23 the point is "if it's true of a number it's true of the next number too" 09:53:34 which is independent of whether it is actually true of any number. 09:53:46 n is a positive integer 09:53:52 which one. 09:54:07 any. 09:54:44 oh wait... 09:54:55 n = 2, 2 and 3 are prime numbers, therefore all numbers are prime 09:55:07 if P already holds for any number 09:55:12 then n + 1 makes no sense :D 09:55:15 that's what you're trying to prove! 09:55:54 well 09:55:57 2 is a prime number 09:56:02 2+1 is also a prime number 09:56:03 but i mean hey keep saying crazy bullshit in response to my trying to help 09:56:44 as you can see, a thing being true of a number and its successor doesn't imply that that succession relation is true of everything, or anything else. 10:01:17 -!- mroman has quit (Quit: so long). 10:02:54 Bike: great example, i like it 10:52:06 -!- sebbu2 has joined. 10:53:02 -!- sebbu has quit (Ping timeout: 246 seconds). 10:53:05 -!- sebbu2 has quit (Changing host). 10:53:05 -!- sebbu2 has joined. 11:01:40 -!- ais523 has joined. 11:08:35 -!- ais523 has quit. 11:44:32 -!- Sorella has joined. 12:29:41 -!- atriq has joined. 12:33:50 `oots 939 12:33:54 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: oots: not found 12:33:59 `olist 939 12:34:01 olist 939: shachaf oerjan Sgeo FireFly boily 12:40:39 shachaf : "Elementary Categories, Elementary Toposes" by Colin McLarty might be interesting 12:41:04 (it's a book) 12:41:49 -!- atrapado has joined. 12:56:53 -!- boily has joined. 12:57:10 -!- metasepia has joined. 12:59:42 `espletive good espletive morning! 12:59:56 ...? 13:00:14 No output. 13:01:47 `espletive 13:01:52 minifuck 13:02:02 `cat bin/espletive 13:02:03 while ! words --esolangs 5000 | grep -o "\w*${1-fuck}\w*" ; do :; done | head -1 13:02:30 apparently, there are no 'good' esolangs. 13:03:22 oh. 13:03:49 (my fault, I patched that file yesterday) 13:16:54 -!- Sgeo has quit (Read error: Connection reset by peer). 13:22:01 -!- atriq has quit (Quit: Page closed). 14:03:51 -!- MindlessDrone has quit (Quit: MindlessDrone). 14:19:59 hm ${1-foo} 14:20:46 So ${foo-bar} expands to $foo if $foo is non-empty, else $bar 14:20:50 good to know 14:20:58 er, else bar 14:25:24 -!- yorick has joined. 14:28:06 -!- sebbu2 has changed nick to sebbu. 14:31:06 FireFly: if you use “${foo-$bar}” with an empty foo, will it expand to the value of $bar, or the string “$bar”? 14:31:44 The former, apparently, at least in zsh 14:33:24 How much of bash's/zsh's arcane variable expansion syntax is spec'd by POSIX? 14:35:41 Ah, yes, that behaviour is spec'd apparently 14:36:09 "In each case that a value of word is needed (based on the state of parameter, as described below), word shall be subjected to tilde expansion, parameter expansion, command substitution, and arithmetic expansion." 14:38:08 When boily did a plain `espletive good espletive morning! like that, the entire "good espletive morning!" ended up in $1. (Not that it changes anything; there indeed are no 'good' esolangs. But the "no output" wasn't a proof of that.) 14:39:20 -!- nooga has joined. 14:39:20 `espletive good 14:39:51 No output. 14:41:04 `words --esolangs 20 14:41:06 recurscript brainfuck lambleq sanshoop aargfak hack gechoon mon kayak arro triptinus sanshoop just bfjouse constuck rum forte 5-log mumobinary eta-juliet 14:45:00 -!- nooga has quit (Ping timeout: 265 seconds). 14:49:09 no good esolangs? I refuse to aknowledge that horrendous affirmation! 14:54:46 `run words --esolangs 12 | perl -ne '$,=" "; print map "good$_", split;' # well there's a dozen 14:54:48 gooddoublefuck++ gooddumpfuck goodcrambler goodvar goodauo goodhargh! goodq-ref goodwhenemo goodalpl goodtri goodpeter goodsnus 14:55:07 -!- mrhmouse has joined. 14:56:05 Ah, we changed espletive into a loop? 15:03:04 -!- MindlessDrone has joined. 15:05:34 -!- nooodl has joined. 15:09:26 mrhmouse: no comment. 15:11:10 int-e: any clue what's wrong with `repeat? my bashing skills are weak. 15:11:38 It works for single digits (e.g. `repeat 5 foo) but fails for larger ones (e.g. `repeat 10 foo) 15:12:08 `` repeat 10 espletive 15:12:10 ​/hackenv/bin/repeat: line 2: 0: command not found \ /hackenv/bin/repeat: line 2: 0: command not found \ /hackenv/bin/repeat: line 2: 0: command not found \ /hackenv/bin/repeat: line 2: 0: command not found \ /hackenv/bin/repeat: line 2: 0: command not found \ /hackenv/bin/repeat: line 2: 0: command not found \ /hackenv/bin/repeat: line 2: 0: com 15:13:58 `` cat $(type -p repeat) 15:14:00 args=$* \ for f in $(seq $1); do ${args[@]:1} ; done | xargs 15:14:37 -!- quintopia has quit (Quit: leaving). 15:15:13 -!- quintopia has joined. 15:15:29 oh. 15:16:15 `` which repeat 15:16:16 ​/hackenv/bin/repeat 15:17:33 `` echo 'cnt=$1; shift; for f in $(seq $cnt); do "$@"; done | xargs' > bin/repeat 15:17:37 No output. 15:17:45 `repeat 10 espletive 15:17:46 seq: invalid floating point argument: espletive \ Try `seq --help' for more information. 15:17:54 `` repeat 10 espletive 15:18:09 this is an exciting time and place to be eh? 15:18:13 `revert 15:18:13 brainfuck intfuck golfuck brainfuck brainfuck brainfuck infuck migolfuck brainfuck infuck 15:18:16 Done. 15:18:19 huh? 15:18:33 int-e: your changes worked, it's just a slow script 15:18:43 `revert 15:18:46 Done. 15:18:50 `vert 15:18:51 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: vert: not found 15:18:57 hoily 15:19:17 `` repeat 9 espletive | sed "s/\s/\n/g" | sort -u | xargs 15:19:23 belloily 15:19:41 brainfuck brainfucks calcrainfuck drainfuck dumpfuck golfuck haifuck intfuck 15:20:30 what is espletive? it just names a random esolang with fuck in it? 15:21:36 -!- ais523_ has joined. 15:21:54 mrhmouse: {...:1} takes a substring. so only the first digit gets removed. 15:22:24 mrhmouse: I'm unfamiliar with arrays in (ba)sh, hence the shift to shift. 15:23:00 hey, I've come across an algebraic structure, and am not sure if it has a name yet (I hope it does): it's a monoid, and it's also a semilattice, with the same identity; also, for all a, b, then (a + b) = (a meet b) + c for some c 15:23:18 quinthellopia. mrhmellouse. 15:23:21 err, that's a join b 15:23:22 not a meet c 15:23:25 it's a join-semilattice 15:25:41 an example of something with these properties is the natural numbers with 0 as the identity, + as the monoid operation, max as the join operation 15:28:56 `` echo $SHELL 15:28:58 ​/bin/sh 15:29:10 `/bin/sh --version 15:29:12 ​/bin/sh: Illegal option -- 15:30:51 `` , 15:30:52 bash: ,: command not found 15:31:13 `` /bin/sh -c , 15:31:15 ​/bin/sh: ,: not found 15:31:35 `` strings /bin/sh 15:31:36 ​/lib64/ld-linux-x86-64.so.2 \ __gmon_start__ \ libc.so.6 \ strcpy \ readdir \ strsignal \ isalpha \ pipe \ __strdup \ closedir \ isblank \ fork \ sigfillset \ realloc \ abort \ _exit \ strpbrk \ getpid \ kill \ strspn \ imaxdiv \ strtod \ isspace \ strtok \ strtol \ isatty \ strchrnul \ isprint \ getpwnam \ getppid \ strlen \ isxdigit \ isalnum 15:31:44 `` echo , > bin/comma; chmod +x bin/comma 15:31:48 No output. 15:31:49 `comma 15:31:50 ​/hackenv/bin/comma: line 1: ,: command not found 15:36:28 `` strings /bin/sh | grep ND 15:36:29 sh: turning off NDELAY mode \ OPTIND \ OPTIND=1 15:36:58 `` ls -la /bin/sh 15:37:00 lrwxrwxrwx 1 0 0 4 Oct 14 2011 /bin/sh -> dash 15:37:44 mrhmouse: I believe your version would have worked with bash. 15:39:05 int-e: why were you stringsing the shell? 15:42:00 ais523_: same reason mauke did, trying to find some identifying information. 15:42:14 right 15:42:18 that NDELAY message is something that dash has but bash doesn't. 15:42:39 `` strings /bin/sh | grep dash 15:42:41 No output. 15:42:41 not understanding --version is a giveaway that it isn't GNU 15:42:49 The ls -la was an afterthought that could have saved me some work. 15:42:58 `` md5sum /bin/sh 15:43:00 cc20a148ccd602b4bde6431a7a7fb028 /bin/sh 15:43:31 http://mirror.data-hotel.biz/mirror02/pve-mtest/chroot/var/lib/dpkg/info/dash.md5sums 15:43:36 fun. 15:43:37 yeah, that's what I was doing too 15:43:55 easiest way to identify the program is to hash it, then reverse the hash 15:44:08 `` sha1sum /bin/sh 15:44:10 3e4f053d7520819f5e45a7792c972b05e4ff234e /bin/sh 15:44:32 `cat /etc/issue 15:44:34 cat: /etc/issue: No such file or directory 15:44:55 this doesn't seem to be a widely used version of dash 15:45:09 `` dpkg-query -S /bin/sh 15:45:11 dpkg-query: failed to open package info file `/var/lib/dpkg/status' for reading: No such file or directory 15:45:16 hmm 15:45:17 some debian squeeze? 15:45:29 `` cat /etc/lsb-release 15:45:31 cat: /etc/lsb-release: No such file or directory 15:45:38 `` uname -a 15:45:40 Linux umlbox 3.7.0-umlbox #1 Wed Feb 13 23:30:40 UTC 2013 x86_64 GNU/Linux 15:45:42 not having even read-only access to the dpkg status means we can't just ask dpkg what version's being used 15:45:57 is this authentic uml tho 15:46:04 `` md5sum /bin/bash 15:46:06 9a99d4a76f3f773f7ab5e9e3e482c213 /bin/bash 15:46:12 Gregor: is it authentic uml ↑ 15:46:41 why did someone commit the md5 sum of their bash file to Github? 15:46:52 err, I mean, the file /bin/bash 15:47:07 sort of repost: http://blogs.perl.org/users/mauke/2014/01/php-puzzle.html 15:47:15 -!- tertu has quit (Ping timeout: 252 seconds). 15:47:17 I hope php is esoteric enough for this channel 15:49:38 mauke: I'm guessing for the first one, you can't use an integer 0, because it matches 'one' 15:49:50 in fact, I'm guessing we need some value that isn't a string or an integer 15:49:53 http://mirror.data-hotel.biz/mirror02/pve-mtest/chroot/bin/bash has the right md5sum and is debian squeeze. 15:49:54 what about boolean false? 15:50:18 it's interesting that people put whole chroots on the web. 15:50:23 int-e: haha, you just accessed the inside of the chroot? 15:50:36 also, normish's entire filesystem was on the web, read-only 15:50:47 I'm not sure if that's recommended practice or not 15:51:16 mauke: I can't run PHP here so you're going to have to yes or no my guesses for me 15:51:17 I would advise against it. 15:51:53 -!- AnotherTest has joined. 15:52:01 it certainly helps attackers to figure out the exact versions of programs being run :) 15:52:21 of course that's not a problem with secure software. (maybe it's not being run...) 15:52:22 they can download them locally and then --version them 15:52:34 (another bad idea :-) ) 15:52:54 ais523_: http://writecodeonline.com/php/ 15:53:49 `` ldd /bin/dash 15:53:51 ​linux-vdso.so.1 => (0x0000007fbffff000) \ libc.so.6 => /lib/libc.so.6 (0x0000000040002000) \ /lib64/ld-linux-x86-64.so.2 (0x000000552aaaa000) 15:53:54 -!- tertu has joined. 15:55:10 oh, codepad has it, I'll use that 15:55:19 yeah, it seems that "false" works for puzzle 1 15:55:28 I don't know enough PHP to get the other two, though 15:55:36 hey guys guess what 15:55:40 we don't suck 15:56:01 we don't? 15:56:28 `/usr/lib/libc.so 15:56:29 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: /usr/lib/libc.so: Permission denied \ /home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: /usr/lib/libc.so: cannot execute: Permission denied 15:56:57 nope. i mean, perhaps you start to feel a bit inferior when you try to understand Snowflake, but look at what we have wrought! 15:56:59 libc.so is normally nonexecutable 15:57:07 Invention is mankind's greatness 15:57:13 `/lib/x86_64-linux-gnu/libc.so 15:57:14 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: /lib/x86_64-linux-gnu/libc.so: No such file or directory \ /home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: /lib/x86_64-linux-gnu/libc.so: cannot execute: No such file or directory 15:57:16 `ls /tmp 15:57:18 No output. 15:57:23 hrm. 15:57:24 `ls -d /tmp 15:57:25 ls: invalid option -- ' ' \ Try `ls --help' for more information. 15:57:28 Tanebventions are also mankind's... uhm... interestingness! 15:57:30 `` ls -d /tmp 15:57:31 ​/tmp 15:57:32 boily: you don't suck! 15:57:41 `/lib/libc.so 15:57:42 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: /lib/libc.so: No such file or directory \ /home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: /lib/libc.so: cannot execute: No such file or directory 15:57:51 `ls -la /lib/libc.so 15:57:52 quintopia: of course I don't. if I did, I'd risk getting my lips stuck on a metal pole. 15:57:53 ls: invalid option -- ' ' \ Try `ls --help' for more information. 15:58:04 ``ls -la /lib/libc.so 15:58:04 `` cp /lib/x86_64-linux-gnu/libc.so /tmp && chmod a+x /tmp/libc.so && /tmp/libc.so 15:58:05 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: `ls: not found 15:58:06 cp: cannot stat `/lib/x86_64-linux-gnu/libc.so': No such file or directory 15:58:20 boily: yes. that too. you don't suck long hard shafts. 15:58:23 `` cp /usr/lib/libc.so /tmp && chmod a+x /tmp/libc.so && /tmp/libc.so 15:58:24 ​/tmp/libc.so: line 1: /bin: is a directory \ /tmp/libc.so: line 2: Use: command not found \ /tmp/libc.so: line 3: the: command not found \ /tmp/libc.so: line 4: syntax error near unexpected token `elf64-x86-64' \ /tmp/libc.so: line 4: `OUTPUT_FORMAT(elf64-x86-64)' 15:58:40 I have the feeling that /usr/lib/libc.so is a text file 15:58:47 linker script 15:58:47 `cat /usr/lib/libc.so 15:58:48 ​/* GNU ld script \ Use the shared library, but some functions are only in \ the static library, so try that secondarily. */ \ OUTPUT_FORMAT(elf64-x86-64) \ GROUP ( /lib/libc.so.6 /usr/lib/libc_nonshared.a AS_NEEDED ( /lib/ld-linux-x86-64.so.2 ) ) 15:58:52 mauke: yep 15:59:07 `file /lib/libc.so.6 15:59:08 ​/lib/libc.so.6: symbolic link to `libc-2.11.3.so' 15:59:13 oh right, that's the libc.so 15:59:17 I was trying to run ld.so 15:59:21 `file /lib/libc-2.11.3.so 15:59:23 ​/lib/libc-2.11.3.so: ELF 64-bit LSB shared object, x86-64, version 1 (SYSV), dynamically linked (uses shared libs), for GNU/Linux 2.6.18, stripped 15:59:40 `/lib/libc.so.6 15:59:41 GNU C Library (Debian EGLIBC 2.11.3-4) stable release version 2.11.3, by Roland McGrath et al. \ Copyright (C) 2009 Free Software Foundation, Inc. \ This is free software; see the source for copying conditions. \ There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A \ PARTICULAR PURPOSE. \ Compiled by GNU CC version 4.4.5. \ Compiled 15:59:48 `` cp /lib/ld-linux-x86-64.so.2 /tmp && chmod a+x /tmp/ld*.so.2 && /tmp/ld-linux-x86-64.so.2 15:59:50 Usage: ld.so [OPTION]... EXECUTABLE-FILE [ARGS-FOR-PROGRAM...] \ You have invoked `ld.so', the helper program for shared library executables. \ This program usually lives in the file `/lib/ld.so', and special directives \ in executable files using ELF shared libraries tell the system's program \ loader to load the helper program from this file. Th 16:00:00 wait, libc.so is executable? 16:00:04 yes 16:00:05 `` cp /lib/ld-linux-x86-64.so.2 /tmp && chmod a+x /tmp/ld*.so.2 && /tmp/ld-linux-x86-64.so.2 --version 16:00:07 ​--version: error while loading shared libraries: --version: cannot open shared object file: No such file or directory 16:00:11 the gnu libc one, yes. 16:00:17 why? 16:00:23 it looks cool 16:00:29 becaus they could? 16:00:36 `ls /boot 16:00:37 ls: cannot access /boot: No such file or directory 16:00:39 -!- tertu has quit (Read error: Connection reset by peer). 16:00:51 also, does it dynamically link against itself to do the printing, or does it just look inside itself and use a static version of printf, etc.? 16:01:06 quintopia: Snowflake? 16:01:07 `ldd /lib/ld-linux-x86-64.so.2 16:01:09 ​statically linked 16:01:17 mrhmouse: http://esolangs.org/wiki/Snowflake 16:01:28 I need to write an interp someday 16:01:48 out of all my esolangs that are less vaporware than Feather, it's the one that can most be said to be art 16:02:32 There's no implementation? 16:03:16 -!- conehead has joined. 16:03:44 mrhmouse: no, beacuse the spec is really large 16:03:51 and most people give up before they finish reading it 16:04:10 just defining the language appropriately was an esoprogramming problem in its own right 16:04:16 however, this does suck: http://esolangs.org/wiki/$tonePits 16:04:18 because I had to make programming in it possible, but not too easy 16:05:37 can we mark it for speedy deletion? if we're lucky, the author will get discouraged and give up esoprogramming altogether! is that too mean? 16:06:13 it's not as bad as many 16:06:28 it has a lots of wells... 16:06:36 like, a) it's not a BF derivative, b) it shows some semblance of creativity, c) it's nowhere near as horrible as ESME 16:06:57 although it looks like it should be in Ideas, not Languages (it's not currently in either) 16:07:19 yeah it is definitely not a language 16:07:19 * boily peruses ESME. “ow.” 16:07:49 the example at the bottom appears to have some random order of choosing pits to sow from. the semantics are not at all defined 16:08:04 I do find it amusing, though, that the author is having difficulty trying to find a state in which to start a finite state machine so that it eventually returns to the original state 16:10:32 can we delete Esme then? it makes us look bad and feel bad 16:10:39 mauke: aha, I think the solution to the second problem involves finding some string whose md5 starts "2000", but you can hardly expect me to bruteforce that 16:10:58 quintopia: we put it in Category:Shameful, which officially does not exist (and is maintained as a redlink) 16:11:11 ais523_: i can see that 16:11:14 ais523_: yes, we can! 16:11:22 mauke: in my head? 16:11:26 no, in php 16:11:32 ais523_: it should also probably in Joke Programming Languages 16:11:50 quintopia: then someone might stumble across the link by accident 16:11:55 and that would be kind-of dangerous 16:12:18 ais523_: mightn't they stumble upon it browsing Stubs? 16:12:29 yeah but nobody does that 16:12:50 true 16:14:11 btw, the Talk page for Esme is pretty good too 16:15:27 yeah it looks like the author was a troll 16:16:01 that hadn't actually occurred to me yet 16:23:19 :t build 16:23:20 Not in scope: `build' 16:23:21 Perhaps you meant `buildG' (imported from Data.Graph) 16:28:23 -!- Sellyme has quit (Excess Flood). 16:30:34 -!- Sellyme has joined. 16:42:49 -!- ais523_ has quit (Quit: Page closed). 16:47:27 -!- subleq_ has quit (Quit: leaving). 16:57:38 `rm bin/comma 16:57:41 No output. 17:04:06 -!- yorick has quit (Remote host closed the connection). 17:06:19 -!- Slereah has quit (Ping timeout: 272 seconds). 17:10:54 -!- _46bit has changed nick to exhibitionist. 17:11:24 -!- exhibitionist has changed nick to _46bit. 17:20:18 -!- peapodamus has quit. 17:56:53 -!- ais523_ has joined. 18:09:18 -!- FreeFull has joined. 18:16:41 -!- mrhmouse has quit (Quit: Leaving.). 18:32:29 -!- Slereahphone has joined. 18:34:14 `cat /etc/issue 18:34:15 cat: /etc/issue: No such file or directory 18:34:37 A bot that doesn't have any issues? How rare. 18:34:41 fungot: Watch and learn. 18:34:41 fizzie: anything worthwhile that isn't super complicated in c++ is a lot like diablo, if you ask me 18:35:55 `? issue 18:35:56 issue? ¯\(°​_o)/¯ 18:36:03 `? issues 18:36:04 issues? ¯\(°​_o)/¯ 18:36:08 See? No issues. 18:36:43 `ln -s .doorstop wisdom/issues 18:36:44 ln: invalid option -- ' ' \ Try `ln --help' for more information. 18:36:52 `` ln -s .doorstop wisdom/issues 18:36:55 No output. 18:37:08 `complain THIS BOT HAS NO ISSUES! 18:37:09 Complaint filed. Thank you. 18:37:15 `? issues 18:37:15 -!- zzo38 has joined. 18:37:16 You do not have the clearance necessary to view this entry. 18:37:34 hezzo38. 18:37:49 Hello 18:38:00 `hello zzo38 18:38:02 Hello 18:38:35 `which run 18:38:37 No output. 18:38:48 * int-e is still confused by this, is `run a special case? 18:39:47 Yes, I think so 18:40:30 -!- nooodl has quit (Quit: Ik ga weg). 18:44:31 `which `run 18:44:32 No output. 18:46:27 ah. found it. 18:46:29 `help 18:46:29 Runs arbitrary code in GNU/Linux. Type "`", or "`run " for full shell commands. "`fetch " downloads files. Files saved to $PWD are persistent, and $PWD/bin is in $PATH. $PWD is a mercurial repository, "`revert " can be used to revert to a revision. See http://codu.org/projects/hackbot/fshg/ 18:47:45 https://bitbucket.org/GregorR/hackbot/src/tip/multibot_cmds/PRIVMSG/tr_60.cmd ... line 12, hmm :) 18:49:02 If you use "`" then it just uses one word as the filename and the rest as an argument without any further parsing; using "`run" will instead parse it using the shell parser. 18:49:40 right, there are special cases for `help, `fetch, `run, `revert. 18:50:50 `revert has to be hardcoded because otherwise someone could delete bin/revert and it'd be hard to stop 18:50:51 abort: unknown revision 'has to be hardcoded because otherwise someone could delete bin/revert and it'd be hard to stop'! 18:51:15 yes. (you should be more careful there!) 18:51:59 in fact I expect that the repo is outside of the sandbox. 18:52:09 it couldn't be inside, obviously 18:52:17 because then the repo would somehow have to be in the repo 18:52:27 so that you could convert changes to it made directly 18:52:43 it could be ignored ;) 18:53:03 after all, having a .hg subdirectory that is ignored by hg is sort of standard. 18:53:12 `` ls -la / 18:53:14 total 40 \ drwxr-xr-x 16 0 0 0 Jan 17 18:53 . \ drwxr-xr-x 16 0 0 0 Jan 17 18:53 .. \ drwxr-xr-x 2 0 0 4096 Oct 20 00:02 bin \ drwxr-xr-x 4 0 0 4096 Nov 10 2011 dev \ drwxr-xr-x 4 0 0 0 Jan 17 18:53 etc \ drwxr-xr-x 14 5000 5000 4096 Jan 17 18:36 hackenv \ drwxr-xr-x 3 0 0 0 Jan 17 18:53 home \ d 18:53:26 `` ls -a / 18:53:28 ​. \ .. \ bin \ dev \ etc \ hackenv \ home \ lib \ lib64 \ opt \ proc \ sbin \ sys \ tmp \ usr \ var 18:53:42 -!- Slereahphone has quit (Quit: Colloquy for iPhone - http://colloquy.mobi). 18:53:45 `` ls -a /hackenv 18:53:47 ​- \ . \ .. \ 98076 \ bdsmreclist \ bi \ bin \ canary \ cat \ complaints \ :-D \ dog \ etc \ factor \ fb \ fb.c \ file \ head \ hello \ hello.c \ .hg \ .hg_archival.txt \ ibin \ index.html \ interps \ lib \ mind \ paste \ perpetual motion machine \ ploki-0.6.5.1.tar.bz2 \ pref \ prefs \ quines \ quotes \ share \ src \ test \ this \ UNPA \ wisdom 18:53:47 etc. 18:54:21 -!- Slereahphone has joined. 18:56:34 `cat dog 18:56:35 ​ヽ༼ຈل͜ຈ༽ノ 18:59:02 `shuf 18:59:31 `` shuf -n 1 quotes 18:59:33 Because you're a Mac user. I am! and proud of it to My mouse has *no* buttons. 18:59:33 No output. 19:00:01 `quote 19:00:02 276) elliott, it was an artful robbery! wait, murder 19:01:07 So it seems the the microsd in my phone gave up. I have files like LOST?.DI€ on it... 19:01:19 Well, time to get a new one I guess... 19:01:25 Good thing I have backups 19:02:31 There are essentially 3 alternatives as well for me... Sandisk 64 GB of varying speeds. 19:03:08 So either another one of the one I had, which is now about half the price compared to 1.8 years ago. Or some faster alternatives for about the same price. 19:23:08 -!- FreeFull has quit (Ping timeout: 252 seconds). 19:24:13 -!- FreeFull has joined. 19:37:02 -!- nooga has joined. 19:39:57 -!- nooodl has joined. 19:44:14 -!- henrique1 has joined. 19:46:07 -!- zzo38 has quit (Remote host closed the connection). 19:46:27 `? welcome.es 19:46:29 ​¡Bienvenido al centro internacional para el diseño y despliegue de lenguajes de programación esotéricos! Por desgracia, la mayoría de nosotros no hablamos español. Para obtener más información, echa un vistazo a nuestro wiki: http://esolangs.org/. (Para el otro tipo de esoterismo, prueba #esoteric en irc.dal.net.) 19:46:50 `relcome henrique1 19:46:52 ​henrique1: 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.) 19:47:05 hola 19:48:31 -!- henrique1 has left. 19:48:54 gah, this client doesn't filter colors 19:48:55 adiós 19:49:23 `run ls -l perp* 19:49:25 lrwxrwxrwx 1 5000 0 25 Dec 26 18:32 perpetual motion machine -> ./wisdom/perpetuum mobile 19:51:33 ais523_: colours are good!!!!! 20:03:54 Black text 20:03:56 Unreadable 20:05:05 gah, this client doesn't filter colors <-- did you find it annoying? 20:05:15 oh hm. shows as dark gray here. I said “colours are good!!!!!”. 20:05:38 FreeFull, readable for me. It was black on white background 20:06:10 This is why colours in IRC suck. Because depending on the readers background some colours will always be unreadable or near unreadable 20:06:39 You could always set bg colour too of course.... But blergh 20:06:46 Okay that was a terrible combination 20:07:04 * boily artfully mapoles Vorpal 20:07:48 boily, wtf is "mapole"? 20:07:52 `? mapole 20:07:54 A mapole is a thwackamacallit built from maple according to Canadian standards. 20:08:00 Ah 20:08:16 it's a pole. made of maple. it is aerodynamic! 20:09:08 -!- mrhmouse has joined. 20:09:44 ~eval ["\ETX" ++ show x ++ "," ++ show (15 - x) ++ "poulet" | x <- [0..15]] 20:09:44 ["\ETX0,15poulet","\ETX1,14poulet","\ETX2,13poulet","\ETX3,12poulet","\ETX4,11poulet","\ETX5,10poulet","\ETX6,9poulet","\ETX7,8poulet","\ETX8,7poulet","\ETX9,6poulet","\ETX10,5poulet","\ETX11,4poulet","\ETX12,3poulet","\ETX13,2poulet","\ETX14,1poulet","\ETX15,0poulet"] 20:09:50 ... 20:10:12 ~eval ["" ++ show x ++ "," ++ show (15 - x) ++ "poulet" | x <- [0..15]] 20:10:13 Error (1): :1:3: 20:10:13 lexical error in string/character literal at character '\ETX' 20:23:37 `? maypole 20:23:39 maypole? ¯\(°​_o)/¯ 20:33:41 I'm with ais523, colors are awful. 20:37:50 -!- nooga has quit (Ping timeout: 265 seconds). 20:40:06 -!- ais523_ has quit (Quit: going home). 20:48:55 -!- ^v has joined. 20:51:23 http://whatthefuckismywearablestrategy.com/ 20:51:59 "PAIR OF SHOES THAT POSTS TO MEDIUM WHEN YOU DRINK TOO MUCH COFFEE" 20:52:35 * boily shrinks away from the site... slowly... discreetly... 20:55:14 sounds like boily needs an E-CIGARETTE THAT SELF DESTRUCTS WHEN YOU HAVE NIGHTMARES 20:55:41 * boily runs aimlessly “AAAAAAAAAAAAAAAAAAAAAAAAAAAH!” 20:56:20 sounds like we've moved on from the internet of things to the cabal of things 20:56:27 tinc. 21:03:19 I'm with ais523, colors are awful. <-- Yep. Bold is all you need. 21:05:48 Vorpal: http://int-e.eu/~bf3/tmp/irssee.png ... if you look closely you'll find colors :) 21:06:47 int-e: xterm? 21:06:58 xterm. 21:07:11 -!- lambdabot has quit (Remote host closed the connection). 21:07:20 hey, http://whatthefuckismywearablestrategy.com/ is cool. 21:07:24 lambdabot? 21:07:25 nooo! lambdie! come back! 21:08:21 it failed its first reconnect attempt. hmm. 21:08:39 (so now it'll wait 5 minutes) 21:09:39 oh. actually 2 minutes. that does seem more sensible. 21:10:38 -!- atrapado has quit (Quit: Leaving). 21:11:28 ok, it's coming :) 21:11:45 just has to join a gazillion other channels first. 21:12:16 don't come and tell me there is only a single instance of lambdabot running on all of Freenode. 21:12:35 one nick, one bot. 21:12:56 holy fungot. 21:12:56 boily: but if you're running scheme48 in slime48 or the usual command processor and the module system 21:13:15 -!- lambdabot has joined. 21:13:34 $ grep ^join online.rc | wc -l 21:13:34 72 21:13:44 Yes, crazy. 21:13:54 iiuc, you have access to that instance? 21:14:30 I'm running it currently 21:15:36 (AFAIK lambdabot even has a special user mode set because ordinarily, users are not allowed to join that many channels at once) 21:15:37 Most Divine Fungot of Doom Sitting at the Top of Mount Sumeru. 21:16:02 I am impressed. 21:17:18 Fungot? 21:17:36 is it really case sensitive? that's outrageous 21:17:57 fungot: I called you an it, react 21:17:57 olsner: latest fnord::"? comments are ignored by the environment. is there a better solution 21:19:17 fungot: the better solution is to pester your Creator and ask him to make you case insensitive. 21:19:18 boily: i can program in, you'll build utilities based on that. 21:19:38 fungot: I already have to accept that you're sentient. your utility will come afterwards. 21:19:38 boily: i did copy some stuff from ccbi on this. i do for sure. 21:20:31 > text.unwords.sequence.map(ap((:).toUpper)(:[]))$"fungot" 21:20:32 int-e: logcheck and fnord are only 100m... i sense a nice afternoon. i'm too lazy to translate this). i thought you 21:20:33 FUNGOT FUNGOt FUNGoT FUNGot FUNgOT FUNgOt FUNgoT FUNgot FUnGOT FUnGOt FUnGoT... 21:21:01 oh. sequence.map = mapM, of course. 21:21:06 -!- ^v has quit (Remote host closed the connection). 21:27:27 -!- boily has quit (Quit: UNDEREMOVED CHICKEN). 21:27:29 -!- metasepia has quit (Remote host closed the connection). 21:38:02 -!- nooga has joined. 21:38:13 sequence .: map, rather 21:38:49 hey, http://whatthefuckismywearablestrategy.com/ isn't all bad. It has a fitting