00:03:20 -!- Corun has quit (Remote closed the connection). 00:03:33 -!- Corun has joined. 00:24:34 -!- tusho has quit. 01:12:55 -!- olsner has quit ("Leaving"). 01:29:52 -!- Corun_ has joined. 01:30:20 -!- Corun has quit (Nick collision from services.). 01:30:28 -!- Corun_ has changed nick to Corun. 01:40:45 -!- Judofyr has quit (Read error: 104 (Connection reset by peer)). 01:41:20 -!- Judofyr has joined. 01:47:59 -!- boily has joined. 02:16:24 -!- boily has quit ("leaving"). 02:43:11 -!- CO2Games has joined. 02:43:21 -!- CO2Games has left (?). 03:39:14 -!- Corun has quit (Read error: 110 (Connection timed out)). 03:44:35 -!- megatron has joined. 03:48:14 -!- optbot has set topic: the entire backlog of #esoteric: http://tunes.org/~nef/logs/esoteric | I'd hate thinking code all the time.... 03:53:40 -!- moozilla has quit (Read error: 110 (Connection timed out)). 03:53:46 -!- calamari has quit ("Leaving"). 07:55:08 -!- Judofyr has quit (Remote closed the connection). 07:55:49 -!- Judofyr has joined. 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 08:07:58 -!- oc2k1__ has quit (Read error: 110 (Connection timed out)). 08:08:05 -!- oc2k1__ has joined. 09:16:28 -!- oerjan has joined. 09:48:14 -!- optbot has set topic: the entire backlog of #esoteric: http://tunes.org/~nef/logs/esoteric | I'll pastebin it so someone can explain the math behind it.. 10:15:36 -!- Judofyr has quit. 11:01:46 -!- jix has joined. 11:41:26 -!- oerjan has quit ("leaving"). 11:57:08 -!- Slereah has joined. 12:05:41 -!- psygnisfive has quit ("http://www.mibbit.com ajax IRC Client"). 12:15:51 -!- tusho has joined. 12:21:56 -!- oklogod has joined. 12:22:03 o 12:22:39 ko 12:22:44 i need ais523 12:22:46 give him to me 12:22:56 yes 12:25:34 MATLAB <3. The function "logspace(x1,x2,n)" returns n logarithmically spaced points in the range [10^x1, 10^x2]... except as a special case, if x2 is pi, the range is [10^x1, pi] and not [10^x1, 10^pi]. 12:26:10 fizzie: f 12:26:16 It is even implemented by special-casing: if d2 == pi || d2 == single(pi); d2 = log10(d2); end 12:27:10 It's full of this kind of stuff that's obviously done so that old MATLAB code doesn't break. 12:27:36 * oklogod lolled 12:27:55 god i hate backwards compatibility 12:28:12 Another example: in normal expressions, && is a short-circuiting logical and, while & always evaluates both sides... except that in a "if foo & bar; ..." statement, and only there, the & operator is also short-circuiting. 12:28:22 ... 12:28:23 >_______< 12:29:00 that's just awful 12:29:02 -!- oklogod has quit ("PJIRC @ http://webirk.dy.fi"). 12:29:05 -!- oklogod has joined. 12:29:14 webircs <3 12:31:19 >> if fprintf('foo!\n') | fprintf('bar!\n'); fprintf('ha ha, confused you!\n'); end 12:31:22 foo! 12:31:25 ha ha, confused you! 12:31:27 >> if ~~(fprintf('foo!\n') | fprintf('bar!\n')); fprintf('ha ha, confused you!\n'); end 12:31:30 foo! 12:31:33 bar! 12:31:36 ha ha, confused you! 12:31:48 The magic falls of if I add a not-not in front. (MATLAB uses ~ as unary logical not.) 12:32:02 xD 12:32:34 Also none of the help pages for &, | or "if" document the insanity. At least "help logspace" mentions the pi thing. 12:33:21 Although I did assume a typo when I saw it there. "LOGSPACE(X1, X2) generates a row vector of 50 logarithmically equally spaced points between decades 10^X1 and 10^X2. If X2 is pi, then the points are between 10^X1 and pi." 12:34:17 yeah that sounds like an examples 12:34:19 *example 12:34:35 because there's nothing else it could sensibly be 12:34:56 btw. that's a pretty weird function even without the pi thing 12:34:58 50?!? 12:35:23 The three-argument form takes the number of points as the third argument. 12:35:35 i see 12:35:40 I guess it's 50 because it's a "sensible" amount of points if you're using it like plot(logspace(x1, x2), ...). 12:35:56 most likely, that doesn't make it any less ugly. 12:39:43 does matlab suck altogether? 12:39:58 Not completely, but it's definitely not pretty. 12:40:13 how do you solve a set of equations? 12:40:28 say X = 2Y, Y = 35Y^2 - X 12:40:33 umm 12:40:44 weird example 12:40:52 i'm not sure what its use was 12:42:27 Like this: (not your example, though) 12:42:29 >> A = [1 2 3;.3 .1 .2;.7 .8 .9]; y = [2;4;6]; 12:42:29 >> x = A\y 12:42:29 x = 12:42:34 15.8889 12:42:34 -4.7778 12:42:34 -1.4444 12:42:49 That solves Ax = y. 12:44:28 i don't get it. 12:45:18 feel like explaining a bit? 12:46:56 Well, to use another notation, the previous one solved the set of equations {1*x1 + 0.3*x2 + 0.7*x3 = 2; 2*x1 + 0.1*x2 + 0.8*x3 = 4; 3*x1 + 0.2*x2 + 0.9*x3 = 6}. 12:47:10 Giving x1 = 15.8889, x2 = -4.7778, x3 = -1.4444. 12:48:13 ah. 12:48:29 Linear algebra (read: matrices) is what people usually use MATLAB for; it doesn't really do symbolic manipulation at all. Or maybe a little bit, but not much. It's no Mathematica (or Maple). 12:48:40 i thought you were literally solving Ax = y <=> x = y/A, it looked incorrect. 12:48:53 i see 12:49:37 "A\y" is pretty close to "inv(A)*y" except that it's computed differently. 12:49:46 -!- Corun has joined. 12:50:05 And it does the "sensible" thing (least-squares solution) if you give it a non-square matrix A, which would correspond to over- or undetermined system of equations. 12:52:10 There is some symbolic equation-solving, though. 12:52:18 >> t = solve('x=2*y', 'y=35*y^2+x'); 12:52:18 >> [t.x t.y] 12:52:18 ans = 12:52:18 [ 0, 0] 12:52:18 [ -2/35, -1/35] 12:52:39 If I'm reading it right, it seems to say that {x=0, y=0} and {x=-2/35, y=-1/35} are solutions for that. 12:53:37 You'd have to be pretty desperate to use MATLAB for symbolic algebraisms, though. 12:53:38 solving from strings representing the equations isn't terribly elegant 12:53:59 Yes, it's sort-of bolted in and not part of the core functionality. 12:55:49 MATLAB: 12:55:55 SORT-OF BOLTED IN AND NOT PART OF THE CORE FUNCTIONALITY. 12:57:25 A mess it is, yes. 13:10:09 -!- megatron has quit (Read error: 110 (Connection timed out)). 13:10:37 -!- Corun has quit (Read error: 104 (Connection reset by peer)). 13:12:02 -!- Corun has joined. 13:21:48 interesting way to express large numbers: "For example, it can be shown that there are 33, 665, 406 possible expressions over the numbers 1, 3, 7, 10, 25, 50, but only 4, 672, 540 of these expressions evaluate successfully, which is just under 14%." 13:27:32 kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkj%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%!!!!!!!!!!~~~~~~~~~~~~~~~~~~ 13:27:49 `̀̀̀̀̀̀`~~~~~~~~~~~~~~~~~~~```̀̀̀̀̀̀̀̀̀̀``̀̀̀̀̀̀̀̀̀̀̀ 13:31:21 -!- Corun has quit (Read error: 104 (Connection reset by peer)). 13:36:32 -!- oklogod has quit ("PJIRC @ http://webirk.dy.fi"). 13:45:14 -!- Corun has joined. 13:47:16 ````````` 13:47:16 ` 13:47:22 ````` 13:47:31 ̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀ 13:47:36 cool 13:47:38 it's bold 13:47:44 ̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀̀bold̀̀̀̀̀̀̀̀̀̀ 13:50:02 Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì€Ì 13:57:37 ẇ 13:57:53 ẇ ẇ ẇ ẇ with a dot on top 13:57:58 ẇ ẇ ẇ ẇ, ẇ ẇ ẇ ẇ ẇ 13:57:59 ẇ ẇ ẇ ẇ with a dot on top 13:58:00 ẇ ẇ ẇ ẇ, ẇ ẇ ẇ ẇ ẇ 14:21:28 -!- ais523 has joined. 14:21:28 hi ais523 14:22:10 hi tusho 14:22:18 ais523: wooble wants to steal your madscientistness 14:22:21 i renominated you 14:22:23 ##nomic -> 14:23:27 -!- oklocop has joined. 14:29:00 ais523, hi 14:29:06 hi AnMaster 14:29:40 I'm overengineering another assignment, this time C++ (introductory) 14:29:51 yay, overengineering 14:37:17 ais523: just as a warning, i want to show you some ideas about muture in the near future, and i may even be hoping for you to help me implement it. 14:37:31 hmm... if I have time, I may help 14:37:36 muture is the declarative language i was creating, if you recall the levenshtein example 14:37:42 it would be nice to have a concrete target to aim for that isn't too difficult 14:37:50 unlike something like Feather which keeps running away when I think about it 14:38:05 :) 14:38:18 muture is very, very declarative. 14:38:18 but 14:38:44 as it turns out, it actually encompasses the concept of heuristic function for the searches quite neatly 14:38:48 which i didn't even realize before 14:39:03 muture's basic tool is the "make as great as possible" operator >> 14:39:22 hmm... will it have a "make equal" operator? 14:39:28 yes. 14:39:28 you can express that in terms of >> 14:39:33 but might not want to for optimisation reasons 14:39:39 well 14:39:43 optimization 14:39:44 pfffffft 14:39:50 the "make equal" is optimized. 14:40:05 anyway, you cannot create more of these operators, they are kinda high-level 14:40:17 also the language is not meant to be that flexible in terms of types and such 14:40:22 you have lists, and numbers 14:40:30 and functions, of course, but no lambdas 14:40:55 there are very neat optimizations you can do, of which i hope to be able to show a few examples soon 14:41:19 the levenshtein example, if i'm not mistaken, should actually directly "compile" to the imperative version everyone knows 14:41:29 impressive 14:42:05 by the use of a technique i like to call "memoization structure optimization" (invented on the fly) 14:42:18 well, I know what memoization is 14:42:22 but how does it apply to structures? 14:42:36 the idea is, you don't have to have a generic memoization 14:42:52 it would use a two-dimensional array for levenshtein 14:43:14 also usually you couldn't actually memoize something like this 14:43:45 because the minimum or maximum of a recursed case may not always lead to the minimum / maximum of the global case 14:44:40 hm RPN... what is non-reverse polish notation? 14:44:48 AnMaster: like RPN but backwards 14:44:52 you put the operator at the start 14:45:01 ah 14:45:06 yeah, except both have operators in the same order 14:45:17 (2 + 3) * 4 in infix is 2 3 + 4 * in RPN or * + 2 3 4 in Polish 14:45:19 oklocop: *operands 14:45:28 yes, that was a mental typo 14:45:50 buttt, i'm in quite a hurry, actually. 14:45:55 you can think of RPN as a stack, but I can't create any mental reference frame for Polish... 14:46:11 gotta go buy some shoes, although i'm not actually going to buy shoes but food -> 14:46:22 AnMaster: can you for infix? 14:47:01 oklocop, you mean "normal" notation? Then well it is possible to think about it, though in certain ways RPN make more sense 14:47:02 also polish notation is what you use when using functions in, for instance, erlang. 14:47:12 plus(minus(1,2),multiply(45,6)) 14:47:50 except when you know the arities of functions, you don't need the parens 14:47:50 um 14:47:56 see ya -> 14:48:01 *blink* 14:48:05 -!- Corun_ has joined. 14:48:25 tusho will explain 14:48:27 oklocop, You do use parens in Erlang, and I never seen mentioned that it was optional 14:48:38 * AnMaster goes to test in an erlang shell 14:48:44 oklocop: i am not going to explain things to AnMaster 14:48:45 ... 14:48:48 i value my sanity, yo 14:49:09 i meant, you don't need, coinceptually 14:49:17 *typofix 14:49:28 I think oklocop means that functions are normally written in prefix notation, in all languages 14:49:32 yes 14:49:32 but 14:49:35 in prefix notation 14:49:39 if you know the arities of all functions 14:49:41 you can omit parens 14:49:42 and if the arity is known the parens are redundant because you can deduce them from the arities 14:49:46 + * 5 2 / 1 0 14:49:55 closest to that is lisp 14:49:56 tusho, yes except most languages doesn't allow omitting them 14:49:59 (+ (* 5 2) (/ 1 0)) 14:50:06 AnMaster: dfhsu akaesthilru2314892u18902412349u89234 14:50:08 I think perl does 14:50:10 >CONCEPTUALLY< 14:50:14 tusho, yes agreed 14:50:16 perl doesn't. 14:50:19 oklocop said conceptually, then i did. 14:50:20 hm 14:50:26 third time's the charm? 14:50:39 AnMaster: it doesn't, except on top-level. 14:50:45 but, i need to go :P 14:50:46 -> 14:50:48 oklocop, cya 14:51:08 but yes then the notation makes sense 14:52:07 tusho: actually I think Perl functions work without parens polish-style if you tell it the arities via prototypes 14:52:15 Perl prototypes change the syntax of the language like that 14:52:22 ais523: oklocop said perl 14:52:23 not me 14:52:27 ah, ok 14:52:33 actually, AnMaster said it first 14:52:33 but can you do this with prototypes and perl: 14:52:40 plus times 5, 2 divide 1, 0 14:52:47 meaning 14:52:52 plus(times(5,2), divide(1,0)) 14:52:58 if not... then not really parenless polish notation 14:53:04 it would be plus times 5, 2, divide 1, 0 14:53:07 and I think it does work 14:53:09 ah 14:53:10 neat 14:53:11 apart from the division by 0 14:53:17 well duh 14:53:18 :-P 14:53:36 btw http://trixter.wordpress.com/2008/09/28/the-diskette-that-blew-trixters-mind/ 14:55:47 tusho: nope, it doesn't work 14:55:50 just checked 14:55:52 pity, really 14:55:53 awwww 14:55:58 that would make for some great eso code 14:56:06 make tons of little functions out of prototypes 14:56:14 then write the whole program as one parenless expression full of calls to them 14:56:23 hmm 14:56:28 you could possibly even get it readable 14:56:29 like 14:56:30 it ought to work 14:56:36 just the Perl parser isn't good enough to figure it out, I think 14:56:40 if 14:56:42 equals 14:56:45 plus 2, 2 14:56:47 3 14:56:51 print "yay" 14:56:52 err 14:56:53 wait 14:56:55 * tusho pastebins 14:57:29 ais523: http://rafb.net/p/6vYIPP46.html 15:07:09 -!- Corun has quit (Read error: 110 (Connection timed out)). 15:07:16 -!- Corun_ has changed nick to Corun. 15:11:59 a 15:14:11 -!- Slereah has quit (Read error: 110 (Connection timed out)). 15:14:16 -!- Slereah has joined. 15:17:46 I don't think Perl's parser really keeps track of the exact arity when parsing code, just some overall "style" of the function. If I do "sub plus ($$) {...}" and try to call it like "print plus 1, 2, "\n";" it just complains about too many arguments to plus, since it has parsed it to be print plus(1, 2, "\n"); The prototype just helps it recognize "plus" as a function. 15:25:51 someone 15:25:52 PLEASE 15:25:53 write 15:25:54 a name generator 15:25:56 for software 15:27:41 fizzie: yes, that's what I think too 15:30:29 ais523: quick come up with a name 15:30:36 for what? 15:31:09 a name 15:31:20 Acciacatura 15:31:27 too long 15:31:37 * tusho notes that he just morphed ais523 into a program 15:31:38 oh dear 15:38:10 ais523(#short); 15:38:11 -!- Slereah has quit (Read error: 104 (Connection reset by peer)). 15:38:17 -!- Slereah has joined. 15:43:09 tusho, hm if you tell me for what I could _try_ to help 15:43:28 AnMaster: telling you what it is could produce a name that makes sense 15:43:31 that will not do :D 15:43:41 Innovation Software Inc. 15:43:42 then 15:44:26 aaah :P 15:44:35 it's a piece of software 15:44:37 i will tell you that 15:44:40 ah right hm 15:44:45 YourSQL? 15:44:57 or would that be YouSQL? 15:45:03 ah no, Your 15:45:20 CheeSQL. 15:45:48 who said it was sql :P 15:45:50 It's like cheese, except databases. 15:45:55 fizzie, ah 15:46:04 tusho, well you didn't say that it wasn't 15:46:05 so... 15:46:14 AnMaster: i'm kind of looking for something meaningless :-P 15:46:19 * tusho types random letters 15:46:24 Aretea 15:46:32 AAsTnRm 15:46:36 ooh I like aretea 15:46:57 tusho, AreteaSQL? 15:47:00 no doesn't sound good ;) 15:47:04 AnMaster: IT'S NOT SQL :-P 15:47:06 hah ok 15:47:13 tusho, so what is it? 15:47:20 AnMaster: MAGICAL 15:47:30 ah.... 15:47:37 -!- sebbu has joined. 15:47:43 aka: you'll see, probably, maybe 15:47:45 tusho, what about.... Rouge? 15:47:51 that got magic ;P 15:47:53 i think i've picked aretea 15:47:57 ok 15:48:04 it's easy to type and such 15:48:14 -!- optbot has set topic: the entire backlog of #esoteric: http://tunes.org/~nef/logs/esoteric | probably ``releases the stream" would be better because java does not distinguish much between the reference and the object it refers to. 15:48:17 tusho, does it exist? 15:48:19 check with google 15:48:27 I did. 15:48:35 It's a restaraunt and a World of Warcraft player. 15:48:45 tusho, ah probably no issue then 15:49:05 Actually, this program controls a World of Warcraft bot player that owns a restaraunt in-game 15:49:07 :-| 15:49:08 tusho, or you could call it: ThisIsNotSQL 15:49:17 ;) 15:50:27 ARAWAD: Recursive Acronym With A Difference 15:50:43 That's a ripoff of PHP: Hypertext Preprocessor 15:51:00 yes 15:51:05 UNG = Unix is Not Gnu? 15:51:16 or even UNR, Unis is Not RMS 15:51:21 AnMaster: That needs Gnu = GNU's Not UNG 15:51:32 tusho, heh 15:51:43 Unix* 15:51:45 GNU's Not GNU's Not GNU's Not GNU's Not GNU's Not GNU's Not GNU's Not GNU's Not GNU's Not ... Unix is Not GNU's NOT ... 15:51:52 * tusho 's brain explodes 15:52:05 tusho, well I'm sure you could create that list in Haskell ;P 15:52:20 yes 15:52:21 * AnMaster still thinks infinite lists in a programming language seem rather weird 15:52:35 ung = ["unix", "is", "not", gnu] 15:52:40 gnu = ["gnu's", "not", ung] 15:52:57 well I guess it uses references 15:53:04 nope 15:53:07 AnMaster: you're thinking way to low level there 15:53:07 just lazy evaluation 15:53:08 it uses thunks 15:53:14 ais523, ah, ok 15:53:16 x is actually a 0-argument function returning x 15:53:20 that's how it does the laziness 15:53:22 it's ... complex 15:53:24 also 15:53:27 my example is invalid 15:53:28 it only bothers to calculate a particular element of the list when you try to find out its value 15:53:29 needs to be 15:53:35 ["unix", "is", "not"] ++ gnu 15:53:37 otherwise illtyped 15:53:59 Prelude> let ung = ["unix", "is", "not"] ++ gnu; gnu = ["gnu's", "not"] ++ ung 15:53:59 Prelude> gnu 15:54:00 ["gnu's","not","unix","is","not","gnu's","not","unix","is","not","gnu's","not","unix","is","not","gnu's","not","unix","is","not","gnu's","not","unix","is","not","gnu's","not","unix","is","n(...) 15:54:31 hm Prelude? 15:54:32 hmm 15:54:32 should be 15:54:38 AnMaster: which library is loaded 15:54:39 gnu ++ ["'s", "not"] ++ ung 15:54:40 ofc 15:54:41 Prelude's the standard one 15:54:45 ah 15:54:50 sort of like stdio and stdlib, etc, in C 15:55:18 tusho, it is not an infinite string though 15:55:25 but I guess strings aren't lists in haskell 15:55:29 yes they are... 15:55:33 ah ok 15:55:33 type String = [Char] 15:55:41 Prelude> let ung' = ung' ++ ["is", "not"] ++ gnu'; gnu' = gnu' ++ ["is", "not"] ++ ung' 15:55:42 Prelude> gnu' 15:55:42 *** Exception: stack overflow 15:55:49 ah 15:55:59 so it tries to evaluate that all at once 15:56:03 of course, it has to 15:56:10 to pretty-print it, it needs to get the first element 15:56:20 and the first element is the first element by one level of indirection... 15:57:05 hm true 15:57:16 no function to flattern a list? 15:57:23 or to be more esact 15:57:25 exact* 15:57:28 it's easy enough to write 15:57:33 it's probably foldl (++) 15:57:34 no function to lazily flattern a list 15:57:36 concat 15:57:42 which would be a lazy flatten 15:57:46 ah 15:57:51 foldl's the one that works lazily IIRC 15:57:55 no, foldr 15:57:57 then you could use that to generate a valid such string 15:57:59 I think 15:57:59 ah, ok 15:58:02 foldr (++) 15:58:05 http://www.foldl.com/ 15:58:06 http://www.foldr.com/ 15:58:19 Deewiant: are those about Haskell? 15:58:27 Deewiant, wonder who registered those 15:58:32 they're exactly about foldl and foldr :-P 15:58:34 AnMaster: same perosn 15:58:35 *person 15:58:42 well obviously 15:58:43 also 15:58:52 i think they'd be good candidates for an art gallery 15:59:00 oliver steele, according to whois 15:59:07 a wall with "foldl" and "foldr" in text, below them a screen with the respective site on a touchscreen 15:59:12 (with big text for clickery, ofc) 15:59:20 it is a postmodern statemenet about... 15:59:22 something 15:59:23 -!- Slereah has quit (Read error: 113 (No route to host)). 15:59:31 tusho, about functional programming? 15:59:37 no 15:59:39 that is far too surface 15:59:43 it's about, um, the human status 15:59:44 yes 15:59:58 tusho, shouldn't the word "lists" be there somewhere 16:00:16 what, on foldl.com and foldr.com? 16:00:19 OK, why did someone bother two register /two/ domain names for that? 16:00:24 ais523: why not 16:00:27 tusho, in the "about" bit 16:00:28 registering domains is EASY 16:00:33 AnMaster: no 16:00:37 you just can't appreciate good art... 16:00:39 :-| 16:00:41 :P 16:00:46 ais523: fold.com was probably taken? 16:01:02 tusho: but expensive 16:01:05 tusho, certainly I can, but that depends on what sort of art you prefer. I even like some modern art, but I prefer classical stuff 16:01:05 ais523: what 16:01:08 EXPENSIVE? domains? 16:01:21 -!- sebbu2 has quit (Read error: 110 (Connection timed out)). 16:01:22 yes, £4 a year is very expensive 16:02:39 AnMaster: i was just taking the piss, but i guess that's a bit silly of me since I like this: http://www.qotile.net/blog/wp/?p=564 (Note: Websites background is designed to destroy your eyes with its crazy animation.) 16:03:13 (Note: I got gif animation repeat turned off) 16:03:50 aww 16:03:52 that's a shame 16:03:54 it's great 16:03:57 after a while it just stops 16:04:01 and then starts up again for no reason 16:05:13 -!- Slereah has joined. 16:05:18 Gentlemen. 16:08:00 http://esolangs.org/wiki/Malbolge_Unshackled <-- hm, ais523.... gcc-malbolge but for that turing complete version? 16:08:11 AnMaster: aargh 16:08:35 Soon, we'll get our programming project 16:08:40 And I have an unclean urge 16:08:54 I want to hand in, with the C version, a Scheme version and a Python version. 16:08:58 Just for lulz 16:09:13 Or possibly some more efficient functional language 16:09:19 Like Ocaml or something 16:09:35 hmm... anyone know a good guide on Ocaml? 16:09:43 I think my university project for this year's Ocaml-based 16:09:45 I hope one exists! 16:09:58 malbolge IS tc 16:10:03 Although really, our programming projects are usually really low level 16:10:08 tusho, ah yes by IO 16:10:09 tusho: original Malbolge definitely isn't 16:10:16 Which is why they teach us so little of it 16:10:16 because it has limited storage, thus is a finite-state machine 16:10:19 Malbolge-T may be 16:10:22 ais523: that's not part of the spec 16:10:26 tusho: yes it is 16:10:28 oh 16:10:33 memory's listed to 59049 10-trit words 16:10:34 well, okay 16:10:40 well 16:10:47 malbolge is 'turing complete beyond memory constrains' 16:10:53 aka...all real-life systems ever 16:11:21 Is Jesus TC? 16:11:27 except that it's arguable whether 59049 words is enough to do anything useful 16:11:43 in Malbolge, that is 16:11:51 it's easily enough for many other more practical languages 16:12:04 AnMaster: also I have basically no idea how to compile into Malbolge 16:12:59 ais523, nor have I really 16:13:03 but should be possible 16:14:18 -!- Slereah has set topic: the entire backlog of #esoteric: http://tunes.org/~nef/logs/esoteric | probably ``releases the stream" would be better because java does not distinguish much between the reference and the object it refers to - Try to imagine all life as you know it stopping instantaneously and every molecule in your body exploding at the speed of light.. 16:15:15 optbot! 16:15:15 -!- optbot has set topic: the entire backlog of #esoteric: http://tunes.org/~nef/logs/esoteric | !lostkng look. 16:15:21 we have no manual topics in HERE mister 16:15:22 >:( 16:15:23 :-P 16:15:47 there was a game of Lost Kingdoms going on in #esoteric? 16:16:05 anyway, I never got past the bit with the animal that eats you and which seems impossible to attack 16:16:23 nor did I ever bother to finish reverse-engineering Lost Kingdoms back to the original source so I could see how to solve it 16:17:45 ais523: ask the author? 16:18:25 nah, boring 16:18:37 ais523, reverse engineer heh 16:18:50 it's a common phrase in English 16:18:55 brainfuck should be pretty hard to reverse engineer... 16:18:57 that is what I meant 16:18:58 yes 16:19:01 at least compiled ones 16:19:02 but I have the source to BFBASIC 16:19:19 so by analysing BFBASIC to see how it generates code I may have a shot at decompiling Lost Kingdoms 16:19:24 yeah... 16:19:33 probably I can't be bothered, though 16:19:37 ais523, except they ran some optimiser over it iirc 16:20:03 that change +-- into - and such 16:20:16 oh, probably 16:20:20 but that's less important 16:20:24 decoding the program flow helps 16:20:29 and extracting strings would particularly help 16:20:35 for a lost-kingdoms-like program 16:24:10 ais523, does gcc-bf optimise away ++-- and such? 16:24:19 it will do in a postprocessing pass 16:24:24 but I don't think that can be generated in the first place 16:24:37 it does optimise away ><, which can be 16:32:23 -!- Slereah has quit (Read error: 104 (Connection reset by peer)). 16:37:07 ais523, how do you handle -c option? 16:37:13 that is object files not executables 16:37:49 some custom format? 16:37:54 it outputs in asm 16:37:58 with a .o extension 16:38:11 ais523, what asm format? ? 16:38:16 my own 16:38:21 interesting 16:38:26 but most of gcc-bf's processing is done in asm 16:38:35 which it converts to brainfuck right at the end 16:40:10 -!- tusho has quit (Remote closed the connection). 16:40:23 tusho was halfway through a sentence in query and left... 16:40:26 I wonder what the problem is 16:40:31 -!- tusho has joined. 16:43:58 -!- kar8nga has joined. 16:44:27 ais523, network issues I guess 16:52:20 who 16:52:21 me? 16:53:56 yes 16:54:43 no 16:57:35 -!- Mony has joined. 16:58:27 plop 17:02:42 hi Mony 17:02:47 hi ais523 17:26:22 -!- Corun has quit (Read error: 110 (Connection timed out)). 17:53:58 -!- Judofyr has joined. 17:54:50 -!- puzzlet has quit (Remote closed the connection). 17:54:58 -!- puzzlet has joined. 17:58:33 C++ backtraces are very hard to read IMO 17:58:36 just consider: 17:58:37 std::basic_istream >& std::getline, std::allocator >(std::basic_istream >&, std::basic_string, std::allocator >&, char) 17:58:53 and there are worse ones 17:58:59 well, that gives all the information you need 17:59:13 ais523, yes but it takes like 10 seconds to find the function name 17:59:17 in that 17:59:33 that is the function name 18:00:11 std::basic_string, std::allocator >& <-- isn't that same as std::string& 18:00:20 would be easier to read 18:01:02 AnMaster: nontrivial to get that 18:01:07 impossible, probably 18:01:20 tusho, depends, it could store that in the debug info 18:01:37 since I already used -ggdb3 I obviously didn't bind binary size ;P 18:13:49 -!- oerjan has joined. 18:15:35 Why Marsh is the greatest grocery store: Because it's the only place where you can buy Food Club brand bleach. 18:15:47 hi oerjan 18:16:35 and a good evening to you, Mr. ais523 18:22:31 -!- kar8nga has quit (Connection reset by peer). 18:22:53 -!- kar8nga has joined. 18:36:20 -!- oc2k1__ has quit (Read error: 110 (Connection timed out)). 18:39:41 -!- olsner has joined. 18:42:26 -!- Corun has joined. 18:43:50 -!- oc2k1__ has joined. 18:44:51 -!- Slereah has joined. 19:04:29 -!- psygnisfive has joined. 19:11:52 -!- KingOfKarlsruhe has joined. 19:12:30 -!- psygnisfive has quit ("http://www.mibbit.com ajax IRC Client"). 19:12:50 "I'm currently looking for (v)servers running Debian with root access via ssh, located in Germany. If possible, the server should be free." 19:13:01 a vps/dedi, with root access, in germany... for free 19:13:03 hahahahahah :D 19:14:29 free as in speech, maybe 19:14:37 as long as you don't deny the holocaust 19:14:52 nearlyfreespeech.net allows stuff like holocaust denialists i believe 19:15:05 well then it is probably not in germany 19:15:12 it is not :P 19:23:14 -!- KingOfKarlsruhe has quit (Remote closed the connection). 19:23:21 -!- KingOfKarlsruhe has joined. 19:26:55 -!- KingOfKarlsruhe has quit (Remote closed the connection). 19:28:25 -!- sebbu2 has joined. 19:47:55 -!- sebbu has quit (Read error: 110 (Connection timed out)). 19:47:55 -!- sebbu2 has changed nick to sebbu. 19:51:24 http://www-01.ibm.com/support/docview.wss?rs=899&uid=swg21086803 19:51:27 Notes error: 'Document has too many paragraphs - it must be split into several documents' 19:58:19 is this that OOXML standard you were discussing earlier? >:) 19:58:35 or perhaps it's that European Constitution thing... 19:58:56 (or whatever it's called now) 20:00:39 oh it's not an example. 20:05:08 -!- oc2k1 has joined. 20:05:36 -!- oc2k1__ has quit (Read error: 110 (Connection timed out)). 20:14:35 -!- Mony has left (?). 20:18:37 * oerjan wonders who the heck Viramakarita is. 20:19:09 all the links are in french, and seem to be that quote or similar 20:19:58 Slereah: have you heard about him/her? 20:20:57 /it 20:21:10 hm could be 20:21:26 i just lost the game 20:21:27 and so did you 20:21:29 replacing k by c gave one link, in english 20:21:44 i avoid losing the game by rejecting the rules 20:22:05 impossible 20:22:10 Rule 1. You are playing the game 20:22:14 no getting out of that 20:22:16 * ais523 agrees with Oerjan 20:22:24 the game deludes its players into thinking everyone is playing 20:22:30 those of us who aren't playing know better 20:22:32 ais523: look, the game doesn't actually make sense 20:22:35 and can't make people play 20:22:37 everyone knows that 20:22:39 it's not delusion 20:22:42 it's called "but it's funnier this way" 20:23:08 but rejecting the rules can be funny if you do it high-brow enough 20:23:22 say, write a philosophic tome on the concept 20:23:30 oerjan: yes, but you didn't 20:24:52 ah, vikramacarita gives more hits 20:26:21 tusho: i alluded to it, which is obviously funnier than reading a 600 page tome 20:28:35 If rule 1 of the game is that you're playing the game, that's a null rule: If you're not playing the game, you're not following its rules, so the fact that one of its rules is that you're playing the game is irrelevant. If you are following the rules, you're playing the game, so the fact that a rule says you're playing the game is redundant. 20:28:49 GregorR: i believe you missed the part where I said "everybody knows that" 20:29:15 I like to respond to individual lines out of context :P 20:34:43 ah finally: http://en.wikipedia.org/wiki/Vikram%C4%81ditya 21:04:21 -!- Corun has quit (Read error: 110 (Connection timed out)). 21:17:58 -!- Corun has joined. 21:28:40 * tusho ponders 21:28:56 taking up aretea/ is a bit annoying, I could do _aretea/ but that's just security via obscurity 21:28:58 f 21:30:24 -!- jix has quit ("CommandQ"). 21:35:21 -!- kar8nga has quit (Read error: 110 (Connection timed out)). 21:48:14 -!- optbot has set topic: the entire backlog of #esoteric: http://tunes.org/~nef/logs/esoteric | In which case you could just do @load quote again!. 21:51:56 -!- Corun has quit (Remote closed the connection). 21:52:10 -!- Corun has joined. 21:56:18 -!- Judofyr has quit (Read error: 104 (Connection reset by peer)). 22:01:16 @load quote 22:04:43 -!- moozilla has joined. 22:40:18 -!- Corun_ has joined. 22:41:06 -!- Corun_ has quit (Client Quit). 22:41:24 -!- Corun_ has joined. 22:42:03 -!- Corun has quit (Read error: 104 (Connection reset by peer)). 22:43:45 -!- Corun_ has changed nick to Corun. 22:52:49 hmm 22:52:52 it feels a lot later than it is 22:54:02 hm you're in Europe, not in one of those places that just changed out of DST 22:54:05 iirc 22:54:20 (i think there are some aren't there) 22:56:30 its 22:56 22:56:35 it feels like 23:30 22:56:54 it's 23:56 here if that helps :D 22:57:14 22:57 by my clock 22:59:32 ooh, now it's 23:59 23:00:12 ayeeh! it all zeroed out! 23:01:52 oerjan: Happy tomorrow. 23:02:24 thank you (:|>* 23:25:56 -!- Corun has quit (Read error: 60 (Operation timed out)). 23:27:28 Meanwhile http://www.sshkeygen.com/ is still up 23:28:01 oh dear 23:28:06 anyone uses it? 23:28:23 i hope not 23:32:31 -!- ais523 has quit ("(1)DOCOMEFROM".2~.2"~#1WHILE:1<-"'?.1$.2'~'"':1/.1$.2'~#0"$#65535'"$"'"'&.1$.2'~'#0$#65535'"$#0'~#32767$#1""). 23:42:27 -!- oerjan has quit ("Good night"). 23:53:40 -!- Corun has joined.