00:33:05 * bsmntbombdood has ran out of ideas for bsmnt_bot 00:47:42 hmmm.. 00:47:48 what computation class would this be? 00:48:32 http://esolangs.org/wiki/Dupdog 00:49:11 -!- pikhq has joined. 00:55:06 * CakeProphet coughs. 00:55:12 what computational class would this be? 00:55:23 http://esolangs.org/wiki/Dupdog 00:55:28 -!- ShadowHntr has joined. 00:55:33 * CakeProphet repeats for Pikhq :D 00:55:42 * CakeProphet coughs. 00:55:44 what computational class would this be? 00:55:46 http://esolangs.org/wiki/Dupdog 00:55:46 * pikhq sees it 00:55:53 :P 00:55:57 I'm just being annoying. 00:56:41 Hmm. . . 00:56:53 It can't be terribly useful. 00:57:07 I'm not even sure how to go about Hello, World! 00:57:09 I'm not sure of the computational class. . . 00:57:20 Maybe a finite state automaton? 00:59:44 hmm.. 01:00:28 the self-modifying-ness of it makes it more computationally powerful than any finite state automaton I'd imagine in my head. 01:00:37 an FSA is like... a like switch. 01:00:39 er... 01:00:41 light switch. 01:09:51 -!- ihope_ has joined. 01:24:47 CakeProphet: It transorms from state foo to state bar. 01:24:55 That seems to me to be a finite state automaton. 01:25:11 no 01:25:14 that's the interpreter. 01:25:17 the interpreter flips state. 01:25:32 the data is encoded in the source code itself 01:25:38 as its length. 01:25:53 And the difference matters. . . how? 01:27:48 -!- ihope has quit (Read error: 110 (Connection timed out)). 01:28:25 pikhq, because the "state" of the program is its value(s) in memory. 01:28:33 the interpreter... is not its value in memory. 01:28:38 its the... interpreter. 01:28:48 of the symbols. 01:28:54 The interpreter performs the modifications of the state. 01:29:02 This difference doesn't matter. 01:29:03 At. 01:29:04 All. 01:29:28 hmmm... 01:29:36 * CakeProphet tries to understand... but still doesn't see the connection. 01:30:18 If your interpreter oscillated between a Perl and Python interpreter... you wouldn't call that a finite state automaton. 01:31:24 The memory is finite however. 01:31:32 there's only one variable... the length of the source code. 01:31:42 which can be any number... but ultimate has 256 states. 01:32:00 so that would probably make it a finite state automaton. 01:32:02 but not for that reason. 01:33:14 What makes it a FSA is the transition between a finite amount of states. 01:33:53 yes... 256 of them. 01:34:07 Exactly. 01:34:23 not the two interpreters... which isn't even a state... just a means to an end. 01:34:33 Exactly! 01:35:05 if both your interpreters could manipulate and perform any computation... the existence of two interchanging interpreters does NOT make it finite state. 01:35:46 I'm just saying the transitioning interpreters has nothing to do with the finite number of states. 01:36:18 Exactly. 01:38:57 The c preproccesor is nice 01:39:10 #define NOTE(args...) if(debug) {char m[1024]; snprintf(m, 1023, args); fprintf(stderr, "%s:%d, %s: %s\n", __FILE__, __LINE__, __func__, m); } 01:39:46 -!- ryanakca has joined. 01:40:23 where can I find the interpreter for Glass? the link on the wiki is down... 01:45:20 -!- calamari has joined. 01:45:55 ryanakca, There's one right here. :D 01:46:22 lol 01:46:26 !glass {M[m(_o}O! "Hello World!"(_o)o.]} 01:46:31 oh... 01:46:34 !glass {M[m(_o}O! "Hello World!"(_o)o.?]} 01:46:38 ... 01:46:41 !help 01:46:46 no wait.. 01:46:50 EgoBot isn't here. 01:46:55 lol 01:47:05 WHO TOOK EGOBOT 01:47:19 I think the wiki link is just old. . . 01:47:28 * pikhq tries finding Gregor's current version 01:47:34 * CakeProphet likes Glass. :D 01:47:44 and ORK... both Gregor's creations. 01:47:52 Same for EgoBot. 01:48:18 http://esoteric.voxelperfect.net/files/glass/ Ahah! 01:48:55 thanks 01:51:02 EgoBot gone? 01:51:24 They don't call him eGoBot for nothing. 01:51:25 * ihope_ runs 01:51:47 Heheh. 01:51:54 Gregor's down, tooo. Go figure. 01:52:04 heh 01:53:38 -!- ihope_ has changed nick to GregorR. 01:53:44 RAAAR 01:53:50 >_O 01:53:52 heh, he included his bot in with glass :) 01:53:56 @.@ 01:54:33 >_< 01:54:42 I. . . Think that's the wrong source? 01:54:52 Yeah :-P 01:54:54 -!- GregorR has changed nick to ihope. 01:55:10 I seem to know remarkably little about imitating GregorR, actually. 01:56:25 heh 01:56:41 hmm... he even seems to have included instructions on running the bot :) nc -e ./glassIRC.sh irc.freenode.net 6667 ... glassIRC.sh contains: ./glass cache GlassBot GregorR esoteric > GLASSOUT 01:57:47 * ryanakca pets the README 01:59:00 Oh. . . 01:59:18 That's just a script for running Glass via IRC. 01:59:24 -!- calamari has left (?). 01:59:34 -!- EgoBot has joined. 01:59:59 I think he was trying to make an IRC bot in IRC. 02:00:03 ah 02:00:24 Glass, I mean. 02:01:44 -!- EgoBot has changed nick to calamari. 02:02:09 bah.. no fun.. hehe 02:03:24 .. 02:03:31 * CakeProphet hates you. 02:03:35 lol 02:03:46 you'll serve as our egobot for now. 02:03:56 !bf ++++++++++>+++++++<[>. 02:04:02 !glass {M[m(_o}O! "Hello World!"(_o)o.?]} 02:04:03 I can bring in EsoBot.. but it won't run glass ;) 02:05:33 -!- EsoBot has joined. 02:05:39 E!help 02:05:39 yay 02:05:41 Commands: bf, cat, help, kill, ls, ps, quit, unnecessary. 02:05:56 eh... we can write Glass in BF 02:05:59 ... 02:06:04 be my guest 02:06:15 ...yeah 02:06:21 Your own bot, I take it? 02:06:30 CakeProphet: In theory, sure. 02:06:34 yeah.. it inspired the creation of EgoBot 02:06:36 Doesn't mean I'd want to. 02:06:39 calamari: Cool. 02:06:54 you'd need an organized way to partition variables and reference them by name. 02:06:59 which... is a headache to be sure. 02:07:13 not to mention... scopin 02:07:15 g 02:07:23 unless variable names were limited to a single character 02:07:26 But, since BF is Turing complete, it's possible. 02:07:34 Not necessarily easy, but possible. 02:07:37 OH 02:07:41 that makes it much easier 02:07:53 but it would make the memory finite 02:08:03 you jsut have a range for each possible class name... 02:08:06 CakeProphet: Actually, "memory" is in the stack. 02:08:23 The issue is that you'd only have a limited amount of objects out there at a time. 02:08:24 oh yeah.. 02:08:31 limited variable names. 02:08:33 but not limited stack 02:09:00 E!bf help 02:09:12 I don't remember how to run it.. hehe 02:09:21 E!bf +. 02:09:24 I could see it being much more feasible if each class, variable, string, and integer were limited to a byte in size. 02:09:31 byte-sized glass. :D 02:09:33 E!help bf 02:09:34 Commands: bf, cat, help, kill, ls, ps, quit, unnecessary. 02:10:10 E!bf Mismatched [. 02:10:11 Killed 1: : . 02:10:22 It's a quine in some interpreters. ;) 02:10:23 E!bf 1 +++. 02:10:40 E!bf abc +++. 02:10:42 hmm 02:11:39 hahaha 02:11:44 I didn't think of doing that. 02:11:53 just spitting out an error message that triggers an error message. 02:12:28 E!ps 02:12:30 No processes. 02:12:50 E!bf +++++++++++++++++++++++++++++++++++++++++++++++++++++++. 02:12:52 7 02:12:57 okay so it does work 02:15:14 E!bf http://rafb.net/p/PR5bhv59.txt 02:15:17 Hangman started! Type `/msg EsoBot \n' to start a game! 02:15:40 pid is probably 1 02:15:42 E!ps 02:15:44 1:calamari 02:17:11 ______ ___!______ ___! | Type `E! \n' to guess a letter! 02:17:15 oops 02:17:16 hehe 02:17:37 guess you really do need to put the text '\n' 02:17:38 * pikhq laughs at calamari's inefficient high-level language that compiles to Brainfuck. . . 02:17:53 * pikhq gently hugs BFM, as well. . . 02:19:08 E!1 E\n 02:19:25 E_____ ___!E_____ ___! | [] 02:20:03 E!1 S\n 02:20:20 Es____ ___!Es____ ___! | [] 02:20:42 pikhq: running on top of java no less ;) 02:20:51 and no optimizations going on 02:21:17 where can I get a list of all the IRC commands. 02:21:20 the "real" ones. 02:21:35 like PRIVMSG, etc 02:21:39 I should count myself lucky that I do optimization. 02:21:43 rfc1459 or whatever it is 02:21:44 CakeProphet: The IRC RFC. 02:21:54 oh... duh 02:21:59 is it up to date? 02:22:59 how close was I to the actual number? 02:23:03 Hell yes. 02:23:05 calamari: I dunno. 02:23:45 woohoo, got it exactly 02:24:03 Nice. 02:24:14 CakeProphet: going to write a bot? 02:25:16 pretty much. 02:25:23 In glorious Python of course. :P 02:25:38 C++ is too intimidating as of right now. 02:26:01 I find the best way to learn a language is to write something useful in it. . . 02:26:02 and Python has the advantage of being way more dynamic. 02:26:14 yeah well... fuck you and your "learning by doing" 02:26:16 Although yeah, Python would be better for an IRC bot. 02:26:31 it would be way quicker. 02:26:33 to write. 02:26:38 * pikhq would use Tcl, but mostly just because I know Tcl, and know of a premade IRC parser for Tcl. 02:27:01 they could have shortened all the IRC commands to single bit values. 02:27:04 er... byte values 02:27:06 like telnet 02:27:34 That's great and all, but telnet doesn't have "commands" per se. . . 02:28:01 well... you know what I mean. 02:28:23 PRIVMSG could be like... byte value 1, etc 02:28:23 And the idea behind most RFC protocols is to be human-grokable. 02:28:43 PRIVMSG = chr(1) 02:28:47 a human can now grock that. 02:29:05 Could a human run IRC via telnet? 02:29:11 If no, it's not human-grokable. 02:29:21 And the word is "grok", not "grock". 02:29:25 aaah. 02:29:35 I'm not sure WHY you would want to run IRC raw... 02:29:36 but.. 02:29:45 I see what you mean. 02:29:52 It's one of the driving ideas behind most of the RFC protocols. 02:33:59 ...I forgot my newline names. 02:34:04 LF is \n right? 02:34:11 CR is \r I'm pretty sure 02:34:38 yeah... sounds right 02:36:58 -!- ShadowHntr has left (?). 02:41:57 I think so. 02:45:21 so... 02:45:43 I'm assuming freenode is nice and buffers its output until it gets a newline? 02:45:53 if not... oh well... I guess I'll find out. :P 02:46:23 I'm pretty certain it does. . . But I'm not sure. 02:46:31 it kinda would have to. 02:46:36 because all clients send at newlines. 02:46:48 so... there's really no way not to. 02:46:54 unless you do it intentionally. 02:47:13 -!- Sgeo has quit ("Leaving"). 03:05:56 foo 03:08:15 C++ is so uglish 03:08:43 It's purdy. 03:08:47 no 03:09:02 I'm purdy 03:09:11 C++ is uglish 03:19:30 E!1 o\n 03:19:50 Eso_o_ ___!Eso_o_ ___! | [] 03:20:09 E!1 x\n 03:20:15 \as3ff 03:20:23 E!1 b\n 03:20:29 Eso_o_ ___!Eso_o_ ___! |- [x] 03:20:39 That interpreter is slow. 03:20:48 a bit.. yeah 03:20:49 EsoBo_ ___!EsoBo_ ___! |- [x] 03:20:58 E!t\n 03:20:59 Invalid command `t\n'. 03:21:02 Someone right a brainfuck interpreter for bsmnt_bot 03:21:04 E!1 t\n 03:21:15 bsmntbombdood: Call egobfi. 03:21:23 I don't wanna 03:21:27 EsoBot _T_!EsoBot _T_! |- [x] 03:21:31 And what's egobfi? 03:22:09 It's Gregor's Brainfuck interpreter. 03:22:19 Used in Egobot. . . Really fast, rather good. 03:22:41 E!1 03:22:53 it's like 100 files long 03:23:08 E!1 \n 03:23:10 Egobfi is small. . . 03:23:26 520k 03:23:43 E!1 q\n 03:24:08 EsoBot _T_!EsoBot _T_! |-: [xq] 03:24:09 520k uncompressed. . . 03:24:28 E!1 z\n 03:24:29 yeah 03:24:36 pikhq: it's like 300 files 03:24:45 E!1 j\n 03:24:51 EsoBot _T_!EsoBot _T_! |-:( [xqz] 03:25:15 EsoBot _T_!EsoBot _T_! |-:(< [xqzj] 03:25:17 16+5+17 != 300 03:25:42 << 300 03:26:10 Also, most of the source is in the build system. . . 03:26:17 Autoconf and automake take a lot of space. 03:27:17 It's 200k without the build system. 03:27:26 whatever 03:27:41 And it's a really, really fast interpreter. . . 03:27:56 he has weird opcode abreviations 03:29:19 It's optimize() which makes it rather impressive. . . 03:29:52 bsmnt_bot: write your own bf interpreter ;) 03:29:59 yeah yeah yeah 03:30:01 not that hard to do 03:30:09 I'll make mine faster ;) 03:30:18 Good luck. 03:30:39 argh 03:30:44 His code is hard to read 03:30:53 uses global variables to pass code around 03:31:03 someday I need to finish my bf interpreter for the hp 41cx calculator 03:31:27 bsmntbombdood: Well, yeah. . . I am tempted to give him some stylistic improvements. 03:32:02 his design is interesting though 03:32:11 compiling it to bytecode 03:33:04 It is, in essence, a piece of Gregor code. ;) 03:34:31 Is that a good thing? 03:35:36 Depends upon your feelings towards ORK. 03:35:40 -!- bobot has joined. 03:36:01 ORK? 03:37:14 His optimization routine isn't too profound 03:37:26 #malbolge (=<`:9876Z4321UT.-Q+*)M'&%$H"!~}|Bzy?=|{z]KwZY44Eq0/{mlk**hKs_dG5[m_BA{?-Y;;Vb'rR5431M}/.zHGwEDCBA@98\6543W10/.R,+O< 03:37:29 Hello, world. 03:37:31 * pikhq needs to leave 03:37:41 -!- pikhq has quit ("leaving"). 03:37:52 :P 03:38:21 I do like the vm though 03:40:24 optaddto, though, is 03:41:14 #bf ++++++++++[>+++++++>++++++++++>+++>+<<<<-]>++.>+.+++++++..+++.>++.<<+++++++++++++++.>.+++.------.--------.>+. 03:41:14 Hello World! 03:41:39 gotta love PHP 03:43:23 so, optimize() not only optimizes, but compiles too 03:43:38 Problems that sound interesting but are trivial number 42: 03:44:03 HPL(k): hamiltonian path length (k): 03:45:25 "Given a graph with a Hamiltonian path, does it have a Hamiltonian path of at most k steps?" 03:45:28 :-S 03:45:31 * SimonRC goes to bed for a bit. 03:54:59 #me waves 03:54:59 * bobot waves 03:56:55 hmmm 03:57:46 ugh this code is so bad 03:58:57 * bsmntbombdood starts hacking 04:04:17 -!- bobot has quit ("bye bye!"). 04:17:00 -!- GregorR has joined. 04:17:06 E!quit 04:17:08 -!- EsoBot has quit ("requested by calamari"). 04:18:03 Stupid power :-P 04:18:21 your power was out? 04:19:22 Winter storm. 04:19:27 Mostly unexpected. 04:19:51 does it get pretty cold there? 04:21:23 man.. this bug is driving me crazy 04:21:35 No, this kind of weather is totally unheard of. 04:21:50 It's usually sleet and hail when it's that cold. 04:22:34 oh, did you get snow? 04:22:42 Yeah, quite a bit. 04:22:46 cool 04:22:49 -!- CakeProphet has quit (Read error: 113 (No route to host)). 04:23:41 we get snow once maybe every 7-10 years or so 04:24:04 it never lasts long tho 04:24:27 but there is snow on the mountain, so we could go up there if we wanted to 04:26:10 Last time I saw any real snow ... hmmm ... Idonno ... 04:26:16 At least five years ago. 04:27:35 GregorR: sweet 04:27:39 Snow's awesome 04:29:57 ok, i KNOW that this code could be more compact: http://pastebin.ca/319229 04:32:42 That's fairly ingenius. 04:32:47 Could it be more compact? Maybe. 04:32:49 Should it be? No. 04:33:20 That's ingenious? cool! 04:34:21 Mind you, I'm not confident that it's /useful/ ;) 04:34:37 But for serving its fairly un-useful purpose, it's a nice way to do it. 04:35:09 yeah, maybe it's not very useful 04:39:39 GregorR, I'm was reading egobfi 04:39:55 Your use of global variables was so bad, I have to write my own now 04:42:34 And, what does LPO, LPC stand for? 04:46:12 Ha-HAH 04:46:20 I haven't read that code in sooooooooooooooooo long. 04:49:21 ... 04:59:19 LPO = LooP Open, LPC = LooP Close 05:02:00 ooh 05:02:10 I used JMPF and JMPT 05:02:30 "jump if false" and "jump if true" 05:38:55 -!- calamari has quit ("Leaving"). 05:51:42 -!- oklopol has quit (Read error: 110 (Connection timed out)). 06:02:08 -!- ShadowHntr has joined. 06:19:48 -!- wooby has joined. 06:27:11 -!- wooby has quit. 06:28:54 -!- wooby has joined. 06:33:49 -!- oerjan has joined. 06:48:28 -!- ShadowHntr has quit (Client Quit). 07:01:57 -!- Asztal has joined. 07:06:49 IRP allowed? they've stopped now? ;) 07:07:07 Stopped, who? 07:07:43 The people who would find out about IRP on some social bookmarking site and come in here to test it 07:08:13 Ah yes. What _was_ that site, anyhow... 07:10:28 -!- oerjan has quit (Remote closed the connection). 07:10:32 -!- oerjan has joined. 07:19:46 stumbleupon, I think 07:22:44 -!- wooby has quit. 07:26:38 hm, i've never seen those people 07:26:58 -!- wooby has joined. 07:28:32 http://www.stumbleupon.com/url/esoteric.voxelperfect.net/wiki/IRP 07:28:34 there it is 07:34:35 did any stick around? 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 09:08:50 -!- oerjan has quit ("Not sticking around"). 10:26:17 lament: I see that you are a Go player from your exit message on #irp. I am too, but this is not the time to talk about it, alas. 10:26:20 * SimonRC goes 11:48:01 -!- ais523 has joined. 12:02:11 -!- ais523 has set topic: #esoteric - the international hub for esoteric programming language design and deployment - map: http://www.frappr.com/esolang - forum: http://esolangs.org/forum/ - EgoBot: !help (currently down) - wiki: http://esolangs.org/wiki/ - logs: http://tunes.org/~nef/logs/esoteric/ or http://meme.b9.com/cdates.html?channel=esoteric - for brainfuck-specific discussion, go to ##brainfuck - IRP ALLOWED - Pastebin: http://pastebin.ca/. 12:02:30 For those who don't know, it was me who caused EgoBot to crash 12:03:13 I fed it an infinite loop written in Unlambda, and it sent me an infinite number of copies of the letter 'b' in response, until it got thrown out 12:56:08 -!- ihope has quit (Read error: 110 (Connection timed out)). 14:05:11 -!- ais523 has quit ("this quit message is boring"). 15:08:15 -!- proog has joined. 16:11:40 -!- ShadowHntr has joined. 16:17:10 -!- ShadowHntr has quit ("End of line."). 16:22:15 -!- sebbu has joined. 16:33:44 -!- proog has quit ("Chatzilla 0.9.77 [Firefox 2.0.0.1/2006120418]"). 16:44:41 -!- jix__ has joined. 17:05:08 -!- tgwizard has joined. 17:40:51 -!- oerjan has joined. 18:25:04 -!- wooby has changed nick to juan_valdez. 18:25:09 -!- juan_valdez has changed nick to wooby. 18:51:53 -!- digital_me has joined. 18:53:01 -!- jix__ has changed nick to jix. 19:21:39 -!- surye has quit (Remote closed the connection). 19:30:06 * bsmntbombdood reads the ORK wiki page 19:38:32 bsmntbombdood: ORK? 19:39:25 http://esoteric.voxelperfect.net/wiki/ORK 19:46:19 GregorR: gah, why do you write everything in c++ 19:47:54 -!- ShadowHntr has joined. 20:15:13 -!- oerjan has quit ("Despair"). 20:29:33 -!- sebbu2 has joined. 20:40:09 -!- ihope has joined. 20:48:45 -!- sebbu has quit (Read error: 110 (Connection timed out)). 20:48:45 -!- sebbu2 has changed nick to sebbu. 20:53:19 -!- oklopol has joined. 21:34:04 -!- jix has quit ("Bitte waehlen Sie eine Beerdigungnachricht"). 22:06:40 -!- CakeProphet has joined. 22:30:05 I came up with an awesome esolang in math class just now 22:30:36 We have 2 stacks, an empty stack is filled with zeros 22:30:55 each command is one char 22:31:38 'g' = take the logarithm of the top of the stack 22:31:48 '-' = subtract 22:32:05 '<' = push top of stack on to other stak 22:32:15 '>' = push top of other stack onto stack 22:32:26 '1' = push 1 onto stack 22:32:47 [] are the same as brainfuck 22:32:58 IO is the same as brainfuck 22:34:27 hmmm 22:34:37 FuckLogs? 22:35:13 hmm... 22:35:23 I'm not familiar with how to use logs to achieve nifty computations. 22:35:25 but that sounds cool. 22:35:29 double-stack languages are interesting. 22:35:49 * bsmntbombdood implements 22:36:06 I've been dabbling around with Thue-like ideas. 22:36:18 I'm going to be working on this one for a while I think.. 22:36:39 for generating fractalic structures for other languages. 22:37:16 Like Thue... but with a decent ability to do computations and express structures. 22:38:42 and... maybe functional. 22:39:14 * ryanakca scratches his head 22:39:26 yup.. 22:39:28 weird thought. 22:39:30 but.. 22:39:32 fuck you 22:39:59 why thank you CakeProphet :P 22:40:10 -!- Sgeo has joined. 22:40:14 * ryanakca deletes all of CakeProphet's PERL stuff :P 22:40:35 * ryanakca pulls the plug before CakeProphet saves his specification 22:40:41 hehe 22:41:01 Thue? fractalic structures? double-stack? 22:41:26 what Perl stuff. :P 22:45:49 The stuff you set up in cygwin or whatever and that you were all thrilled about? 22:46:07 oh. 22:46:10 :P 22:47:46 :P 22:57:40 ok, my interpreter works, except for looping, because that's hard 22:59:55 what are you making it with? 23:00:00 python 23:00:10 in python nothing is hard! 23:00:17 lol 23:00:24 nothing small :) 23:00:44 hah you'd be so pissed if i made that language before you, bsmntbombdood :) 23:00:52 CakeProphet: what do you say I start bugging oklopol with all my python problems? 23:01:01 noooooo :( 23:01:16 you can't solve python problems 23:01:27 CakeProphet: give you a break... 23:01:37 oklopol: well... you can solve mine... :D 23:02:33 bsmntbombdood, the operations only work on the other stack? 23:02:37 stack 1 23:02:39 right? 23:02:42 yeah 23:02:44 stack 2 is just for storing 23:02:46 k 23:03:21 logarithm in python? 23:03:27 or do i have to do my own? 23:03:36 math.log 23:03:38 use base 2 23:04:28 btw... what's the difference between logarithm & algorithm? 23:04:55 whats the similarity? 23:06:04 s/difference/difference & similarity 23:06:52 there is no similarity 23:07:25 (log base a)(a^x) = x 23:07:30 algorithm you should know 23:08:01 argh 23:08:14 I can't get cpp not to tell me a bunch of stuff I don't want to know 23:08:33 oklopol: (log base a)(a^x) = x doesn't mean anything to me... 23:09:09 how old are you? 23:09:14 that's basic school stuff 23:09:34 oh... 14 23:09:51 well, we learned it today, officially 23:09:56 i'm 17 23:10:07 lol, ok :) 23:10:08 tho it's pretty basic stuff if you program 23:10:13 www.answers.com/logarithm 23:10:17 kk, thanks 23:10:25 programmers know everything. 23:10:45 -!- tgwizard has quit (Read error: 110 (Connection timed out)). 23:10:59 there we go 23:11:08 cpp -P 23:12:43 i might have it now 23:12:57 nah 23:13:26 stack1[len(stack1)-1]=input() 23:13:30 this doesn't work 23:13:43 i never really read about pythons io 23:13:50 how do you do it? 23:14:36 oklopol: ok... know what it is... why should I care about it... what would I use it in? 23:15:01 rarely 23:15:13 bsmntbombdood, floating point? 23:15:17 yes 23:15:39 for input do float(ord(sys.stdin.read())) 23:18:36 i might have it... tho i don't know how it's useful 23:18:52 argh, I can't figure out how to swap 23:18:54 you can only create 1's and zeroes with the log and subtraction :\ 23:19:02 what you use as stack? 23:19:17 a,b=b,a :\ 23:19:24 oklopol: no 23:19:35 I used a list as the stack 23:19:48 And I mean swap the top two values on the stack in this language 23:20:05 stackz[len(stackz)-2],stackz[len(stackz)-1]=stackz[len(stackz)-1],stackz[len(stackz)-2] then? 23:20:13 if stackz is your stack 23:20:22 or am i missing something? 23:20:23 just use list.append and list.pop 23:20:36 for swapping? 23:20:42 no 23:20:52 for the stack 23:20:55 that is not my code, that's the swap :\\ 23:21:21 Not swap inside the interpreter, but swap in the language 23:21:24 i use append, i didn't know about pop :) 23:21:29 ah okay 23:21:43 but, can you give me something to run? 23:21:46 so i can test 23:22:19 "1 1-." should print "0" 23:22:31 or NUL, depending on how you do the output 23:22:37 ryanakca, for a simple and useless example, if you wanna converta number to a spesific base and allocate only what's necessary, you can use logs to calculate the length of the final string :) 23:22:59 >>> runsome("1 1-.") 23:22:59 0 23:22:59 0.0 23:23:01 0 is debug 23:23:46 once again i got it working right away but couldn't use it right and thought it was flawed :D 23:23:53 i mean, up to that part 23:24:15 something hard that can fail actually... i assume you coded something in the math class :) 23:24:36 Do you have [ and ] yet? 23:24:44 ryanakca, An algorithm is just "an ordered procedure of steps that produces a desired outcome" 23:24:45 ....a program. 23:24:48 hmm... 6½ hours till school and 10 english tasks to do and i'm coding again :( 23:24:53 yes 23:24:58 i haves 23:25:02 logarithm is just the inverse of the exponent function. 23:25:08 totally different thing. 23:25:10 s 23:25:29 11g1-- will produce 2 right? 23:25:47 ya 23:25:58 hmm, i don't specify the base 23:26:10 math.log(numz, [baze]) is it? 23:26:22 i just have math.log(...) now 23:26:54 pretty sure 23:26:59 yes 23:27:08 if all else fails just use the help function. 23:27:13 * CakeProphet loves help() 23:27:18 :D 23:27:26 TWO ZERO TWO -- ZERO TWO ZERO TWO -- -- g . 23:27:30 should produce "3.0" 23:27:40 TWO being? 23:27:44 #define ZERO 1 1- 23:27:44 #define TWO 1 1-1-1->1 1-<- 23:27:52 I'm running the code through cpp 23:27:52 -!- fatalis has joined. 23:27:56 UWAAAAAH 23:27:58 ah okay 23:28:01 -!- fatalis has left (?). 23:28:07 your interpreter c++ too? 23:28:10 no 23:28:22 i'd do it faster in c++ prolly but i'd have to make a project :\ 23:28:52 1 1-1-1->1 1-<- === 11g1-- 23:29:19 1g is zero 23:29:51 yes... i know 23:29:54 but, math.log 23:29:59 how to make it 2-base? 23:30:24 1 1g 1 -- == 1 0 1 -- == 1 (-1) - == 1+1 == 2 23:31:17 bsmntbombdood, you must have it if you use it :\ 23:31:24 oh 23:31:28 yeah 23:31:33 you have c++++++++++++++++++++++ 23:31:43 i always think of you as one of the python guys 23:31:47 :) 23:31:50 huh? 23:31:55 math.log 23:31:59 2-base 23:31:59 how 23:32:01 ? 23:32:07 second argument 23:32:25 TypeError: log() takes exactly 1 argument (2 given) 23:32:40 stack1[len(stack1)-1]=math.log(stack1[len(stack1)-1],2) 23:32:45 that's what i have 23:33:05 uuuuh 23:33:09 what python version? 23:33:28 :O 23:33:31 IDLE 0.8... 23:33:35 i have no idea 23:33:36 2.2 23:33:37 i think 23:33:45 that's ooooold 23:33:47 or 2.4 23:33:50 ya :) 23:34:01 do math.log(x)/math.log(2) then 23:34:38 yeah, figured that just now 23:36:23 but 23:36:28 produces 3.0,. yeah 23:36:41 but it's kinda obvious non-looping works 23:37:00 and i'd be pretty suprised if the rest didn't :\ 23:37:23 not my first brainfuck-loop exactly 23:38:16 how'd you do it? 23:38:23 what? 23:38:26 the loop? 23:38:34 i use a counter 23:38:36 yeah 23:38:39 for open brackets 23:38:45 easiest way 23:39:00 ... 23:39:04 -!- RodgerTheGreat has quit (Read error: 104 (Connection reset by peer)). 23:39:12 oh 23:39:13 sorry 23:39:20 that was the worst explanation ever 23:39:45 when i encounter [ i set opens=1, then go right until opens==0 while [ incs, ] decs 23:39:56 then just copypaste for ] 23:40:01 and some random swapping 23:40:35 show me the source 23:40:42 hmm 23:40:45 pastebin? 23:40:56 yeah 23:40:59 hmm 23:41:09 you remember any? :) 23:41:23 pastebin.ca 23:41:24 found 23:41:27 okay :) 23:42:14 http://cpp.sourceforge.net/?show=27733 23:42:28 (pastebin.ca wasn't a link :>) 23:42:54 i hate whitespace, sorry about that 23:43:47 It doesn't do anything 23:43:48 i'm not sure if stack1=stack1[:-1] means cut off last 23:43:53 but i'll change to pop 23:44:38 k now i have it 23:44:42 oh :( 23:44:56 runsome("11g1--11-11g1----11-11g1--11-11g1------g.") 23:45:04 will call it and produce 3 23:45:44 hrm, I think it needs a way to invert a logarithm 23:46:02 1g11g-1-11g1---- is also 3 23:46:26 eh 23:46:27 no 23:46:40 ? 23:47:05 ? 23:47:10 but, it didn't work? 23:47:18 the function 23:47:19 ? 23:47:24 I didn't try 23:47:27 ah okay 23:47:31 but the code for [] doesn't do anything 23:47:56 oh 23:48:00 it changes icode 23:48:12 which is the index of code which is the code string 23:48:28 elif code[icode]==']': 23:48:28 if stack1[len(stack1)-1]!=0: 23:48:28 opens=1 23:48:28 icode-=1 23:48:28 while opens: 23:48:28 if code[icode]=='[': 23:48:30 opens-=1 23:48:32 elif code[icode]==']': 23:48:34 opens+=1 23:48:36 icode-=1 23:48:38 icode+=1 23:48:40 ... 23:48:47 "icode-=" 23:48:50 eh 23:48:52 okay 23:48:56 the copypaste is nice 23:49:18 ? 23:49:36 why does it not do anything? 23:49:45 it changes icode, right? 23:49:58 and that's what a loop does, changes IP, right? 23:50:00 right? 23:50:05 hrm 23:50:22 yeah 23:50:26 yay 23:50:34 I dunno if that works though 23:50:40 maybe not 23:50:50 i've done more that 20 bf-interpreters 23:50:55 tho 23:51:03 most like that 23:51:39 I usually just use class variables. 23:51:46 class lolBF(object): 23:51:50 inc = ">" 23:51:52 dec = "<" 23:51:54 etc 23:52:05 same thing in practice. 23:52:08 less typing though. :P 23:52:19 ? 23:53:23 hmm, looks like that actually works 23:53:24 def makenumber(n): 23:53:24 if n==0: 23:53:24 return "1g" 23:53:24 return "11g"*(n-1)+"1"+"--"*(n-1) 23:53:30 generic algo for numbersa 23:53:32 *-a 23:53:46 hnnn,,,, 23:55:10 hmm... do i do a generic number-> bsmntbombdood-code function or english? 23:55:30 ? 23:55:34 i'm not sure about my math skills tho 23:55:37 ?? 23:56:12 you know, everytime you use a question mark, i check everything i said for 20 lines 23:57:02 hmm... do i do a generic number-> bsmntbombdood-code function or english? 23:57:10 ya 23:57:47 with logarithms it's hard to get the exact number but you get close enought 23:57:48 *-t 23:58:04 *impossible 23:58:13 -!- ShadowHntr has quit ("End of line."). 23:58:43 i don't think you can retrieve a single rational non-integer with logs 23:58:51 dunno 23:58:53 is it mathematically possible? 23:59:00 but, doesn't matter 23:59:34 hmm 23:59:38 looping test... 23:59:39 oh 23:59:43 maybe a loop!