03:03:28 -!- cpressey has quit (Remote closed the connection). 03:03:41 -!- cpressey has joined. 03:19:35 -!- Taaus has quit (niven.freenode.net irc.freenode.net). 03:19:35 -!- lindi- has quit (niven.freenode.net irc.freenode.net). 03:21:05 -!- lindi- has joined. 03:21:05 -!- Taaus has joined. 03:21:44 -!- cpressey has quit (niven.freenode.net irc.freenode.net). 03:21:44 -!- fizzie has quit (niven.freenode.net irc.freenode.net). 03:21:53 -!- kipple has quit (Read error: 110 (Connection timed out)). 03:21:59 -!- cpressey has joined. 03:21:59 -!- fizzie has joined. 04:26:18 -!- heatsink has joined. 06:14:51 -!- heatsink has quit ("Leaving"). 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 12:38:14 -!- kipple has joined. 14:27:14 -!- puzzlet has joined. 14:28:06 -!- tokigun has joined. 14:53:58 -!- tokigun has quit ("leaving"). 17:18:41 -!- Keymaker has joined. 17:18:44 yo 17:21:17 why does nothing cool happen? 17:32:01 I've been idly writing a befunge compiler thing, but it still generates buggy code and has issues with self-modification. Trying to fix it enough that it'd run my utm.bef. 17:32:18 hmm 17:32:18 hmm 17:32:31 what makes it hard to write a befunge compiler? 17:32:39 (writing a compiler would be way too hard for me!) 17:32:51 but is there something different with befunge? 17:33:52 There's the amount of self-modification in the language, so you basically have to include a compiler with the compiled program to recompile affected parts on the 'put' instruction. 17:34:14 hmm 17:34:16 indeed 17:34:58 This is written in Java, I was going to target Java-bytecode so I could include the same compiler classes with the "executable". Currently I just have (for testing) a _really_ simple C-generating backend, which doesn't handle self-modification at all. 17:36:22 And, as said, creates buggey code. Probably one of my optimization passes. I do some stack-content-analysis to avoid writing conditional jumps that never get taken, and to do constant-folding. 17:37:34 hmmmm.. sounds confuseing 17:39:03 fizzie: hmm, can you please try to develop it with gcc so that there's a better chance that the final version will also work with gcc? ;) 17:40:07 Ergh. It uses Java-1.5 generics, you know. 17:41:51 fizzie: rright, and that's not even merged to gcc cvs HEAD yet... 17:45:25 Hmmmmn. My befunge source is buggy, too. 17:48:05 fis@colin:~$ ./out 17:48:05 abA!6!0!a!1!A!R!0!b!5!b!R!1!a!1!a!R!1!b!2!b!R!2!a!2!a!R!2!A!3!A!L!2!!!3!!!L!3!a!4!A!L!4!a!4!a!L!4!b!4!b!L!4!A!0!A!R!5!A!7!A!L!5!!!7!!!L!6!aabaa! 17:48:08 accept. 17:48:11 fis@colin:~$ ./out 17:48:13 abA!6!0!a!1!A!R!0!b!5!b!R!1!a!1!a!R!1!b!2!b!R!2!a!2!a!R!2!A!3!A!L!2!!!3!!!L!3!a!4!A!L!4!a!4!a!L!4!b!4!b!L!4!A!0!A!R!5!A!7!A!L!5!!!7!!!L!6!aabaaa! 17:48:16 reject. 17:48:19 Yay. :) 17:48:32 ?? 17:49:27 See http://gehennom.org/~fis/utm.html for the program I was running, and http://gehennom.org/~fis/out.c.txt for the generated code. :p 17:50:19 ah, this -- although i have no idea how it works 17:50:25 :) 17:50:54 must go to eat, will be back soon, at least for a while 18:59:45 Is that Universal Turing Machine? 19:00:48 And, what a viewer 19:09:01 well, couldn't come back earlier 19:09:26 could someone point me a link that would describe what is universal turing machine and how does it work? 19:12:07 Well, in befunge-93 it has a maximum tape length of ~52, maximum alphabet size of 17 and maximum state limit of 8, so it's not much of an universal turing machine. With an unlimited playfield it would be, though. 19:14:01 link..? 19:14:45 Well, wikipedia's http://en.wikipedia.org/wiki/Turing_machine page has a description. 19:15:23 Actually I'm not sure that could be called an universal turing machine, since it's not a turing machine, it's a befunge program. It can still simulate any given Turing machine, though. 19:18:37 thanks 19:18:44 i try to understand some bits 19:18:45 :) 19:52:42 too confusing.. 19:52:56 probably should read something Turing Machines for Dummies 19:52:59 or something 20:05:40 rggh. 20:29:45 Take an 'introduction to computer science' course. :) (I probably wouldn't have chosen a universal turing machine as a befunge test-program if I weren't going to t-79.148 now.) 20:30:19 well, can't do that for a year.. 20:30:22 or something 20:30:36 i'm not at university yet, too bad 20:31:06 but thanks for the tip 20:56:37 -!- Keymaker has quit (Read error: 110 (Connection timed out)). 23:49:30 -!- rollman has joined.