00:01:16 -!- GregorR-L has quit (Read error: 113 (No route to host)). 01:51:01 -!- CXI has quit (Connection timed out). 02:47:11 -!- Sgeo has quit (Read error: 110 (Connection timed out)). 03:34:39 -!- kipple has quit (Read error: 110 (Connection timed out)). 05:48:52 -!- lirthy has joined. 05:56:02 -!- lirtzy has quit (Read error: 104 (Connection reset by peer)). 06:43:35 -!- calamari has joined. 06:44:41 hi 06:45:33 Mmmmmmm, squid. 06:45:58 Hey calamari, what should I scan with my scanner that I don't really have any use for :P 06:46:19 I have a digital camera, and take all my notes on my tablet PC. 06:46:30 I'm simply too digital to need a scanner. 06:46:34 And yet, there it is. 06:46:36 Beckoning me. 07:25:37 -!- CXI has joined. 07:26:36 * calamari returns 07:26:59 I don't use my scanner very much either 07:27:33 I sometimes scan photos in.. or with my laser printer I use it as a sort of copy machine 07:28:19 Digital camera *shrugs* 07:28:35 All I need is a good /excuse/ XD 07:28:38 exactly 07:29:42 speaking of scans.. forgot to put up the baby pics.. done now tho :) 07:29:52 http://kidsquid.com/images/baby/ 07:30:44 I s'pose that's my cue to go "AWWWWWWW"? 07:30:52 only if you want to 07:31:11 Guess I'm just not much of an awwer :P 07:31:14 you just reminded me to upload them by talking about your scanner 07:31:59 http://lilly.csoft.net/~jeffryj/images/misc/bfcomp.jpg < This is the greatest thing I've ever seen :P 07:32:00 I've been making diagrams of the encryption system 07:32:11 haha 07:32:30 I should send it to you 07:32:57 You should manufacture them and charge $50 a pop ;) 07:33:04 Of course, the memory's pretty limited ... 07:33:09 But you could sell expansion memory. 07:33:11 Just tack it on the end. 07:33:16 or a slide rule 07:33:25 or somethin 07:33:29 yeah 07:33:39 I used that thing exactly once 07:33:57 Heheh 07:33:58 it was a lot of fun making it tho 07:34:13 I still have a vague ambition to make a C-like language that compiles to BF. 07:34:28 I have no idea how it would support recursion though. 07:34:50 you can cheat and do it like I did with "line numbers" 07:34:57 I need to look into that ... 07:35:30 Or alternatively, make your BFASM be a backend. 07:35:32 I still would like to someday write a program that unraveled control code into while loops 07:35:54 bfasm isn't a good candidate, honestly .. its quite implementation dependent 07:36:08 I was a little too generous giving myself 16 bit cells 07:36:15 Hah 07:36:57 I think I've heard of a conversion interpreter for 8-bit bf tho 07:37:15 Yeah, but as if interpreting BF in BF isn't slow enough ... 07:37:19 hehe 07:37:50 I wrote compilers for spaghetti.. I need to do that for linguine 07:38:04 instead of relying on python 07:38:57 all I'm really lacking are the unlimited size integer routines 07:39:40 and maybe some kind of fast hashing for the array 07:40:03 ahh well 07:41:54 I think I'm dropping my game theory class and doing research for the credit instead 07:42:26 it's incredibly uninteresting 07:43:19 In my Algorithms and Complexity class, I did one of the assigned problems waaaaaaaaaay more difficultly than I had to. 07:43:26 Difficultly ... 07:43:39 As it turns out, 2^x would have been an acceptable answer, and easy to prove. 07:44:43 But because I'm insane, I found fibonacci(x) was an acceptable answer, and went through a disgustingly long mathematical interlude to prove that (in the strange structure of this algo), using fibonacci(x) in this place would lead to an O(x) algorithm with a line, the slope of which approaches phi^3. 07:44:54 well, the problem with game theory is that its 99% theory and 1% game 07:44:59 Hah 07:45:13 so it's one proof I couldn't care less about right after another 07:46:49 I'm still in no-electives universe :P 07:49:20 I am in all-electives universe 07:49:50 well, except the networking class, but I wanted to take that anyways 07:50:21 and actually if I graduate this year it wasn't required so I guess it still is elective 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 08:08:41 bbl 08:08:43 -!- calamari has quit ("Leaving"). 08:45:45 -!- lirthy has quit ("you should feel more feel you should take more take"). 09:59:43 -!- CXI has quit (Read error: 110 (Connection timed out)). 13:11:44 -!- lirtzy has joined. 13:52:01 -!- {^Raven^} has joined. 13:52:23 <{^Raven^}> hi everyone 13:53:01 <{^Raven^}> there's a really simple brainfuck programming competion running at the moment 13:53:23 <{^Raven^}> all you have to do is print a string :P 13:53:42 <{^Raven^}> http://programming.webhop.net/ 13:58:58 -!- J|x has joined. 14:10:40 * {^Raven^} 's telly just went boom :(( 14:32:03 -!- kipple has joined. 15:21:29 i have an idea for a new esolang! 15:22:19 -!- J|x has changed nick to jix. 15:22:54 -!- lirthy has joined. 15:31:48 well, tell us about it then :) 15:35:26 -!- lirtzy has quit (Read error: 110 (Connection timed out)). 15:41:22 i can't... i have to write an interpreter and some examples 15:50:20 here is cat: 15:50:21 a/a 15:50:53 replace a with any variable 15:50:56 you want 15:52:04 or use the empty programm 15:52:48 huh? is the empty program cat? 15:52:55 yes 15:53:10 :) 15:54:08 > is cat2 (hello => hheelllloo) 15:56:19 a ruby interpreter would be very slow 15:57:43 i think i'll add a short hand notation for numbers and maybe for strings 15:58:50 %"test\n"/%"true\n"\%"false\n" will output true or false depending wether the input is test\n or not 16:01:01 hmm wait the cat2 example is wrong 16:01:11 x/>x is a working cat2 16:02:09 hmm i just noted a problem 16:03:49 What kind of lang is it? 16:03:56 lazy 16:04:11 lambda calculus style but not lambda calculus 16:04:25 functional 16:07:45 but functions arn't the only first calss type 16:08:04 there are cons functions and nulls 16:08:09 +, 16:08:46 ,c/a,s\@>,%10,%13 should evaluate to 10+13 => 23 16:08:56 .. 16:09:26 %10 is just shorthand for a cons list with 10 nulls (counting the cdr(?) of the last cons) 16:09:35 no not counting it 16:09:57 but that is just my way of representing numbers using my language 16:15:27 i think it's a lot easier to use it for real life problems than the lambda calculus 16:15:44 (without my weird notation) 16:16:18 it's based on the rho calculus but i stopped reading that paper about it after 2 pages... 16:20:38 <> is false <,> is true (again using my representation but the language doesn't force you to use one) 16:21:10 <,<,>> is 2 <,<,<,>>> is 3 ... 16:23:22 <,> is "\x00" and 1 too 16:26:10 ok changed the spec (in my head) again 16:28:27 this scanns the input for the word test and outputs true if it found it and false if it didn't 16:28:28 16:28:53 do that in any other esolang witht this size 16:29:41 argh again add x/ at the begining and x at the end 16:39:37 you can convert any lambda code to my language just replace \ a . b with and every pair of () witha pair of <> 16:41:17 hmm no replace \a.b with <:a/b> 16:49:47 -!- lindi- has quit (Read error: 113 (No route to host)). 16:49:57 -!- lindi- has joined. 16:54:06 jix: Iiiiiinteresting 17:17:27 -!- Sgeo has joined. 18:00:46 -!- GregorR has quit (Remote closed the connection). 18:01:06 -!- GregorR has joined. 18:04:27 -!- SimonRC has quit ("leaving"). 18:12:00 <:c/c\%"Comment here"> 18:12:03 that's a comment 18:12:32 not everywhere but most of the time it is 18:14:10 it's the identity function 18:14:55 -!- CXI has joined. 18:25:00 -!- SimonRC has joined. 18:27:31 * SimonRC goes 18:27:37 -!- GregorR has quit (Remote closed the connection). 18:28:09 -!- GregorR has joined. 18:28:30 GregorR: whats up with your connection? 18:34:43 -!- GregorR has quit (Remote closed the connection). 18:35:13 -!- GregorR has joined. 18:39:09 i'd like to implement my esolang in obj-c 18:39:36 has anyone tried to compile obj-c code on linux or windows? 18:45:12 -!- nooga has joined. 18:50:00 has anyone tried to compile obj-c code on linux or windows? 18:50:01 whoops 18:50:24 ji 18:50:25 :> 18:50:27 hi 18:50:34 moin nooga 18:50:48 i invented a new esolang and i want to write a (fast) interpreter 18:51:15 what is it 18:51:19 giv some samples ! :D 18:51:43 this is cat: 18:52:00 and this is cat2 (abc => aabbcc): x/>x 18:52:39 and this searches for test in the input and prints true if found and false if not: x/x 18:52:59 and it is really functional 18:53:24 and lambda calculus compatible (but different) => turing complete 18:54:44 the string search is really short isn't it? 18:57:07 wait there is an error in the first and third program 18:57:47 i made some changes again 18:59:12 who 18:59:16 but this should really replace every python with ruby x/\s,a,b/b,>x 18:59:21 you understand lambda calculus? 18:59:25 yes of course 18:59:37 and you're 14 years old? 18:59:47 yep 19:01:38 where did u learnt abt it? 19:01:55 wikipedia esolangs.org 19:02:08 #esoteric 19:02:13 -!- EgoBot has quit (Read error: 110 (Connection timed out)). 19:03:24 oh well 19:03:27 teach me 19:04:29 -!- GregorR has quit (Read error: 110 (Connection timed out)). 19:05:03 http://en.wikipedia.org/wiki/Lambda_calculus 19:10:18 OMG 19:10:21 -!- SimonRC has quit ("screen fiddling"). 19:12:02 jix: u r geek^3 19:12:11 my brother is 14 19:12:55 he doesn't know how to implement tree walking 19:13:42 -!- SimonRC has joined. 19:41:06 -!- nooga has quit. 21:11:34 -!- Keymaker has joined. 21:13:47 raven: yeah, i heard about that! 21:13:47 not my bag very much.. 21:13:48 because i don't like the task 21:13:48 and not wanting to write some stuff in other languages 21:13:49 i'll run an old fashioned one-task 8-bit non-wrapping implementation competition once that one is over 21:13:58 i have the idea ready ;) 21:14:09 Keymaker: ?? 21:14:14 hm? 21:14:17 i don't tell the idea yet 21:14:21 what are you talking ybout 21:14:24 ah 21:14:28 wait a second! 21:14:33 * jix is too lazy to read logs 21:14:45 it hasn't been mentioned in logs 21:14:51 i'm trying to find the link.. 21:15:15 dbc told me it via e-mail, i hadn't noticed it since couldn't have accessed the mailing list 21:15:40 or well, in an e-mail about different thing, as a sidenote 21:16:02 http://programming.webhop.net 21:16:19 the competition isn't very interesting 21:16:30 and it hasn't even the implementation defined 21:16:56 the task is to write "This is an example of a BrainFuck program!\n" in brainfuck 21:17:35 and other two are writing something in other languages, but the programs must have something to do with bf 21:17:47 *other two categories 21:17:50 böring 21:17:59 yse 21:18:08 i'm inventing a new esolang atm 21:18:18 ah, i'm just reading the log 21:20:27 well, can't understand much of it :9 21:22:03 i need a simple example of a lambda evaluator 21:22:09 written in a language like c 21:22:32 ..and what is tree walking? 21:23:04 you have a tree (data structure) and you visit all nodes in some order 21:23:13 ah 21:37:17 Class 2 ("Write a compiler/intepreter for BrainFuck programs on a unconventional platform") is a bit too vaguely defined. What's an unconventional platform? 21:38:41 Is my MIPS R4k an unconventional platform? What about the FORTH interpreter in the boot rom of the sparc station? (Well, it's not really forth, just a very very very much forth-like language. Can't remember what Sun calls it.) 21:38:50 s/sparc /sparc/ 21:46:30 (Is that thing even a R4k? Can't remember.) 21:47:41 (R5k. Well, anyway.) 22:46:01 -!- Bart133 has joined. 22:46:22 Please say "Hello, World!" 22:46:23 Please say "Hello, World!" 22:46:46 -!- Bart133 has left (?). 22:46:50 Hello, World! 22:54:59 LEHHO ,DRLWO! 22:55:04 Oops, I did it wrong! 22:58:22 :) 23:51:18 -!- calamari has joined.