00:00:07 oh, handy 00:00:34 <{^Raven^}> it made it harder because there was too much that could be done 00:01:05 do you know gamedev.net? 00:01:54 <{^Raven^}> not heard of it 00:02:31 oh ok, it's a forum for game developers I thought you might know it because of you interest in developing games :) 00:04:45 <{^Raven^}> i'm a chiefly a utility/tool programmer 00:08:30 <{^Raven^}> calamari: have you had any chance to play with or work on BFBASIC in the last few months? 00:09:26 * calamari is back 00:09:33 and leaving again.. meeting 00:09:43 nope.. and wont have any time, sorry 00:09:45 bbl 00:09:46 -!- calamari has quit ("Leaving"). 00:19:55 -!- fleft has joined. 00:19:59 -!- fleft has quit (Client Quit). 00:28:32 It's sort of stupid that Category pages only show a listing after you added a description 00:51:45 before you add a description there is no page 00:56:13 I improved and added a few things, hopefully for the better :) 01:48:23 -!- kipple has quit (Read error: 104 (Connection reset by peer)). 01:49:03 -!- kipple has joined. 01:53:47 -!- Aardwolf has quit ("Ik zen der is mee weg"). 02:10:31 -!- lament has quit (Read error: 110 (Connection timed out)). 02:30:40 -!- heatsink has joined. 03:18:06 Woohoo! 03:51:55 -!- kipple has quit (Read error: 110 (Connection timed out)). 04:17:07 -!- lament has joined. 04:32:28 -!- heatsink has quit ("Leaving"). 06:23:58 -!- wildhalcyon has quit ("Whoops, There I go"). 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 11:57:10 -!- Aardwolf has joined. 12:17:28 -!- kipple has joined. 12:18:34 aw, yesterday's log is broken 13:06:08 I have no problems viewing yesterday's log 13:12:52 *opens the log in other browser* 13:13:11 aha the old version is cached and refuses to redownload after pressing F5 13:13:19 stupid mozilla :) 13:17:19 Can a language that only has a stack, that can only push and pop (no swap, rolldown, ...) be turing complete? 13:20:32 Aardwolf: if it's equivalent to a pushdown automaton then no 13:21:02 probably not 13:21:42 Aardwolf: see http://en.wikipedia.org/wiki/Pushdown_automaton 13:39:44 it might depend on the specifications; if it has div/mod and unlimited integers it might be TC because the top element of the stack might act as a counter 13:41:02 interesting 13:42:29 appearantly if you have two stacks it can be TC 13:46:57 see also http://www.esolangs.org/wiki/Minsky_machine 13:47:53 "He also describes a variation which is Turing-complete with only one register; this variation requires that the machine has operations to: 13:47:53 * multiply the register by a constant; and 13:47:53 * check to see if it is divisible by a constant, and if so, divide by that constant and affect an alternate state transition. " 13:57:41 Aardwolf: with two stacks you can emulate an unbounded tape, so that is definately sufficient 14:04:22 -!- jix has joined. 14:06:41 moin! 14:20:00 y helo thar! 14:46:27 i'm trying to build a minimalistic turing complete language for writing the smallest ruby interpreter for an esolang ever 14:46:45 hmm maybe my bfx.rb is the smallest ruby esolang interpreter but it's too large 14:46:47 cool 14:48:13 so it has to be even more minimalistic than bf? good luck 14:48:31 I'm designing another image based language, pretty minimalistic but more complex than brainloller 14:48:40 no not more minimalistic than bf 14:48:52 but the implementation in ruby is more minimalistic 14:48:57 ok 14:49:31 I'll call it Mycelium 14:50:54 jix: so, what part of bf takes the most bytes of ruby code to implement? 14:51:24 hmm 14:51:36 you can't really say which part takes most bytes 14:52:35 can I see the ruby code? 14:53:18 $>.sync=m="\0";j=0;eval$<.read.tr(x='^[]+><,.-',"").gsub(/./){%w{while\ m[\ 14:53:18 j]>0 end m[j]+=1 (j+=1)>=m.size&&m<<0 j-=1 m[j]=STDIN.getc||0 putc\ m[j] 14:53:18 m[j]-=1}[x.index($&)-1]+";"}#esoteric@irc.freenode.net Jannis Harder 2005# 14:54:28 dropping IO is of course an easy way to shave off some chars, but a bit cheating :) 14:54:42 IO is not necessary for TC 14:54:47 but i want IO 14:56:47 idea! 15:01:28 bad idea... 15:07:41 oisc-a-like is pretty easy to implement 15:14:30 the cpu is implemented in 70 bytes but IO is missing 15:14:46 oh in 68 byte 15:16:11 in 64 byte 15:19:59 cpu with io in 116 bytes 15:27:22 -!- int-e has joined. 15:38:40 -!- int-e has left (?). 15:38:45 nice :) 15:59:35 -!- nooga has joined. 15:59:37 hi 16:08:22 lo 16:08:51 ge 16:11:26 hmh 16:15:10 i just discovered that i just can't get myself to write a big and useful application 16:15:37 i'm only able to make to spend my time on something useless but funny ;p 16:15:44 like esolangs 16:15:55 hehe. 16:16:40 how big is 'big' in this context? 16:19:46 dunno, CMS maybe 16:23:23 i'm at 149 byte! 16:23:38 huh? is it getting bigger? 16:23:43 yes 16:23:48 my IO was incomlpete 16:23:54 no EOF handling 16:24:19 how far is that from the bf version? 16:24:29 the BF IO is complete 16:24:31 with EOF == 0 16:24:49 I meant how many bytes smaller is this one than the BF one 16:24:54 oh 16:25:11 177 vs 149 16:25:26 149 fits nicely on two sig-lines :) 16:25:53 what are you doing jix 16:25:55 ? 16:26:14 writing a OISC like interpreter with at less bytes as possible 16:27:25 hm 16:31:37 in what language ?;p 16:31:45 ruby 16:31:59 blah 16:32:09 blah? 16:32:14 i dun like it, it reminds me of ADA ;p 16:32:29 i don't know ada but ruby really rules 16:33:00 at first you think that syntax is weird but if you start using it you'll love the syntax 16:34:52 yes 16:34:59 the syntax is werid 16:35:09 i dont like that ends everywhere 16:35:27 i don't like } everywhere 16:36:04 but writing } everywhere is much faster then writing end everywhere 16:36:33 for } i need 2 keys pressed at the same time.. i'm faster pressing 3 keys one after each other 16:38:49 and i'm faster at writing letters than special chars 16:39:39 ¹ó³æñꜿŸ :> 16:39:52 ?? 16:40:06 and ruby has rails! 16:40:17 i'm accustomed with writing special chars ;p 16:40:21 rails? 16:40:29 the super-cool web framewrok 16:40:42 http://www.rubyonrails.com/ 16:41:59 huh 16:42:00 looks cool 16:42:39 but when i seek something to learn ruby i find only stupid manuals ;p 16:42:46 but there are ends everywhere ;) 16:43:01 buy pickaxe 16:43:04 2 16:43:10 or read pickaxe 1 online for free 16:43:16 long time ago i coded in pascal ;p 16:43:35 it was in 1995 ;p 16:43:51 so i know something about ends ;p 16:44:15 but in pascal you write ENDs and not ends, right? 16:44:24 yea 16:44:40 and begins begins and begins... ;p 16:44:51 http://ruby-doc.org/docs/ProgrammingRuby/ << i learned ruby using that 16:45:02 it's for ruby 1.6 but most things are true for 1.8 too 16:45:26 there are begins in ruby too.. for error handling 16:45:31 ill check it 16:46:07 begin\ncode\nrescue RuntimeError\nputs "Failed!"\nend 16:46:37 ? 16:47:17 replace \n with newlines 16:47:31 you could use ; but in ruby you rarely use ; 16:47:46 hm 16:47:48 looks simple 16:47:50 oh and ruby has irb 16:48:00 we are thinking about using ruby here where I work 16:48:10 grim_: cool 16:48:26 I have not had a chance to look at it properly though 16:48:44 one thing i like about ruby is the community 16:49:37 hm, i must check that whole ruby 16:49:57 for i in 1..x statement looks cool 16:50:28 (1..x).each do |i| is more rubysque 16:50:39 and you start to love blocks 16:50:42 * grim_ prefers haskell 16:50:57 haskell is a nice language too 16:51:25 for some things functional languages are the best solution for some things functional and oo languages are good and for some things oo is better 16:51:51 haskell suxx 16:52:14 nooga: writing webframeworks in haskell sucks 16:52:20 all i know about haskell is that it's an old, academic language ;p 16:52:33 object oriented ;p 16:53:01 common misconceptions ;) but I am no great advocate of it 16:53:05 I just find it fun 16:53:22 haskell has some pretty cool things.. like generating a list of ALL prime numbers and print the first 10 16:53:32 that was my first usefull haskell program 16:54:09 lazy evaluation is fun generally 16:54:53 hyh 16:55:14 one of my first haskell programs: http://rafb.net/paste/results/TzQvS266.html 16:55:18 ruby seems very practical anyway 16:55:22 class Song 16:55:23 @@count = 0 16:55:41 why i can't just write: count = 0 16:55:43 ? 16:55:51 nooga: because count is a class-variable 16:55:59 it's a variable shared by all instances of that class 16:56:01 that sucks 16:56:07 a 16:56:17 normal local variables have no special sign in front of them 16:56:45 just global-variables (rarely used) instance variables (called member variables in some other languages) and class variables 16:56:58 sometimes class variables are called singleton variables 16:58:26 * grim_ wonders why 16:58:43 can it not derive that from context? 16:58:43 because singleton classes are classes that have only one instance 16:58:58 and class variables are shared by all instances so they exist only once 16:58:58 um 16:58:59 aha 16:59:58 I'm going to stop now as I don't know enough about the language to discuss it 17:06:31 -!- nooga has quit. 17:10:05 153 bytes 17:11:26 ah.. added a new feature i'd like to have: 161 bytes 17:15:09 157 17:15:14 156 17:19:43 155 17:28:02 ich habe hello world in subskin geschrieben! 17:28:09 arg 17:28:10 wrong lang ^^ 17:28:18 i've written hello world in subskin 17:28:38 i was switching between german and english too fast... 17:29:17 subskin == SUBtract and SKip If Negative 17:30:55 i have cat.subskin too 17:34:33 something's just popped into my head 17:34:47 it appears to be a language where the only data type is the memory reference 17:35:13 and where memory references are also interpreted as instructions 17:35:24 i just have memory references 17:35:36 only memory references 17:36:02 yes, referencing only data from within the source file 17:36:14 and addressing that memory lexically 17:36:25 (lexical memory addresses have been in my head for a while now) 17:37:06 eg [7:12] refers to line 7, word 12 17:37:55 * to dereference (presumably getting another memory reference in return) 17:38:25 * grim_ shakes his head 17:38:48 already it hurts to think about 17:44:51 i removed the sync feature 17:45:46 here is the code: 17:45:46 m=readlines.map{|e|e.hex};loop{m[1]<0||$>< STDIN.getc||256;a,b,c=m[m[0],3];q=(m[c]=m[a]-m[b])<0?6:3;m[0]+=q}rescue 0 17:50:50 <{^Raven^}> grim_: are you a RISC OS user? I saw you mentioned it the other day 17:56:29 {^Raven^}: a lapsed RISC OS user I'm afraid 17:56:43 never upgraded from my A3000 17:57:36 I've played with Red Squirrel a bit for my nostalgia fix 18:51:16 -!- jix has quit ("Bitte waehlen Sie eine Beerdigungnachricht"). 19:03:12 <{^Raven^}> grim_: i still use a RISC PC every day 20:01:05 -!- wildhalcyon has joined. 20:18:10 Im trying to write a 2D procedural object-oriented language. Damn, this is hard work 20:23:30 {^Raven^}: it would be lovely but I can't see myself switching back in the near future 20:55:56 -!- jix has joined. 20:56:59 i'm back 21:09:15 lo jix 21:12:36 * jix is going to write his User:jix and Jannis Harder wiki page 21:21:45 wb jix 21:35:13 who has write access to the file archive? 21:55:09 i'm working at the Subskin wiki pae 21:55:10 +g 22:46:08 -!- jix has quit ("Bitte waehlen Sie eine Beerdigungnachricht"). 22:53:37 * grim_ considers what instruction set to use 22:59:58 -!- kipple has left (?). 23:01:11 -!- kipple has joined. 23:08:44 * grim_ considers bed 23:08:51 bed wins 23:09:23 -!- grim_ has changed nick to grim_bed. 23:22:30 -!- kipple has quit (Read error: 104 (Connection reset by peer)). 23:22:34 -!- kipple has joined.