00:08:53 -!- olsner has quit ("Leaving"). 00:09:33 What's a good introduction on electronics for computing purpose? 00:15:22 why not do like me and just know everything without explicitly learning it? 00:17:06 I tried, but I can't find the shoes. 00:19:41 i just use whatever gonkers you can fimble your mendelas on 00:19:48 *-i 00:26:37 -!- timotiis has quit ("leaving"). 00:46:00 * slereah_ tries to whip up a Jot interpreter. 00:53:07 Nice thing is, it's regular! 00:53:21 I can get rid of most of the checking in Lazy Bird to build it 01:24:32 Butts. It no works. 01:35:01 Oh dick. It was a misplaced ` 01:36:08 And now it works perfectly. 01:36:46 Or does it. 01:36:56 the advertised "non-terminating program" terminates. 01:38:05 And the 100 for i gives me k 01:40:25 Wait, is 100 actually supposed to be i 01:40:29 I think that's zot. 01:52:48 -!- sebbu has quit ("@+"). 02:13:02 -!- Sgeo has joined. 03:41:56 -!- Judofyr has quit (Read error: 104 (Connection reset by peer)). 03:42:33 -!- Judofyr has joined. 03:46:10 Hm. 03:46:37 apparently, the 1[A][B] for `AB only works for the combinators 11100 11111000 03:46:45 k is also 00, but 10000 isn't `kk 03:51:22 Is the Jot guy still available on his email adress? 04:09:18 -!- GreaseMonkey has joined. 04:41:22 -!- Tritonio_ has quit (Remote closed the connection). 04:44:52 -!- Tritonio_ has joined. 04:47:32 -!- Sgeo has quit (Remote closed the connection). 06:47:01 -!- Judofyr has quit (Read error: 104 (Connection reset by peer)). 06:47:26 -!- Judofyr has joined. 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 09:54:40 -!- GreaseMonkey has quit ("Read error: 110 (Connection chickened out)"). 10:53:06 -!- oklopol has quit (Read error: 113 (No route to host)). 11:11:40 -!- Judofyr has quit (Read error: 104 (Connection reset by peer)). 11:12:11 -!- Judofyr has joined. 11:20:13 -!- puzzlet has quit (Remote closed the connection). 11:20:20 -!- puzzlet has joined. 11:32:36 -!- Judofyr has quit (Read error: 104 (Connection reset by peer)). 11:33:12 -!- Judofyr has joined. 11:39:16 -!- puzzlet_ has joined. 11:39:16 -!- puzzlet has quit (Remote closed the connection). 13:25:58 -!- okopol has joined. 14:03:13 -!- oklopol has joined. 14:04:41 -!- okopol has quit (Connection reset by peer). 14:06:29 -!- Tritonio_ has quit (Remote closed the connection). 14:13:59 -!- jix has joined. 14:21:02 O_ooo 14:21:03 http://cubonegro.orgfree.com/sponge/sponge.html 14:34:35 heh, generates about 6500 bytes to calculate the factorial of 5 14:41:27 456** 14:41:27 ! 14:41:34 * oklopol pwnd it 14:41:46 ba* 14:41:51 ca* that is 14:42:02 shorter :-P 14:42:25 darn :D 14:43:20 AnMaster: if you want to do benchmarking, this generates some /slow/ code :-P 14:43:50 getting the 8th fibonacci number took about as many seconds 14:44:10 over 10KB of code :-) 14:55:28 -!- Tritonio_ has joined. 15:06:17 Deewiant, where? 15:06:50 ah 15:06:53 AnMaster: about 10 lines up 15:06:57 Deewiant, yes work is slow on cfunge atm 15:07:01 I got a really nasty cold 15:07:07 so spend most time in bed atm 15:07:09 :( 15:07:27 note I can't code scheme btw 15:07:33 you worried that I'm secretly rewriting CCBI in Fortran to speed it up? ;-P 15:07:40 harhar 15:07:45 nah not really 15:08:06 and that comes with some scheme samples, like the factorial, which it compiles by default 15:08:20 so you can just use that if you're interested 15:08:27 how do I run it? 15:08:47 get a common lisp compiler/interpreter and run it on the source 15:08:58 Deewiant, err did you say scheme or lisp? 15:09:03 at the bottom of the file under "tests" are what it compiles 15:09:12 AnMaster: it's written in common lisp 15:09:24 ok, why not scheme, to make it self hosting ;) 15:09:38 it'd be too limited for that, anyway :-P 15:09:43 but I don't know. 15:10:11 Deewiant, would sbcl work? 15:10:18 I think it was installed by maxima 15:10:24 as a dep of maxima I mean 15:10:24 I don't know, try it :-P 15:11:04 err it outputs stuff like: 15:11:04 (LAMBDA (G2998) 15:11:05 ((LAMBDA (G2998) 15:11:05 (G2998 15:11:05 (LAMBDA (G2998 N) 15:11:10 ??? 15:11:20 don't know what that's about 15:11:25 might be debugging stuff or something 15:11:32 the program is in out.bf 15:12:12 $ ./cfunge scheme/out.bf 15:12:12 120 15:12:13 hm? 15:12:15 that's all? 15:12:21 factorial of 5 15:12:21 :-) 15:12:31 that's the program it compiles by default 15:12:34 tool like half a second 15:12:38 or less 15:12:38 yep :-) 15:12:45 not optimized build 15:13:01 try fibonacci 15:13:45 *** - (NOT "unbound variable") must evaluate to a non-NIL value. 15:13:46 mhm? 15:13:59 compile error? 15:14:02 I don't know lisp myself 15:14:10 what one is fibonacci 15:14:19 there's not one there, I'm pasting it 15:14:28 http://lisp.paste.f-box.org/43 15:14:28 k 15:14:37 yet another pastebin 15:14:46 running the same old software 15:16:02 Deewiant, ok took about 2 seconds to run 15:16:12 and the code look badly optimized btw 15:16:16 yep, see if you can speed that up 15:16:21 if you're interested 15:16:29 I don't know lisp 15:16:36 not the point 15:16:45 profile CFunge and see if there are any bottlenecks 15:16:52 or if it's still just the same old funge-space 15:16:56 well I mean the befunge code looks unoptimized 15:16:59 but indeed I will 15:17:15 of course it is, it's auto-generated from a much higher level language :-) 15:17:20 and poorly ;-) 15:17:49 -!- oklopol has quit (Connection timed out). 15:19:12 -!- okopol has joined. 15:20:38 Deewiant, yes still funge-space 15:20:51 one thing however 15:20:58 fungeSpaceInRange hmmm 15:21:06 it does a lot of wrapping *looks at code*? 15:21:14 looks like it, yes 15:21:17 oh yes it does 15:22:06 hm hash function got a bit of time too *tries another one* 15:23:03 -!- RedDak has joined. 15:23:43 Deewiant, also the main execute instruction doesn't look too good 15:26:51 Deewiant, in total most time is spent in hash lookup indeed, but per call it is most in ExecuteInstruction 15:26:53 hm 15:28:14 Deewiant, how long does CCBI take? 15:29:32 about 9.7 seconds on windows here 15:29:35 for that fibo 15:30:14 cfunge does take about 2 seconds on it :) 15:30:19 * AnMaster looks for the ccbi binary 15:30:31 but of course we're on different machines so the numbers mean little :-P 15:30:39 plus I've got about 20% background CPU usage anyway 15:30:55 real 0m8.182s 15:30:56 yeah 15:31:06 that's from ccbi 15:31:33 04a*4+21g01g:3+01p11p11g2+1p11g1+1p11g0+1p11g04a*3+21g01g:3+01p11p11g2+1p11g1+1p11g0+1p11g:31p2+1g01g:2+01p11p11g1+1p11g0+1p11g21p31g1+1g>#x;# \-+5*a+3*a+4*a20-0+2;# 15:31:39 still I wonder wtf it is doing 15:32:48 -!- jix has quit ("This computer has gone to sleep"). 15:33:44 Deewiant, I think I seen a pretty fast version of fibo in funge somewhere 15:35:05 AnMaster: it converted ordinary functional code to CPS 15:35:13 CPS? 15:35:23 which, in itself, suggests to me that the result will be complicated, let alone in befunge :-P 15:35:26 continuation-passing style 15:35:32 ah 15:35:43 it uses x a lot I see btw 15:36:24 yeah befunge doesn't fit for functional programming 15:36:49 s/functional // ;-) 15:38:02 for example it doesn't use a-f 15:38:03 hm 15:39:19 oh wait it does 15:39:21 but not often 15:44:52 I think more inlining would help cut down the x usage 15:47:25 SimonRC, hum? 15:48:01 SimonRC, x isn't such a large problem 15:48:05 other things are worse 15:48:08 way worse 15:49:38 hm 15:50:07 Deewiant, for that program keeping track of two bounding boxes of funge space would help 15:50:12 because first there is a huge line and then a lot of short ones that wrap 15:50:30 however I got no idea how to detect it from code 15:50:30 by all means implement some kind of dynamic partitioning :-) 15:50:40 Deewiant, I don't know how heh 15:50:57 but wrapping was quite near the top in that program 15:51:06 Deewiant, still I beat CCBI ;P 15:51:12 no surprises there :-P 15:51:20 ah! 15:51:22 I know.. 15:51:28 SimonRC, ? 15:51:39 you could partition space into 32*32 blocks 15:51:54 hm? 15:52:16 then for each block, store a bitmap for rows and columns, to say whether there is anything in it... 15:52:21 still hash function for hash table of fungespace is *worse* 15:52:32 then you can check 32 cells for code with a simple bit operation 15:53:10 my optimisation will catch the common case of wrapping when going ^ 15:53:18 for cardinal wrapping there could exist one trick 15:53:32 keep a line length of each line 15:53:59 AnMaster: mine is a slightly more advanced version of that. 15:54:29 AnMaster: that's what I originally considered but decided to keep things simple and just kept one big box 15:54:40 actually just fixing cardinal wrapping to not use the slow backtrack method used for non-cardinal 15:55:00 the simplified wrapping is atm disabled due to causing an error in mycology 15:55:10 a infinite loop on string across wrap 15:55:13 an* 15:55:27 * AnMaster goes to try to find what is wrong in that code 15:56:16 another idea is to store for each instruction the closest and furthest instruction in each direction 15:56:32 that could be done lazily 15:56:48 so the code turns itself into a linked list 15:57:03 but you would have to handle the insertion of new instructions somehow... 15:58:04 yes that is one thing, the other issue is with fetching instructions 15:58:19 need to store a struct instead of just a int into the hash table 16:09:06 oh god.... 16:09:15 oklotalk's continuation system == the J operator xD 16:09:25 okay, i've invented another old invention 16:09:27 lolz 16:09:27 -> 16:11:42 UNDEF: the empty string wrapped around the edge of space >0a-6cf*+p v>1> \v vv v\ >1>v 16:11:44 Deewiant, hehehe ^ 16:12:13 hey. that is a point 16:12:33 with threads, it is possible for an IP to end up trying to traverse a completely empty line 16:12:58 SimonRC, hm? or with J of SUBR fingerprint 16:13:04 and possible a few more 16:13:14 SimonRC, and it is possible even without threads 16:13:18 what happens then? 16:13:24 I have seen a program that manage to self destructs itself 16:13:32 SimonRC, infinite loop possibly 16:13:39 huh? where? 16:13:43 err? 16:13:47 with threads, it is possible for an IP to end up trying to traverse a completely empty line 16:13:52 well depends on interpreter 16:13:59 logically it should be an infinite loop 16:14:07 wrapping and doing nothing 16:14:25 as space take no ticks it would lock up any other IP too 16:14:58 http://quote-egnufeb-quote-greaterthan-colon-hash-comma-underscore-at.info/befunge/ 16:14:59 is where 16:15:11 "Suicide programs" 16:15:24 oh wow, nice domain name 16:15:29 yeah 16:16:27 ah, I just remembered that you can wrap to get the last few instructions to die 16:17:28 heh, suicide programs 16:23:49 -!- jix has joined. 16:24:11 -!- jix has quit (Remote closed the connection). 16:24:36 -!- jix has joined. 16:26:04 -!- Tritonio_ has quit (Remote closed the connection). 17:05:34 -!- Tritonio_ has joined. 17:07:21 -!- atsampso1 has quit ("electricity meter change"). 17:19:54 -!- RedDak has quit ("Killed (NickServ (Comando GHOST usato da DIO))"). 17:22:25 -!- ehird has joined. 17:22:51 -!- ehird has quit (Remote closed the connection). 17:25:20 -!- timotiis has joined. 17:25:36 -!- slereah__ has joined. 17:27:15 -!- slereah_ has quit (Read error: 104 (Connection reset by peer)). 17:34:15 -!- okopol has quit (Read error: 110 (Connection timed out)). 17:37:57 -!- atsampson has joined. 17:41:24 -!- ehird has joined. 17:41:56 I haev 5.3 hearts. 17:42:39 ehird, err? 17:42:42 Are you a Space Marine or a Mario brother? 17:42:54 slereah__, what is a space marine? 17:42:56 yay ehird 17:43:09 http://rosettacode.org/wiki/Amb 17:43:25 A marine. In space. 17:43:32 made that page based on the amb stuff 17:43:33 The most famous example has two hearts. 17:43:56 Super Mario is a good example of a game that was given a plot after conception. 17:44:09 PLUMBERS. UP TO BATTLE EVIL TURTLES 17:44:43 marshmallows, "The Amb operator takes some number of expressions (or values if that's simpler in the language) and nondeterministically yields the one" 17:44:49 err that grammar is broken? 17:44:59 AnMaster: probably.. I wrote it.. 17:45:04 You can fix it if you like 17:45:04 "nondeterministically yields the one" <-- the one what? 17:45:12 marshmallows, I got no clue what it is about 17:45:33 slereah__, hehehehe 17:45:39 slereah__, yeah XD 17:46:13 And we all know what happened when they tried to make a movie out of it! 17:46:23 err they did? 17:46:28 did they really try it? 17:46:31 Yes. They did. 17:46:32 oh my 17:46:36 failure I bet 17:46:36 The operative word is 'try'. 17:46:37 Tried, and... 17:46:47 Well, not succeeded, but the movie did came out 17:46:54 oh? 17:47:05 http://www.gamesetwatch.com/mariomovie2.jpg 17:47:18 oh my 17:47:45 when was that? 17:47:45 When your game is about plumbers to defeat evil reptiles, it's hard to scrap up enough plot for a movie 17:47:53 At least ten years ago 17:47:59 That's roughly when I saw it 17:48:07 you did? poor you 17:48:10 1993 sez Wikipedia 17:48:12 -!- okopol has joined. 17:48:41 "Although it boasted several big stars, the film was denounced by critics as "cheesy" and lacking any sort of coherent plot. " 17:48:50 Very much in the image of Super Mario itself 17:49:21 AnMaster: amb(1,2,3) returns 1 2 or 3 17:49:28 if you then do amb() later, it goes back and picks another 17:49:30 so: 17:49:39 int foo = amb(1,2,3); if (foo < 2) { amb(); } 17:49:40 foo is 2 17:50:03 or 3 17:50:04 so it's like picking a card from a pack 17:50:14 and not putting it back before next pick 17:50:14 DFS is not specified 17:50:16 ? 17:50:20 marshmallows: your code free()s an argument, that's bad style 17:50:24 marshmallows: yes 17:50:29 AnMaster: well, foo is not 1 17:50:33 it is 2 or 3 17:50:40 ehird, ? 17:50:47 basically, amb() means 'one of your previous amb()s were wrong, pick another' 17:50:49 ugh yeah 17:50:57 my code is wrong, thanks for pointing that out 17:51:00 ah I see 17:51:07 marshmallows: my pasted one was a LOT simpler.. 17:51:16 it didn't work though :P 17:51:35 marshmallows: it did 17:51:35 if you have a simpler one do just replace mine though 17:51:39 mine worked 17:51:39 ehird, so it is basically back tracking? 17:51:51 well I had some verson of amb that didn't work at some point 17:52:12 AnMaster: it is a backtracking operator 17:52:22 and that iirc is quite slow? 17:52:30 AnMaster: it's a theoretical construct. 17:52:37 yeah 17:52:42 not useful in practice, really, though i think you can implement prolog with just a few more things 17:52:49 what does amb stand for? 17:52:55 AnMaster: ambigious 17:52:58 ah 17:54:32 also 17:54:35 the ruby amb is terrible, marshmallows 17:54:42 http://www.randomhacks.net/articles/2005/10/11/amb-operator nicer 17:55:02 also the scheme is ugly 17:58:02 scheme is ugly! 17:58:17 * slereah__ liek the way scheme looks :( 17:58:31 Unlike Haskell! 17:58:44 C! 17:58:49 and funge of course 17:59:10 but for real languages C with correct indention (as in the way I like it) is the beauty itself ;P 17:59:12 * AnMaster runs 17:59:20 real as in non-esoteric 17:59:38 Does MACHINE CODE count as real? :o 17:59:53 so i propose that we do get logged by irseek 18:00:06 Sure, why not. 18:00:07 just consider http://www.irseek.com/result.php?keywords=brainfuck 18:00:32 :brainfuck is not a sane language. 18:00:36 Haet crime! 18:00:39 the key advantage over ircbrowse is that ircbrowse is for people who already know that #esoteric exists 18:00:50 and in irseek, you search by keyword 18:00:56 so new people could find us that way 18:02:04 lament: irseek is corporate jib-jab :D 18:02:18 18:02:28 rrright :) 18:02:46 A logbot... IN PSOX? 18:08:25 libstacksmash is a much nicer name than libcallstack 18:08:30 libcstack might be more correct 18:08:53 LIBSTACK SMASH! 18:16:28 -!- okopol has quit (Read error: 113 (No route to host)). 18:24:28 -!- slereah_ has joined. 18:24:28 -!- slereah__ has quit (Read error: 104 (Connection reset by peer)). 18:29:48 -!- p3k has joined. 18:30:35 -!- Deformative has quit (Remote closed the connection). 18:30:57 -!- Deformative has joined. 18:39:51 -!- p3k has quit. 18:42:41 -!- Tritonio_ has quit (Remote closed the connection). 18:56:40 -!- RedDak has joined. 19:04:13 -!- Tritonio_ has joined. 19:22:23 -!- sebbu has joined. 19:34:57 * SimonRC goes 19:37:55 -!- RedDak has quit ("Killed (NickServ (Comando GHOST usato da DIO))"). 19:38:30 -!- Tritonio__ has joined. 19:40:10 -!- Tritonio_ has quit (Read error: 113 (No route to host)). 20:27:30 Aaaargh. 20:27:35 Damn that jot! 20:48:30 slereah_, ? 20:49:01 The 1 for ` is really not intuitive at all D: 20:49:10 Because it DOES NOT ACTUALLY WORK AS A GENERAL RULE 20:50:18 slereah_, well try another language then? 20:50:42 Well, still, I'd like to understand! 20:51:47 But the problem is, 00 is also k, but 10000 isn't `kk 20:52:02 It's ``ssk (^xy.xyx) 20:52:25 The 1 = ` only works if you use 11100 and 11111000 20:52:49 Although I'm starting to doubt my interpreter, since the "shortest non-terminating program" terminates. 21:35:30 -!- shinkuzin has joined. 21:51:20 -!- RedDak has joined. 22:03:55 -!- ehird has quit (Read error: 113 (No route to host)). 22:04:12 -!- ehird has joined. 22:04:45 -!- ehird has set topic: #esoteric - Extending Tetrationfuck to the reals with magnets, cauliflour and tpyos extended over the reals with tetr. | Logs: http://ircbrowse.com/cdates.html?channel=esoteric | Wiki: http://esolangs.org/wiki/ | The Esoteric File Archive: http://esolangs.org/files/. 22:04:50 what 22:16:41 What what 22:17:01 -!- RedDak has quit ("Killed (NickServ (Comando GHOST usato da DIO))"). 22:17:22 -!- RedDak has joined. 22:22:16 slereah_: In the butt? 22:22:41 Yes, indeed. 22:22:54 Although "Bear Force One" is a contender in gayness. 22:25:22 -!- okopol has joined. 22:29:15 -!- ehird_ has joined. 22:29:18 -!- ehird has quit (Read error: 113 (No route to host)). 22:36:15 -!- Tritonio__ has quit (Remote closed the connection). 22:46:35 -!- shinkuzin has quit (Read error: 113 (No route to host)). 23:01:26 -!- olsner has joined. 23:31:44 -!- timotiis has quit ("leaving"). 23:47:08 -!- jix has quit (Read error: 110 (Connection timed out)). 23:47:16 -!- RedDak has quit (Remote closed the connection).