00:00:01 time your parsing&loop 00:00:16 no, that isn't how long my interpreter takes to run 00:00:17 anyway 00:00:19 i really don't give a fuck 00:00:26 right now i'm trying to work out why my nesting breaks randomly 00:02:21 hmm 00:02:30 0.116 now 00:02:42 pretty much the same speed as an empty program 00:02:49 let's try a more complex program :D 00:03:12 i can't, seeing as my interpreter keeps claiming unmatched braces 00:03:26 oh 00:03:31 can i see the new one? 00:03:32 i'm fixing it now 00:03:35 and yeah in a minute 00:03:45 WOW 00:03:51 this: 00:03:52 http://www.hevanet.com/cristofd/brainfuck/fib.b 00:03:55 goes unimaginably fast 00:04:17 just now, i ran it and then as soon as i could - i.e. right after hitting enter, i hit Ctrl-C to terminate it 00:04:18 it got up to: 00:04:20 077649278811148299629990130790497978399974693652401690797312244381 00:04:23 er 00:04:26 1284057871006996373036197088663606849580363983512256652839038466984 00:04:41 :| 00:04:47 you have some big variables 00:05:01 or my python prog or what? 00:05:17 hmm 00:05:18 i just checked the whole output -- 00:05:21 and it generated - get this 00:05:24 319!!! fibonacci numbers 00:05:39 in the shortest time i could make it run that my reflexes (which are good) would allow 00:05:52 i don't really find that impressive... fib is O(1), and O(n) if you do one by one 00:06:05 319 additions 00:06:08 how about i leave it going for 10 seconds 00:06:10 and then you tell me 00:06:41 ok, forget that 00:06:46 7.812s :P 00:07:00 ok, in 7.812s it calculated 3190 fibonacci numbers 00:07:06 now are you impressed? at least mildly? ;) 00:08:25 mine doesn't do that right i think 00:08:46 random factoid 00:08:52 using the standard brainfuck text reversal program 00:09:01 if i pipe my interpreter's source code to itself running that program 00:09:07 it takes 0.047s to run 00:09:08 :P 00:10:24 what should the fibonacci program output? 00:10:28 do you start with 1 and 1 as the first two in the array b4 u start the sequence? 00:10:58 oklopol: fibonnaci numbers in decimal, one per line, continuously until halted 00:11:04 http://www.hevanet.com/cristofd/brainfuck/fib.b 00:11:15 hmm 00:11:15 < 00:11:15 >< 00:11:15 >< >< >< >< >< 00:11:15 >< >< >< >< >< >< >< >< ><['<', '<', '+', '>', '+', '>', '-']><['>', '+', '<', '-', ['>', '+', '<', '-', ['>', '+', '<', '-', ['>', '+', '<', '-', ['>', '+', '< 00:11:22 wtf :) 00:11:51 oh 00:11:53 damn 00:12:10 my program doesn't do any output before the program finishes. 00:12:14 lame 00:12:14 :P 00:12:29 speaking of which i should flush stdout on each bit of output, shouldn't i? 00:12:50 how's it lame? 00:13:07 it should output when it gets the output 00:13:24 nah it's nicer this way 00:14:21 oh yeah, school tomorrow -> 00:14:25 no, that is not nicer 00:14:28 that is poitnless 00:14:32 would you like it if python did that? 00:16:32 i generally dislike side-effects in programs where they're not needed 00:16:56 AHA 00:16:58 i fixed my interpreter 00:17:08 tralso, my screen is black now. wonder what happened.... 00:17:13 and wonder what i'm typing 00:19:24 -!- staplegun_ has quit ("ChatZilla 0.9.78.1 [Firefox 2.0.0.8/2007100816]"). 00:21:11 -!- jix has quit (Read error: 110 (Connection timed out)). 00:23:52 -!- ehird1 has quit (Read error: 104 (Connection reset by peer)). 00:24:17 -!- oklopl has joined. 00:25:07 -!- oklopol has quit (Read error: 104 (Connection reset by peer)). 00:25:14 -!- oklopl has changed nick to oklopol. 00:26:01 yay back 00:26:05 now to sleep -> 00:26:31 -!- SEO_DUDE38 has quit (Read error: 104 (Connection reset by peer)). 00:56:52 -!- sebbu2 has quit ("@+"). 01:10:41 -!- Sgeo has quit (Connection timed out). 01:17:38 -!- cmeme has quit (Excess Flood). 01:19:51 -!- cmeme has joined. 01:46:57 -!- SEO_DUDE38 has joined. 02:15:58 -!- staplegun_ has joined. 02:22:37 -!- staplegun_ has quit ("ChatZilla 0.9.78.1 [Firefox 2.0.0.8/2007100816]"). 02:32:42 -!- staplegun_ has joined. 02:32:50 howzit 02:36:42 yupzit 02:36:47 thatzit 02:37:01 ,[] 02:37:13 ? 02:37:21 no, thatzn't 02:37:34 i meenz that i can sii my staple 02:37:36 lol 02:37:44 ic .. 02:38:10 -!- staplegun_ has changed nick to stap1egun. 02:38:15 I think is the first time that someone has been in #esoteric without knowing Brainfuck. 02:38:33 lol 02:39:00 i know brainfuck 02:39:13 How *dare* you not make sense of >,[>,]<[.<]! 02:39:32 my bad 02:40:17 pikhq, actually those are just different types of symbols o_O -.- 02:40:27 Fa1r: It's a valid Brainfuck program. 02:40:39 And a fairly simple example of Brainfuck at that. 02:40:45 so if you are coding bf, the spectator knows it, if not, then maybe not 02:40:54 looks like an input char until char is null then go back and overwrite it 02:41:05 with different chars 02:41:08 untilnull 02:41:22 This is #esoteric. . . And Brainfuck is the canonical esoteric language. 02:41:29 hum... sounds like useful one ^___^ 02:41:32 im aware 02:41:32 stap1egun: Well, yeah. . . Really, it just reverses its input. 02:42:08 -!- stap1egun has changed nick to schad. 02:42:41 hmm 02:43:06 if im writing a 2d esoteric language which uses a stack, would it be easier to write the interpreter in python or c? 02:43:19 sorry, not 2d, grid based 02:43:21 I'm not sure about *easier*. . . 02:43:35 But I'd still do C. 02:43:42 (largely because I don't know Python) 02:43:54 i know c but im a nub 02:44:22 inventing a language is first thing to do as a "nub"? 02:44:29 s/nub/n00b/ 02:44:42 Fa1r: A dc clone would be a fairly simple thing to do as a C n00b. 02:44:44 nah 02:44:45 oh shite, i must have missed something.. 02:44:46 i program 02:44:53 i just dont program c very well 02:45:02 (doing it *right* would be tricky, though. :p) 02:45:12 i made a piet interpreter 02:45:13 c is quite fun, err, shit. 02:45:20 lol 02:45:43 http://pikhq.nonlogic.org/bubble.c 02:45:47 s/n.+b/newbie/ 02:45:50 Bubble sort in obfuscated C. 02:46:17 fuck those ff plugins updating every night.. ;( 02:47:01 lol i know 02:47:05 http://esolangs.org/wiki/PHAWN 02:48:32 sound like something easy to maintain.. 02:48:54 keep your work! switch to any esolang today!! 02:49:04 lol 02:49:07 +s* 02:49:16 I'm reminded of Befunge. 02:49:41 whoa 02:49:47 unixcat is long :> 02:50:12 yea its alot like befunge i guess 02:51:33 i wanted it to look so messy and confusing, like when you open an exe in notepad >_> 02:53:12 Cute; a Windows user. 02:53:56 well, i wud use linux, but i cant get company of heroes to run on it 02:54:05 :'( 02:54:09 also i have to do all my assignments in ... omfg ... vb 02:54:19 not just any vb 02:54:21 vb fucking 6 02:54:27 pink teddies for the bosses ;-A 02:54:34 lol 02:54:58 lucky ive got my last high school exam in a few weeks and i can start my conversion to linux 02:55:03 Where do you go to school, and may I recommend you go to somewhere more prestigious, like the local degree mill? 02:55:13 Ah. High school. 02:55:16 im in australia 02:55:28 Who the fuck still uses VB6? 02:55:29 the it manager is a complete dumb ass 02:55:34 Who the fuck ever uses VB? 02:55:36 That shows. 02:55:55 he says he doesnt want to upgrade to 2005 because its .net and a completely different language 02:56:02 i had to stop my self from loling in front of him 02:56:28 The words "Visual Basic" say that it's a bad choice. 02:56:34 indeed 02:56:46 my teacher couldn't debug this line 02:56:54 textBoxMain.Text = Hello World! 02:57:04 (of course, you must remember that I've been coding since I was 8. . . Programming is. . . Simple.) 02:57:13 i love programming 02:57:54 But are you any good? 02:58:00 lol 02:58:03 i suppose 02:58:11 in the languages ive taken time to learn i guess 02:58:19 How long have you been coding? 02:58:23 hmm 02:58:40 when did dark reign 2 come out? cause i started programming in c code for their mods 02:58:51 i didnt realise it was c at the time though 02:58:57 2000. 02:58:58 and i had to program it in a text file 02:59:05 so since 2000 i guess 02:59:45 * pikhq has been coding for 10 years. :) 02:59:49 :-A 02:59:53 well you do 03:00:12 cool 03:00:27 "and i had to program it in a text file" <- err.. where d'you put it now, then? 03:00:57 the game interpreted it, it was actualy c, but it read structures and functions like it was 03:01:09 ill see if i can find an example 03:01:15 Then I doubt that it's C. 03:01:41 omg have they finally taken the dr2 site down? 03:02:03 archive.org it. 03:02:29 no, it wasnt c it was c style 03:02:35 scripting 03:03:25 gah its all zipped up in zwp 03:04:31 anyhow 03:04:45 i tried leanring c++ with opengl so i can make games 03:04:49 and it was fail 03:05:05 i could get the c++ but game engine architecture i was terrible at 03:05:54 well.. games are kinda "no man's job" 03:05:59 you know what i'm saying 03:06:44 not really 03:08:27 do you guys program in assembly ever/ 03:08:29 ?* 03:08:38 Guilty. 03:08:55 It's amazing how small you can make a "Hello, world!" program. 03:09:11 lol 03:09:33 i want to learn it after i learn how to do something significant in c 03:09:36 could be a while 03:10:01 At last count I was at 76 bytes. . . 03:10:14 shit 03:11:25 well 03:12:24 what kind of stuff do u program? just esoteric languages? 03:12:32 Mostly. 03:13:08 its way more interesting than trying to code an fps in c++ or ... game maker for that matter 03:14:58 Compilers are fun to write, too. 03:14:58 programming in esoteric? well.. the point is you never get anything usable with esoteric 03:15:17 not in esoteric 03:15:20 I beg to differ. 03:15:24 writing an interpreter 03:15:27 they're mostly made of showoff and fun 03:15:28 or likewise 03:15:40 * pikhq has written a game in Brainfuck. 03:15:49 wow 03:15:52 i want to see that 03:15:53 Granted, I cheated, via a language I developed that targets Brainfuck. . . 03:15:54 oh jesus 03:16:10 http://pikhq.nonlogic.org/game.b IIRC. 03:16:23 hmm browsing these config files 5 years later tells me i didnt have any clue what the c prorgamming language was 03:16:41 game = usable, console game = fun. right 03:16:46 .. there you have it. 03:16:56 lol 03:17:13 Try googling "Lost Kingdom" for something more astounding. 03:17:45 in australia? 03:17:57 It's a larger game in Brainfuck. 03:18:48 holy piss 03:19:23 holy fucking christ 03:19:26 weel 03:20:01 now that was a _surprise_... japanese && anime && based on cards && echo "Hell yeah! ;E" 03:22:05 well 03:23:18 なぜ？ 03:23:28 なな. 03:23:42 http://jonripley.com/i-fiction/games/LostKingdomBF.html 03:23:59 yea 03:24:00 なな？なぜそれと言ったか？ 03:24:02 i downloaded it 03:24:06 2.5 mb source code 03:28:02 visual c++ can compile c code cant it? 03:28:26 I dunno. 03:28:33 Try Cygwin or Mingw. 03:30:03 20:23 03:33:05 Yeah. And? 03:33:42 and, 20:33 03:37:31 http://www.java2s.com/Code/C/Data-Structure-Algorithm/StackinC.htm is that an ok way to handle a stack? or wud there be a better way? 03:38:40 Eeew. 03:38:54 I recommend implementing it via a linked list. 03:39:00 http://pikhq.nonlogic.org/dc.c.tar.bz2 03:40:26 damn 03:41:00 stack.c and stack.h are a decent stack implementation. 03:46:23 cool 03:46:35 ill have a go 03:51:38 -!- schad has quit ("ChatZilla 0.9.78.1 [Firefox 2.0.0.8/2007100816]"). 05:13:56 -!- immibis has joined. 05:14:33 "....using Microsofts malicious software removal tool." <--- Microsoft's software removal tool is malicious? 05:15:52 * immibis is not surprised 05:19:20 -!- immibis has quit ("Hi, I'm a quit message virus. Please replace your old line with this line and help me take over the world of IRC. When the chi"). 05:20:18 oh snap, somebody applied a restriction enzyme to immibis' quit message virus! 06:33:39 -!- bartw has quit (Connection timed out). 06:39:04 -!- SEO_DUDE38 has quit (Read error: 104 (Connection reset by peer)). 06:42:34 -!- SEO_DUDE82 has joined. 07:34:58 -!- schad has joined. 07:35:26 howzit 07:59:58 -!- schad_ has joined. 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 08:13:48 -!- schad__ has joined. 08:14:20 -!- schad__ has changed nick to staplegun. 08:18:15 -!- schad has quit (Read error: 110 (Connection timed out)). 08:27:41 -!- staplegun has quit ("ChatZilla 0.9.78.1 [Firefox 2.0.0.8/2007100816]"). 08:29:10 -!- staplegun has joined. 08:29:27 anyone there? 08:32:38 -!- schad_ has quit (Read error: 110 (Connection timed out)). 08:35:12 t 08:45:38 -!- staplegun has quit ("ChatZilla 0.9.78.1 [Firefox 2.0.0.8/2007100816]"). 10:38:48 -!- staplegun has joined. 10:39:13 hello 10:39:39 i think the reason that virus isn't spreading is that it's not self-modifying 10:40:53 pikhq: i win with 11 years! 10:41:20 (unless this is also about coding capabilities, in which case you most likely beat me ;)) 10:41:45 let's just hope oerjan doesn't see this 10:51:41 what kind of virus? 10:54:37 -!- jix has joined. 10:59:55 errr immibis' quit message virus 11:38:15 opinions here, since i'm not that good at designing gui:s anyone but me would enjoy, i'm making a program for drawing elecrical circuits, how should it behave when the window is resized? 11:39:36 i mean, should it have a fixed amount of divisions x- and y-wise, so that no matter what the size is, the grid would have the same amount of points; or should i have it just draw less of the circuit so that the distance betwen two points is fixed? 11:41:28 *between 11:51:02 imo it should just get bigger 11:51:06 i mena 11:51:08 it should scale 11:51:12 if u stretch the window 11:52:18 i already implemented the latter one 11:52:20 :) 11:52:33 oh well lol 11:52:42 it looks kinda nice, i'll add something to inc/dec the gridsize if necessary. 11:53:01 it hindsight the latter would be better for me, i have a 1920x1200 display lol 11:53:15 omg cool :P 11:53:32 too bad it cant help my python code .... 11:54:01 you mean the size of your window won't compensate for your lack of skills? 11:54:05 err 11:54:07 screen. 11:54:37 yea 11:54:40 exactly 11:54:44 heh 11:54:57 nah not lack of skills 11:55:03 absence of ability 11:55:20 yeah 11:55:56 oh my god 11:56:03 ? 11:56:04 magnets are unbelievably cool. 11:56:14 wot r u coding this in? 11:56:19 C 11:56:24 coool 11:56:29 what r u rendering it with? 11:56:32 trying to do without the ++ 11:56:35 you don't wanna know ;;) 11:56:58 mm 11:57:11 everyone tries to make me do ++ style casting, when c is far superior 11:58:30 haha, magnets xD 11:58:36 i should get back to coding... 11:58:57 weeee they hop so merrily 11:59:07 hehe 11:59:16 u toking about magnets irl? or the ones ur programming? 11:59:37 hehe real ones! 12:00:07 coool 12:00:11 the circuit thing is very primitive, it just knows basic logic ports, wires and err transmitters 12:00:30 is it a modelling tool? or just something for fun 12:00:34 "fun" 12:01:26 we are using this thing called TINA pro at school for this, it kinda sucks as it's just a trial version 12:01:47 ah 12:01:58 so i'm basically making this to be able to save my models 12:02:10 ic 12:02:12 i dunno if i'll add anything that actually let's you do anything complicated 12:02:44 make sure u add some easter eggs 12:03:27 i'll add one just for you 12:03:33 solid 12:03:48 do u ever code python? 12:03:56 yeah 12:04:00 more than anything else 12:04:50 try: data = source[py][px] + data 12:04:52 except: break 12:04:53 finally: px -= 1 12:04:55 no matter what, px will decrease by one right? even if the exception causes a break? (its in a while loop) 12:05:12 i think so. 12:05:18 i'm pretty sure so. 12:05:18 sweeet ..... 12:05:33 that saves me having to write a flag 12:05:35 =D 12:05:47 hehe 12:06:26 omfg .... 12:06:38 thats why it wasnt working i never actually set the variable to the users input ... 12:09:24 -!- jix has quit (Nick collision from services.). 12:09:34 -!- jix has joined. 12:17:32 -!- tokigun_ has joined. 12:17:32 -!- tokigun has quit (Read error: 104 (Connection reset by peer)). 12:18:31 oh snap 12:42:28 -!- staplegun has quit ("ChatZilla 0.9.78.1 [Firefox 2.0.0.8/2007100816]"). 13:34:48 -!- staplegun has joined. 13:35:21 woot i got fib 10000 to run on my esolang 13:35:40 cwl 13:35:55 $1>2><>+>%_ 13:35:57 <<>>{^ _ 13:35:58 ~ <10000 13:36:00 # 13:36:02 source code lol 13:36:24 how can i time it in python? 13:38:53 import time 13:39:06 time.clock() gives a number representing the current time 13:39:09 in seconds 13:39:21 i guess it's that unix timestamp or whaddyacallit 13:43:53 cool 13:46:16 hmph, i've really gotten lazy having used python for so long :P 13:46:46 printed fibonacci numbers up to 1,500,520,536,206,896,083,277 in 0.0194 seconds 13:46:48 :) 13:46:49 in python, everything takes a second to do, and never has bugs 13:47:01 lol i love python, i started learning it today 13:47:03 in c, i actually have to think about the details, and still i get bugs :| 13:47:22 and ive pretty much finished writing my esolang interpreter 13:47:26 what does that tell you :P 13:47:30 heh 13:48:22 now, if i can get hello world workin 13:50:18 can i see the spec? 13:50:25 i recall there was one 13:50:29 rrright? 13:51:12 staplegun: what the f is that? 13:51:53 spec? 13:52:48 http://esolangs.org/wiki/PHAWN 13:52:53 still in real early design 14:08:31 gah 14:08:39 soo messy 14:16:13 FINALLY 14:16:15 HELLO WORLD 14:16:20 ! 14:16:23 Huh? 14:17:02 ? 14:17:04 * SimonRC is crating a forthlike language, due to boredom 14:17:15 forthlike 14:17:17 ay 14:17:58 * SimonRC goes back to work 14:24:18 someone linked me to a site earlier where you could post code blocks and it would highlight in the language you specify 14:24:30 like a read only browser based syntax highlighter 14:26:01 meh, found a worth substitute 14:29:16 -!- Figs has joined. 14:29:29 Hello! 14:29:40 http://blog.wolfram.com/2007/10/the_prize_is_won_the_simplest.html <-- you guys see this yet? 14:39:23 ok 14:40:25 I thought it was kind of interesting since the solver was described as having a "background in mathematics and esoteric programming languages" :P 14:40:31 (the math aside) 14:40:57 lol 14:41:22 im happy cus i finally got a working version of my interpreter 14:41:33 made me think -- "Hey, I know some esoteric programmers... wait a sec, I wonder if this is one of them..." 14:41:49 yay :D 14:41:53 what interpreter? 14:42:11 revise: an interpreter for what? 14:46:47 um 14:46:52 my language 14:46:56 phawn 14:47:05 ah 14:47:10 what does it look like? 14:47:23 _ < 14:47:24 _ $33>100>_ 114^ 14:47:26 _<72<101<<108>^ 14:47:27 _. /^/<111>\87\>\32\> 14:47:29 &{{{{{{{{{{{{# 14:47:30 , Output: Hello World 14:47:32 or 14:47:39 :P 14:47:47 better yet 14:47:48 http://esolangs.org/wiki/PHAWN 14:48:11 cool 14:48:18 http://www.springerlink.com/content/uxuc20mnurg4qjug/ <-- DNA = UTM? Nifty. 14:49:02 I don't think I'd understand the chapter though :( 14:49:16 sounds intruguing 14:49:35 we need a DNA Esolang! ... assuming no one has done it yet 14:49:50 but ill stick to my ascii .. took me hours just to write my hello world example ... 14:49:59 hehe :) 14:50:24 it is actually most influenced by piet lol 14:50:50 hmm, imagine that it'd give you 4 'base pairs' like ZXCV or something, and you'd write lines like 14:50:53 ZX 14:50:55 CV 14:50:56 VC 14:50:58 XZ 14:51:14 i know the syntax 14:51:16 forget the name 14:51:23 ? 14:51:42 pairs of three would count as coding-units... 14:51:46 err... sets of three 14:51:50 pairs of three = wtf? :P 14:51:54 lol 14:52:21 yes... my pair of boots is actually three shoes... O.o 14:52:29 hmm 14:52:29 hehe 14:52:33 but imagine! 14:52:45 you could code "virtual Proteins" 14:53:05 lol 14:53:08 that would end up running in parallel... 14:53:43 they would "contort" to various mathematical shapes based on Figsics 14:53:53 or fishsticks 14:53:56 :P 14:54:18 I think I have invented a mental nightamre 14:54:20 *nightmare 14:54:28 tell me about it 14:54:28 too bad I can't write it 14:54:39 oh crap 14:54:41 it's 7 am 14:54:43 >.> 14:54:47 I've been up all night again 14:54:52 whee. 14:55:02 well, at least there's not school tomorrow 14:55:07 or today... 14:55:25 lol 14:55:29 doing wot .... 14:55:30 California fires 14:55:39 school got cancelled. 14:56:30 hey 14:56:36 if I got two turing machines together... 14:56:39 awesome 14:56:48 so that each time I need to look up a state 14:56:55 it launches another machine... 14:57:10 is that more complicated than a single turing machine? 14:57:20 i think uve been awake too long :D 14:57:25 yes :P 14:57:30 maybe 14:57:43 16 hours? 14:57:59 yeah, I should be going to bed, in theory 14:58:03 damn ye paper! 14:58:09 ... I've been trying to write this paper 14:58:11 since I got up 14:58:16 ...wtf am I doing here? :P 14:58:20 lol 14:58:22 *brain random* 14:58:24 wots it on? 14:58:35 summary of a sci. am. article 14:58:39 2 pages 14:58:48 (the argument in the article, not the article itself) 14:58:57 and 2 pages = amt for me to write 14:59:01 (the article itself is longer) 14:59:02 lol 14:59:05 (durh :P) 14:59:43 seriously though, can I have a turing machine with an infinite number of states? O.o 14:59:55 i suppose 14:59:55 does that even make sense? O.o 15:00:01 depends how many turing machines u can handle 15:00:02 my brain must be broken 15:05:44 -!- jix has quit (Read error: 104 (Connection reset by peer)). 15:08:56 huh 15:09:02 China + Japan are in a space race? 15:12:40 -!- jix has joined. 15:13:03 http://blog.wolfram.com/2007/10/the_prize_is_won_the_simplest.html?lid=title 15:13:26 *points up* 15:13:45 :D 15:13:56 still cool though 15:14:25 * Figs prods bsmntbombdood and says "Hi!" 15:14:49 oh heh 15:15:04 hmm 15:15:08 wtf, it smells like smoke 15:15:12 brb 15:23:12 -!- ehird` has joined. 15:26:40 im goin to bed 15:26:42 night all 15:26:52 wow, you're still here? 15:26:54 from yesterday? 15:29:02 nah 15:29:07 not the whole time 15:29:17 but i was up for a while working on stuff 15:29:21 anyways cyas 15:29:23 -!- staplegun has quit ("ChatZilla 0.9.78.1 [Firefox 2.0.0.8/2007100816]"). 15:29:43 my bf interp only kind of works =( 15:30:33 b ack 15:30:41 oh 15:30:45 missed him by a minute 15:30:50 hi ehird` 15:30:54 * Figs is back 15:31:04 hi i'm perfecting my bf interpreter 15:31:09 kewl 15:31:17 I wrote a BF interpreter a while back... 15:31:25 hopefully it should run The Craziest BF Program Ever (the Lost Kingdom text adventure) smoothly 15:31:29 I forgot about that :P 15:31:33 but right now it just spews out "Hangup" and dies 15:31:33 yay 15:31:39 oh :( 15:31:45 oh? 15:31:50 I wonder if my program would work 15:31:52 hmm 15:31:54 doubt it :P 15:31:59 how long is the program? 15:32:12 2 megabytes 15:32:15 of bf code 15:32:16 yeah 15:32:18 it won't fit 15:32:19 (it's compiled from basic) 15:32:30 bloat! 15:32:31 j/k 15:32:34 heh 15:32:53 I only wrote my program to accept up to 9999 15:32:57 so that won't fit :P 15:33:08 mine dynamically resizes all of its storages 15:33:09 :D 15:33:27 IIRC, mine you type in by hand at the prompt, so... 15:33:31 :P 15:33:34 if you have enough memory you can store up to MAX_UINT (maximum unsigned int value) elements in each 15:33:41 kewl :) 15:33:51 On a 32bit system that's 4,294,967,295 elements in each array 15:33:51 (why with a k? I don't know.) 15:33:55 ;) 15:34:02 past that it'll just die but i doubt i have to worry ;) 15:34:15 if it used 64-bit ints? Then 18,446,744,073,709,551,615 15:34:41 ;) 15:34:47 well, in theory... 15:34:53 you could load it from the file 15:35:03 yeah 15:35:04 and only work with a small subset of the bytes ... 15:35:05 of course 15:35:08 but eh 15:35:21 you will need shitloads of RAM anyway to run a program of that size ;) 15:35:24 and cpu 15:35:29 (it pre-parses brackets) 15:35:57 also, mine can save and load state 15:36:00 "No one will ever need more than 640K of RAM" (BIll Gates) 15:36:10 SIGSUSP (aka ^Z) asks for a file name and then saves a dump to it 15:36:17 [did I get that right?] 15:36:25 you can then reload the dump (and the source file if you did not include it with the dump) and it'll resume from there 15:36:34 this is because i am going to write a Forth system in brainfuck 15:36:37 so that will be how i save images 15:36:39 :D 15:36:46 yikes. 15:37:26 I need to finish that fucking parser system... 15:37:27 :P 15:37:33 or move to a better language 15:37:36 maybe D 15:37:51 does D have operator overloading? 15:37:54 yes 15:37:54 but 15:38:03 C is the best for writing interpreters for esolangs, most of the time 15:38:09 since speed is good when your language itself is fscking slow 15:38:23 this isn't for an eso-lang... 15:38:23 my debug output is great 15:38:24 LOL EXPANDO 15:38:24 lol yeh 15:38:24 LOL EXPANDO 15:38:24 lol yeh 15:38:24 Hangup 15:38:27 (at this point :) 15:39:00 it was me ol' general parser system 15:39:18 the one that looks like 15:39:20 x >> y >> z 15:39:32 it ain't CS, I don't think 15:39:35 Just CF... 15:39:48 since I don't allow x Y z = A >> B >> C... 15:40:00 just Y = A >> B >> C 15:40:33 sadly, I don't know how to handle errors in ambiguous grammars :( 15:41:16 or hell 15:41:24 how to even get around some of the issues of ambiguity 15:41:38 okay, my problem is this line: memset(new + *current, 0, try); 15:41:44 when resizing the code array to 2000 elements 15:41:58 *current is the previous size of the array, try is - AHA 15:42:03 i need try - *current 15:42:04 :-) 15:42:09 it's segfaulting because it's overflowing the memory 15:42:14 yay :) 15:42:17 :( 15:42:28 memory overflow shouldn't get a :) from me 15:42:29 :P 15:42:47 well... it is marginally better now 15:42:51 as in, it gets a bit further ;) 15:42:54 but i have a segfault LATER... 15:42:58 gdb time 15:43:10 whoo! 15:43:11 :( 15:43:19 Program received signal SIGSEGV, Segmentation fault. 15:43:19 0x00401702 in main (argc=2, argv=0x662008) at bf.c:131 15:43:19 131brackets[code_ptr] = stack[stack_ptr]; 15:43:26 crazy 15:43:35 yow 15:43:37 sigh, CF ambiguity is undecidable 15:43:44 what fun 15:43:44 just_read = 6723392 15:43:54 that's a lot of just read 15:43:54 :P 15:44:01 lol 15:44:08 i'm using fread 15:44:08 what is RIS? 15:44:09 :/ 15:44:14 RIS? 15:44:16 yeah 15:44:25 it says "Exprot this chapter as RIS|Text" 15:44:29 *export 15:44:43 no idea 15:45:13 wait, wtf, it's almost 8 am?! 15:45:42 oh no now you're doing to leave 15:45:43 :P 15:46:16 no, I'm going to have to figure out how to write my essay real fast 15:46:35 I was supposed to turn it in almost 15 hours ago... 15:46:35 :( maybe it's my crazy casting 15:46:48 i have this: expand_array((unsigned char **)&stack, &stack_size); 15:46:50 and similar things 15:46:57 @.@ 15:47:06 hehe, I've had my head in java for too long at this point 15:47:15 yeah well i don't want to duplicate my expand_array code 15:47:17 it's quite clever 15:47:18 :-) 15:47:22 brainwashing, I say... 15:47:35 Ooh! http://www.springerlink.com/content/fp7p38r0333p1441/fulltext.pdf 15:48:04 i just added this debug message 15:48:05 printf("I'm in ur ptrs, not segfaulting\n"); 15:48:07 do i go to hell now? 15:48:12 I should just give all failure points for error, shouldn't I? 15:48:15 (as a list...) 15:48:24 lollllll 15:48:25 I'm in ur ptrs, not segfaulting 15:48:25 Segmentation fault (core dumped) 15:48:39 nice 15:48:49 :P 15:49:24 damn my segfault isn't even in expand_array 15:50:26 :( 15:50:28 aww 15:50:33 step through? 15:50:48 i'm not stepping through, it reads like half the file before dying 15:50:55 i don't have ten years :P 15:51:00 lol 15:51:09 make it catch in a special place 15:51:45 (I'm an evil masochistic bastard, I guess, but *cough* setjmp + goto */cough*) 15:51:55 brackets[code_ptr] = stack[stack_ptr]; 15:51:55 brackets[stack[stack_ptr]] = code_ptr; 15:52:00 the segfault happens on these two 15:52:21 you be askin' da wrong guy 15:52:23 :P 15:52:29 i'm just talking to no-one 15:52:29 hehe 15:52:31 I left my pointers at the door 15:52:37 hacking away in urxvt and gvim 15:52:37 when I started Java-class :P 15:52:44 ... on windows, because i'm stuck on a windows box right now 15:52:46 hooray for cygwin 15:52:49 haha :D 15:52:50 i get my nice gvim 15:53:01 I hate gvim 15:53:02 with my nice X interface 15:53:07 not any of that lame windows gvim 15:53:15 this stuff anti-aliases text properly 15:53:16 ;) 15:53:29 I've had to use it on Red Hat for CS... 15:53:38 and I hate not being able to highlight shit 15:53:46 and use what I'm used to doing in a text editor 15:53:48 :P 15:54:10 I started using something else. 15:54:11 you can highlight shit 15:54:15 i guess you just don't know vim 15:54:19 no, I don't :P 15:54:20 but even gvim, lets you use even the mouse to highlight 15:54:30 not my gvim 15:54:32 it lets you scroll with a scroll-wheel... it's practically notepad except it's modal 15:54:48 i use a lot of its notepaddy features actually 15:54:48 maybe the way they have it configured here is weird 15:54:58 i am guilty of selecting text with the mouse and pressing d 15:55:00 I am a noob at it though :P 15:55:03 i also use the scrollbar a lot 15:55:12 but i like vim's commands, so 15:55:15 dd 15:55:16 ;) 15:55:17 :P 15:55:48 I started using a different program 15:55:52 I forget the name 15:56:09 emacs? :P 15:56:10 naw 15:56:11 nano? 15:56:13 no 15:56:17 pine? 15:56:18 aka nano 15:56:20 ;) 15:56:28 I think it was something generic like 'text' 15:56:34 memory != good 15:57:20 I'll play with it later and babble again another day 15:57:27 when school starts again 15:57:32 OK: 15:57:32 123579 VS 160000 15:57:32 123577 VS 160000 15:57:32 Segmentation fault (core dumped) 15:57:35 (closed all week due to fire) 15:57:41 both of the first two numbers are lesser than the latter 15:57:44 so why am i getting a segfault 15:57:56 what pointer? 15:57:58 and what cmp? 15:58:04 printf("OK: \n"); 15:58:04 printf("%i VS %i\n", code_ptr, brackets_size); 15:58:04 printf("%i VS %i\n", stack[stack_ptr], brackets_size); 15:58:04 brackets[code_ptr] = stack[stack_ptr]; 15:58:04 brackets[stack[stack_ptr]] = code_ptr; 15:58:05 printf("worked\n"); 15:58:33 since they're both within the boundries of brackets-size as you can see in my previous paste 15:58:39 why on earth would it segfault on those brackets lines 15:58:52 (x_ptr is an int index of an array, always) 15:59:04 x_size is the size of the x array 15:59:26 *shrug* 15:59:52 too much recursion? 16:00:01 i don't recurse, in the whole thing 16:00:03 and gdb tells me that 16:00:04 brackets[code_ptr] = stack[stack_ptr]; 16:00:05 then not that :P 16:00:07 is the line at fault 16:00:17 gdb always gives me BS 16:00:17 aha 16:00:18 wtf 16:00:20 look at this: 16:00:25 wait no 16:00:27 and hm 16:00:27 maybe 16:00:33 but the debug output is right 16:00:36 it prints the ones before 16:00:38 and not the ones after 16:00:45 but code_ptr gmm 16:00:59 no idea 16:02:54 hehe, in my interpreter 16:02:59 in 1.563s 16:03:06 +[>+] has already forced the interpreter 16:03:09 to resize to 30720000 cells 16:03:22 (and it resizes to current*2 by default -- so that's pretty impressive) 16:03:52 (it also happens to be extremely fast at generating fibonacci numbers) 16:04:10 whoo! :P 16:04:54 touch. touch. touch touch. touch touch touch. touch touch touch touch touch... 16:05:05 hehe 16:05:10 XKCD >:D 16:05:15 might get a bit hard after the first few.. 16:05:24 touch touch touch... (ten years) ...touch touch touch touch ... 16:05:30 :P 16:10:18 give me a program to test my interp with 16:11:01 +++[>++++++++++++<-]>. 16:11:11 !bf +++[>++++++++++++<-]>. 16:11:15 $ 16:11:47 it runs in 0.015 seconds, and outputs $ 16:11:53 yay 16:12:01 +[] ? 16:12:18 it runs in infinity seconds and outputs nothing 16:12:18 :P 16:12:21 whoo! 16:12:26 did the computer tell you that? :P 16:12:26 but, it just sits there, obviously 16:12:33 haha 16:12:34 ;) 16:12:34 yes it did 16:12:39 i have a halting problem solver built in 16:12:45 rofl 16:12:56 oh, +[] also consumes 99% cpu 16:12:58 not 100%, though 16:12:59 +[>>+<<] 16:13:02 it goes from 94%-99% 16:13:08 but it doesn't lag the sytsem, heh 16:13:30 heh, I should write that like 16:13:35 +[>>+<<]+ 16:13:37 it looks cooler 16:13:46 that one also takes up insane amounts of cpu 16:13:48 but hangs there memory-wise 16:13:52 :P 16:13:53 as, of course, it wraps from 255 to 0 16:14:04 of course, it will use 99% cpu most of the time 16:14:06 that's expected 16:14:17 +[>+<->>++<->]+ 16:14:26 if you're not getting input or bottlenecked by output, you want to execute the instructions as fast as possible 16:14:27 and mine does 16:14:33 so, i think that's desired behaviour 16:14:37 :) 16:14:38 ok 16:14:44 also, it uses a little over 1mb of ram by default it seems 16:14:46 remember, this is windows 16:14:52 so that overhead will be MUCH LESS on other os 16:14:58 ,[>,]<[.<] 16:15:00 i'll try +[>+<->>++<->]+ 16:15:07 and i tried the reverse program a while ago 16:15:11 :P 16:15:13 it runs basically as fast as the equivilant c program 16:15:16 kewl 16:15:23 most trivial programs do 16:15:33 it doesn't even optimize 16:15:55 []_[] >> -[-]-_-[-] << []_[] 16:16:06 it just pre-parses the brackets so that [ and ] are just a conditional followed by setting the code pointer to the entry in the array 16:16:19 also +[>+<->>++<->]+ just biggifies the array, heh 16:16:24 :P 16:16:26 that's the idea 16:16:28 it grows very fast 16:16:28 sorta 16:16:45 does that other program work? 16:16:50 wait 16:16:51 (are you doing wrap-around?) 16:16:55 +[>+<->>++<->]+, when run for 10.250s 16:17:01 resizes the array to 122880000 16:17:06 whoo! :P 16:17:11 (it'll use a lot less though, just over 61440000) 16:17:15 since, of course, it resizes to double 16:17:37 mine does 0-255 wrap around yes 16:17:38 and infinite tape 16:17:40 i'll run []_[] >> -[-]-_-[-] << []_[] 16:17:53 it just terminates 16:17:55 immediately 16:17:57 :P 16:17:59 it should 16:18:04 but 16:18:06 well, in 0.016s 16:18:08 :P 16:18:10 but it's immediate to my eyes ;) 16:18:11 yeah 16:18:22 it's basically a little slower than a nop program haha 16:18:38 d(O_O)b <[Hello Friggen World] 16:18:59 I wrote a poem in a java app before 16:19:05 i can tell you without even testing that one 16:19:10 it will just execute with "error: tape underflow" 16:19:15 :P 16:19:15 ok 16:19:17 since you can't go < from element 0 16:19:20 ah 16:19:23 ;) 16:19:39 >-< ... >-< 16:19:48 (in old-style implementations it'd wrap around to the last cell, but of course with an "infinite tape" (well, dynamically resized, but from BF it is percieved as infinite, it makes no sense) 16:20:01 expanding universe! 16:20:02 :P 16:20:03 that runs in the same time as your nop program 16:20:10 i.e. 0.016s 16:20:14 it should give 3 nulls as outputs 16:20:17 and produces three null bytes 16:20:21 obviously 16:21:18 "error: unmatched [" is a kimian quine in my implementation 16:21:18 :-) 16:21:38 "error: unmatched ] at 17" is a vaguely more interesting one 16:22:27 (lim x->0 d/dx x^2+2x+1) [>+++<]>. 16:22:54 runs forever, seemingly 16:23:08 ah. dur 16:23:08 by the way 16:23:11 what platform are you on? 16:23:12 me = stupid with that. 16:23:18 windoze 16:23:21 please say linux, please say linux, please say linux so you can run c2bf 16:23:22 DAMNIT 16:23:31 :( 16:23:36 i wanted to try hello world 16:23:57 hey 16:24:03 do you know anything about writing a forth? 16:24:15 nope 16:24:22 damn 16:24:43 do you want to read http://www.annexia.org/_file/jonesforth.s.txt and http://www.annexia.org/_file/jonesforth.f.txt as a combined implementation-tutorial and then help me implement BrainForth? ;) 16:24:49 ++++++++++[>+++++++>++++++++++>+++>+<<<<-]>++.>+.+++++++..+++.>++.<<+++++++++++++++.>.+++.------.--------.>+.>. 16:25:01 If I had time :( 16:25:10 aww ok :P 16:25:10 sadly, I am procrastinating already 16:25:12 it's short though 16:25:13 haha 16:25:19 and that's just a hello world 16:25:22 yes 16:25:28 I thought you wanted a hello world? 16:25:39 (I pulled it out of wikipedia magic land) 16:26:11 ,----------[----------------------.,----------] 16:26:18 hello world /from c2bf/ 16:28:32 http://www.inteldaily.com/?c=173&a=3993 beware, disturbing! 16:30:12 hah 16:30:36 http://ineedawriter.com/blog/2007/10/contextual-advertising-mistakes.html 16:32:41 argh :P 16:32:45 "shake and bake" 16:32:49 what a terrible thing to say 16:32:54 [about california] 16:33:14 -- apparently there was a minor earthquake earlier ;P 16:33:25 haha 16:33:37 http://farm3.static.flickr.com/2400/1634346479_af8e068ebd.jpg?v=0 16:33:44 yes :P 16:33:51 I like the one at the end 16:33:53 about the ads 16:34:09 also the black mcdonald's ad 16:34:10 :P 16:34:44 i love the last video one 16:34:52 didn't watch it 16:35:02 :p 16:50:29 -!- SEO_DUDE82 has quit (Read error: 104 (Connection reset by peer)). 16:58:45 -!- SEO_DUDE82 has joined. 16:59:32 http://www.flickr.com/photos/dcreeves2000/139184796/ 17:08:47 * ehird` is writing a simple stack-based-language-to-BF compiler 17:09:01 it's really simple 17:09:10 you just do: 17:09:25 name call call call ; another call call call 17:09:26 etc 17:09:41 i.e. first word is the new word to define's name, after that what words to call 17:09:46 ; terminates the definition and starts again 17:09:49 the last word defined is called 17:17:32 http://pastie.caboo.se/pastes/93052 i have never heard of this language before 17:17:35 is it TC? i don't think so 17:19:52 I am not sure 17:20:12 certainly i doubt you can write a bf interpreter in it 17:20:17 but, what about a tag machine? 17:20:19 that's the simplest 17:20:27 wait, it doesn't have any control structure 17:20:28 heh 17:20:35 can you even test for equality? 17:20:45 it doesn't matter, there's no control structure 17:20:47 and yeah you can 17:20:48 with XOR 17:20:52 it has xor? 17:20:53 XOR is not-equal 17:20:57 ^ is xor in ruby 17:21:02 this is ruby? 17:21:13 that interpreter is in ruby, yes... 17:21:17 I thought it was python :P 17:21:20 but I don't use either 17:21:22 so :P 17:21:25 does python have "end"? ;) 17:21:29 I don't know 17:21:31 no 17:21:33 I don't use either :P 17:21:35 python's blocks are indentation based 17:21:37 instead of: 17:21:46 if blah: 17:21:46 stuff 17:21:46 end 17:21:47 it's: 17:21:48 if blah 17:21:50 stuff 17:21:55 heh 17:22:40 can you add or subtract? 17:22:53 XOR is add without carry... 17:23:03 can you branch? :P 17:23:09 nope, i told you that already 17:23:11 heh 17:23:20 you MIGHT be able to simulate a tag machine in it, rhough 17:23:35 could you push pop the stack to simulate branching? 17:23:40 oh wait 17:23:43 :P 17:23:48 nevermind 17:23:57 *Engage brain before talking* 17:24:09 http://www.contextfreeart.org/ i am going to play around with this 17:24:19 a logo that produces better quality images, and can recurse /infinitely/? 17:24:38 seriously. it can recurse to infinite depth as long as the drawings small to -infinity in size 17:24:45 which is... very often 17:25:49 -!- Sgeo has joined. 17:33:13 http://eightsolid.com/wp-content/uploads/2007/10/18.jpg 17:35:13 -!- bsmntbom1dood has joined. 17:46:26 -!- bsmntbombdood has quit (Read error: 110 (Connection timed out)). 17:52:02 -!- oerjan has joined. 17:53:54 -!- sebbu has joined. 17:58:29 bbl 17:58:30 -!- Figs has left (?). 18:00:12 * ehird` ponders whether you can draw a sierpinski triangle in cfdg 18:29:15 oklopol: ABANDON ALL HOPE 18:29:27 o.O 18:30:11 let's just hope oerjan doesn't see this 18:32:54 g 18:32:55 *ah 18:44:08 test 18:44:39 -!- bsmntbom1dood has changed nick to bsmntbombdood. 18:47:24 oerjan: i fixed my BF interpreter :-) 18:47:35 now it works on EVERYTHING aprat from that 2mb text adventure (and i'm trying to fix tha) 18:47:52 oklopol: i fixed my sex organs :-) 18:49:40 bsmntbombdood: i am sure he is interested 18:55:16 oh yes he is 19:05:36 -!- importantshock has joined. 19:12:57 -!- importantshock has quit ("Meh."). 19:13:48 -!- jix has quit ("scheiß usb kack ding etwas irgndwie"). 19:19:14 -!- jix has joined. 19:28:34 -!- jix has quit (Read error: 113 (No route to host)). 19:30:01 -!- jix has joined. 19:40:09 woot, my brainfuck interp no longer crashes on LostKng.b 19:40:16 however, it lags forever 19:40:20 so something is taking Too Long 19:40:52 ah, it's just slow execution 19:40:53 heh 19:41:19 -!- Tritonio has joined. 19:41:41 -!- Tritonio has quit (Connection reset by peer). 19:41:57 -!- Tritonio has joined. 19:51:25 -!- jix has quit (Read error: 104 (Connection reset by peer)). 19:51:49 -!- SEO_DUDE82 has quit (Remote closed the connection). 20:02:53 !bf16 -. 20:02:55 20:02:58 !bf32 -. 20:02:59 20:03:49 -!- EgoBot has quit (Excess Flood). 20:08:55 god damn 20:09:11 the other guy in this room is loudly stuffing his face with popcorn and grunting 20:36:17 -!- SEO_DUDE82 has joined. 20:37:22 -!- jix has joined. 20:38:15 bsmntbombdood: pix 20:38:27 o 20:38:27 o 20:38:56 pix of his fixed sex organs, or the other guy? 20:39:51 surprise me 20:47:16 lawl 20:48:12 oklopol: pix of my genitals are illegal :( 20:49:12 i would get charged with the production of child pornography and child molestation 20:49:39 and transporting child pornography across state lines 20:49:54 Hmmmm ........ I wonder if you can be charged for making child pornography of yourself :P 20:50:00 GregorR: you can 20:50:07 GregorR: case law proves it 20:50:09 Fascinating. 20:50:55 :| 20:50:58 that's sick 20:51:07 given the minimum sentences for those i would go to jail for at least 15 years or so on conviction 20:51:47 it would be the ultimate irony when they charged me as an adult 20:51:52 that would also be a crime in my part 20:51:53 hehe 20:51:59 yep 20:52:01 but that i can understand 20:52:13 well, not really. 20:52:20 but a bit easier. 20:52:37 looking isn't all that dangerous in my opinion. 20:53:51 does .fi have extradition shit with .us? 20:54:26 i don't know 20:54:44 i just learned that word. 20:55:44 teach me a word! 20:55:52 :O 20:56:00 i think you know more words than me 20:56:11 that doesn't mean i know all the words that you know 20:56:21 and you know more words than mean, considering all languages 20:56:40 possibly. 20:57:36 i should use my irc logs to find how many words i us 20:57:43 heh 20:57:50 hrm 20:57:54 whats the awk to do that? 20:58:48 i prolly at least have known a lot of english words you don't, since i used to browse the dictionary quite a lot, but i can't really conjure anything up just like that :< 20:59:42 s/a lot/a few 20:59:49 like 0.1 20:59:54 in hexadecimal 21:00:05 (also negative) 21:00:09 pizza -> 21:02:00 bsmntbombdood: i don't know, but it's "" in WordUsage 21:02:31 it's like 10 lines of python 21:03:37 no 21:03:42 i must do it with awk 21:03:48 actually it's one line of python 21:03:57 doubt that :| 21:04:06 well, if you have a string of all the text he's said. 21:04:38 then i'd say it's 3 21:05:07 um no 21:05:16 it's something like: 21:06:15 [a[i] for i in range(len(a)) if not a[i] in a[i+1:]] 21:06:16 hehe 21:06:18 you're right 21:06:29 dict((w, said.count(w)) for w in dict(map(lambda i: (i,1),said.split(" "))).keys()) 21:06:29 somehow i insisted on using a dict 21:06:40 you need a dict 21:06:42 returns {word: count, ...} for each word, with no duplicates 21:06:47 bsmntbombdood: no 21:06:49 or else it takes quadratic time 21:06:50 (that is what the crazy lambda trick is for) 21:06:54 -!- bartw has joined. 21:07:00 you don't *need* it 21:07:04 assuming said is "i said this line and then this line abc abc def" 21:07:08 for linear time you do 21:07:09 i.e. a string of all his text 21:08:15 -!- INTERCAL has joined. 21:09:08 sorted((w, said.count(w)) for w in dict(map(lambda i: (i,1),said.split(" "))).keys()) <-- sorted list version 21:09:11 most-used first 21:09:14 ;) 21:09:34 count don't word of course 21:09:35 oops 21:09:37 *work 21:09:37 i forgot about set() 21:09:45 import Data.Set; main = interact $ show . size . fromList . words 21:09:52 why doesn't count work 21:09:53 it works fine 21:09:58 (you knew i couldn't resist, right?) 21:10:00 >>> said="i said this and that" 21:10:00 >>> dict([(w, said.count(w)) for w in dict(map(lambda i: (i,1),said.split(" "))).keys()]) 21:10:00 {'i': 3, 'this': 1, 'and': 1, 'said': 1, 'that': 1} 21:10:07 pretty trivially 21:10:15 hm, wtf 21:10:20 oh, i see 21:10:23 err isn't that obvious 21:10:24 yeah 21:10:29 wait 21:10:32 i'll improve it incrementally 21:10:47 dict((w, said.count(w)) for w in set(said.split(" "))) 21:11:09 er 21:11:29 yep 21:11:30 that works 21:11:50 again, replace "dict" with "sorted" for a sorted list of (word, usage) 21:11:51 except you lose the linearity 21:11:57 whatever 21:11:59 it's fast enough 21:12:37 mine is better 21:12:41 !! 21:13:58 oklotalk!! set split Saidstuff 21:15:25 ListLang! {for \e, said, [e,count], \unique} 21:15:30 why not {freq Saidstuff}, adding built-in functions is easy when you don't have an implementation 21:15:32 (note: has no implementation, yet) 21:27:17 @src RealFrac 21:27:27 oh noes, he's back! 21:27:32 /query lambdabot 21:27:36 ;P 21:27:50 and ehird` is back misunderstanding 21:27:55 presumably 21:28:00 explain? :P 21:28:53 afaic recall, i have not yet done that while trying to use lambdabot for anything other than demonstrating on #haskell... 21:29:26 ok, what were you doing then? :P 21:29:55 er, did i use too many negatives? 21:32:25 i was demonstrating on #haskell 21:32:32 ah 21:32:32 :P 21:37:31 NEAR-IMPOSSIBLE TASK #341: implementing an associative array in brainfuck 21:38:24 depends 21:38:31 if you do char->char, it's pretty trivial 21:38:40 or any fixed size 21:38:49 string->char or string->string 21:38:56 latter more impressive, former more realistic 21:39:03 hmm... kay 21:39:06 ah 21:39:54 I think C2BF is probably sufficient to make that right now :P 21:39:58 if you can do string->(string, char) you're well on your way to a markov chain in BF ;) 21:40:15 GregorR: i can't run c2bf on any platform i run 21:40:18 string->string=string->char 21:40:22 --- 21:40:23 eh sorry 21:40:25 ehird`: Whaaaaaaaaaaa? 21:40:25 (windows right now, unfortunately. OS X most of the time) 21:40:30 string->string=string->(string,char) 21:40:35 it segfaults on OS X :< 21:40:40 Awesometude! 21:40:47 thanks :p 21:40:54 oklopol: good point 21:40:54 hey 21:41:08 i think that could actually be possible 21:41:10 very slow but possibl 21:41:10 e 21:41:34 but of course no way to get a random number in brainfuck (you can get a 'random-looking' number using cellular automata and the like but it's the same on each run) 21:41:41 so it'd spew the same things out over and over 21:41:59 err 21:42:04 unless... you hashed up all of the data in the hash table (and presumably other used memory) and used it as a seed each time it's updated... 21:42:08 i don't think it matters if the hash table is predictable... 21:42:14 oklopol: no, for a markov chain 21:42:17 ah. 21:43:26 -!- RedDak has joined. 21:47:25 oklopol: what text editor do you use, by the way? 21:47:26 i use vim 21:48:33 vi / wordpad 21:49:01 old vi? 21:49:03 leet ;) 21:49:20 you actually run nvi? 21:49:29 or vim called as vi 21:50:04 wordpad is almost perfect, occasionally it changes fonts at random, and it doesn't have an option to level text on both ends, but otherwise 21:50:09 vi i've just used a few times. 21:50:21 wordpad doesn't do much 21:50:24 like, say, syntax highlighting. 21:50:35 http://files.method-missing.org/pics/pic3.jpg << which wire is connected the wrong way 21:50:46 the blue one 21:50:46 in fact, that's all i really need in a text editor 21:51:02 oklopol: which blue one? 21:51:04 good search+replace algorithm, reasonable navigation/insertation/deletion keys, and syntax highlihgting 21:51:07 i don't use auto-indent 21:51:11 jix: the one in the middle 21:51:25 hmm my sound laggs 21:51:33 auto-indent is nice except it usually fails. 21:52:09 but at least i want auto-indent the next line the same as the current line 21:52:33 -!- Sgeo_ has joined. 21:52:54 yeah, but now sleep -> 21:53:01 i slept all day yesterday 21:53:35 i don't even auto-indent the next line 21:53:37 meh, i'm weird 21:53:48 but my programs rarely go above 3 amounts of indentation 21:53:51 and basically never go over 4 21:55:09 -!- Sgeo has quit (Connection timed out). 21:55:50 Um.. I hard-reset out of Linux into Windows, tried playing a game in Windows, safe-reset, went back into Linux... and that nick was still alive? 21:56:11 It is VERY odd to see your own nick disappear when you're not expecting it 22:00:08 I've seen a message of mine arrive from one nick after I'd already been disconnected, logged in as another nick and started conversing with it. 22:02:34 just as long as it doesn't converse back :D 22:13:03 lawl 22:13:13 my dad's exhaust pipe fell off 22:13:22 i fixed it with my shoelace >_< 22:13:51 just as long as it wasn't the brakes 22:14:04 -!- INTERCAL has quit. 22:16:30 one interesting thing related to text-generation bots is that some of them can imitate other users 22:16:36 i always wondered what a conversation with myself would be like 22:17:03 just as long as they don't imitate me 22:17:24 i should make one that imitates whoever talks to it :-) 22:26:27 markoooooooooov chain 22:27:43 i'm coding one now incidentally 22:30:03 -!- Tritonio has quit (Remote closed the connection). 22:37:24 -!- staplegun has joined. 22:37:50 howzit 22:39:41 -!- oerjan has quit ("Good night"). 22:41:18 -!- jix has quit ("CommandQ"). 22:45:12 -!- RedDak has quit (Remote closed the connection). 22:53:47 ... 22:55:10 sheesh 22:55:13 some people have lives 22:56:37 lol 22:57:30 Lies. 22:57:34 LIES 22:57:45 @#$>>+_---_+ 22:58:13 That's either a smiley representing an extremely deformed man, or a very strange bit of code in a language I don't recognize. 22:58:34 it's runnable until it reches the _ 22:59:00 but all it will do is push 0 on the stack twice, add it and then terminate from error 23:00:28 python must be the greatest language ever 23:08:41 -!- sebbu has quit ("@+"). 23:10:58 ... 23:12:23 back 23:14:02 who wants to help me get linux set up :D 23:14:13 do it yourself 23:14:36 just what i expect from a linux community ... 23:14:48 since when is this a linux community 23:14:54 since i said so 23:30:29 This is the esolang community. 23:30:40 And setting up linux is not that difficult, oddly enough. 23:31:13 I hate to brag, but I first did it when I was 12. . . 23:31:40 pikhq: i first did it earlier than you did! ;) 23:31:43 haha 23:31:53 "youngest person to set up linux" competition, in #esoteric, time: now 23:31:56 ehird`: But which distro was it? 23:32:07 pikhq: i cannot recall right now, i'll give it a think 23:32:09 but i was about 10 23:32:11 Slackware for me. 23:32:19 ok, you probably win 23:32:24 i can barely set up slackware even now, haha 23:34:14 I was running it in the womb. 23:34:19 I had to port it to human cells first. 23:34:23 GregorR: tricky 23:34:32 lots of hieisenbugs i'd imagine 23:34:37 err, typo 23:35:05 Well, it's probabilistic, yes, but redundancy allows the probabilities to be >99.99999% in all cases. 23:35:15 did you distribute it? 23:35:44 I couldn't get a consistent Internet connection, and now the plans are lost :( 23:36:02 it's a bitch to get a trans-womb internet connection installed 23:36:06 i should know, i've tried 23:36:59 jesus christ 23:37:26 I think NetBSD runs on it, but I haven't seen a Linux port, no. 23:37:43 -!- staplegun has quit ("ChatZilla 0.9.78.1 [Firefox 2.0.0.8/2007100816]"). 23:37:48 lawl 23:37:55 he used chatspeak anyway, no big loss 23:37:57 ;) 23:38:08 Apparently the suggestion of ChristBSD was offensive :P 23:38:19 hahaha 23:38:26 It's not ChristBSD, though. . . 23:38:29 SoulBSD. 23:38:34 A bit more general. ;) 23:38:36 GodBSD 23:38:46 "It Runs The Universe..." (literally) 23:39:02 Not quite. 23:39:05 gosh imagine the race conditions in universe 23:39:15 The Universe is in Lisp. 23:39:30 no, it was hacked together in perl 23:39:49 [i would say something to the effect of, "points for the reference" but everyone here probably reads xkcd religiously, so.] 23:52:30 "of course, you are not the world. worlds sure are not the world."