< 1151543368 0 :bsmntbombdood!unknown@unknown.invalid QUIT :Remote closed the connection < 1151543592 0 :bsmntbombdood!n=gavin@unaffiliated/bsmntbombdood JOIN :#esoteric < 1151553063 0 :coder_!n=coder___@user-12l2j6u.cable.mindspring.com JOIN :#esoteric < 1151555428 0 :Arrogant!i=Scott@49.orlando-06-08rs.fl.dial-access.att.net JOIN :#esoteric < 1151556685 0 :Sgeo!unknown@unknown.invalid QUIT :"Ex-Chat" < 1151557740 0 :CXI!unknown@unknown.invalid QUIT :Read error: 110 (Connection timed out) < 1151558192 0 :coder_!unknown@unknown.invalid QUIT :"Leaving" < 1151559897 0 :bsmntbombdood_!n=gavin@unaffiliated/bsmntbombdood JOIN :#esoteric < 1151559989 0 :bsmntbombdood_!unknown@unknown.invalid QUIT :Remote closed the connection < 1151559998 0 :bsmntbombdood_!n=gavin@unaffiliated/bsmntbombdood JOIN :#esoteric < 1151560571 0 :CXI!i=Sanity@dialup-37.89.221.203.acc50-kent-syd.comindico.com.au JOIN :#esoteric < 1151560627 0 :bsmntbombdood!unknown@unknown.invalid QUIT :Connection timed out < 1151562771 0 :Arrogant!unknown@unknown.invalid QUIT :"Leaving" < 1151567999 0 :clog!unknown@unknown.invalid QUIT :ended < 1151568000 0 :clog!unknown@unknown.invalid JOIN :#esoteric < 1151572195 0 :CXI!unknown@unknown.invalid QUIT :Read error: 104 (Connection reset by peer) < 1151572221 0 :CXI!i=Sanity@dialup-37.89.221.203.acc50-kent-syd.comindico.com.au JOIN :#esoteric < 1151572302 0 :bsmntbombdood_!unknown@unknown.invalid QUIT :"all your basment are belong to bsmntbombdood" < 1151575906 0 :sekhmet!unknown@unknown.invalid QUIT :Read error: 110 (Connection timed out) < 1151576260 0 :sekhmet!n=pez@ppp-70-226-150-129.dsl.mdsnwi.ameritech.net JOIN :#esoteric < 1151579787 0 :Keymaker!n=nobody@wire74.adsl.netsonic.fi JOIN :#esoteric < 1151585132 0 :tgwizard!n=tgwizard@c-e43ee155.178-1-64736c10.cust.bredbandsbolaget.se JOIN :#esoteric < 1151591374 0 :CXI!unknown@unknown.invalid QUIT :"If you're reading this, it's probably xchat's fault." < 1151592825 0 :Keymaker!unknown@unknown.invalid PART #esoteric :? < 1151598591 0 :ihope!n=foo@c-71-205-100-59.hsd1.mi.comcast.net JOIN :#esoteric < 1151598599 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :Oh, what was that... < 1151598610 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :was what? < 1151598636 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :Well, what's the shortest BF program that outputs "D"? < 1151598673 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :The ASCII code is 68... < 1151598698 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :That's 2*2*(1+2*2*2*2). < 1151598788 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :It'd probably be more efficient to use 4*(1+4*4), so that'd be "++++[->++++<]>+[->++++<]>." < 1151598835 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :Maybe it can get shorter, but this works. < 1151599087 0 :LoganCapaldo!unknown@unknown.invalid PART #esoteric :? < 1151599394 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :can't it be brute forced? < 1151599553 0 :lindi-!unknown@unknown.invalid PRIVMSG #esoteric :_W_: only if you limit search to e.g. programs that halt after 10M steps < 1151599583 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :of course < 1151599590 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :but a program that outputs "D" is likely to... < 1151599668 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :How long would it take to run a BF program for 10 million steps? < 1151600779 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :lindi-, can't you just make a program to analyse it, and just skip over the programs that wouldn't halt in X steps? :p < 1151600810 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :Just keep the loops from being weird. < 1151600822 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :Or use BF-PDA. Everybody loves BF-PDA! < 1151600851 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :And no, I'm still not talking about the British Fluid Power Distributors Association... < 1151601631 0 :lindi-!unknown@unknown.invalid PRIVMSG #esoteric :_W_: sure you can but then you might miss the program that halts in X+1 steps < 1151601654 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :it was a joke... < 1151601686 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :the most efficient way to analyse when an arbitrary brainfuck program halts seems to be to execute it < 1151601735 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :So does this BF text generator thing have an extension thing, that tries to give you the shortest program beginning with some other program that outputs some string? < 1151601779 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :Like the shortest beginning with "++++[->++++<]>+[->++++<]>" that outputs "o"? < 1151602256 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :is a brainfuck "tape" infinite in both directions? < 1151602272 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :ie can you start a program with < < 1151602315 0 :lament!unknown@unknown.invalid PRIVMSG #esoteric :_W_: there's no standard < 1151602325 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :then you can < 1151602331 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :Um.. < 1151602336 0 :lament!unknown@unknown.invalid PRIVMSG #esoteric :_W_: usually it is assumed that the tape is infinite to the right, but not to the left < 1151602342 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :With some interpreters you can, and with some you can't. < 1151602366 0 :lament!unknown@unknown.invalid PRIVMSG #esoteric :_W_: and that no, you can't < 1151602373 0 :lament!unknown@unknown.invalid PRIVMSG #esoteric :at least that's the safest bet < 1151602382 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :In my mind, the tape was always infinite in both directions. < 1151602400 0 :lament!unknown@unknown.invalid PRIVMSG #esoteric :your mind is warped < 1151602744 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :+>+>+>+>+>+[[[-<++>]<<]>]>+++++. aw, beaten by 7 symbols < 1151602756 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :and here I thought my idea was good < 1151602805 0 :pgimeno!unknown@unknown.invalid PRIVMSG #esoteric :ihope: seen http://www.iwriteiam.nl/Ha_bf_numb.html ? < 1151602856 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :+>+[[[-<++++++++>]<<]>]>++. aw, beaten by *two* symbols < 1151602879 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :I'm guessing your version is the shortest ihope < 1151602915 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :no wait, that's wrong < 1151602989 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :Can you do betteR? < 1151603026 0 :lament!unknown@unknown.invalid PRIVMSG #esoteric :it's very easy to check if it's the shortest or not < 1151603038 0 :lament!unknown@unknown.invalid PRIVMSG #esoteric :the problem of checking can be easily discounted as trivial. < 1151603108 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :So how do you know that mine's not the shortest? < 1151603133 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :http://esoteric.voxelperfect.net/wiki/Brainfuck_constants? :-) < 1151603237 0 :CXI!n=Sanity@dialup-240.104.221.203.acc51-kent-syd.comindico.com.au JOIN :#esoteric < 1151603258 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :ihope, I meant my last program was wrong < 1151603265 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :it calculates 11 < 1151603268 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :not 68 < 1151603342 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :Ah. < 1151603374 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :and in fact, your program is shorter than the listed one < 1151603414 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :24 symbols, not counting the output < 1151603417 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :vs 25 < 1151603472 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :Hmm? < 1151603505 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :"++++[->++++<]>+[->++++<]>" has 25 symbols. < 1151603520 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :I count 24 < 1151603524 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :oh wait < 1151603529 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :missed that lone + in there < 1151603584 0 :pgimeno!unknown@unknown.invalid PRIVMSG #esoteric :oh, there seems to be an entry to be corrected there < 1151603594 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :confirm that +>+>+>+>+>+>+>+[[[-<++>]<<]>]> yields 255? < 1151603619 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :and is shorter than the 34 symbols listed as the shortest non-wrapping program for that < 1151603706 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :What does "+>+>+>+>+>+>+>+>+[[[-<++>]<<]>]>" do? < 1151603750 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :calculate ((((((1*2+1)*2+1)*2+1)*2+1)*2+1)*2+1)*2+1 < 1151603790 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :That would be 255. < 1151603806 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :yes, assuming I didn't misstype or missthink somewhere, and that's not actually what it does < 1151603815 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :I guess I should just download an interpreter < 1151603855 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :Online Encyclopaedic Database of Integer ___ ___ Sequences < 1151603861 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :Fill in the blanks :-P < 1151604044 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :As is, that produces OEDI__S. < 1151604046 0 :pgimeno!unknown@unknown.invalid PRIVMSG #esoteric :what is the number after the number of instructions? is it the maximum nesting level or the like? < 1151604061 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :I think it's the number of cells used. < 1151604081 0 :pgimeno!unknown@unknown.invalid PRIVMSG #esoteric :ah hm < 1151604141 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :yeah program works < 1151604147 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :guess I'll edit the wiki and add my program in < 1151604215 0 :pgimeno!unknown@unknown.invalid PRIVMSG #esoteric :I guess it is valid to generate the value in any cell, not just the first one, and to end up having nonzero cells, and to end up having the data pointer set to anything other than zero, right? < 1151604246 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :... < 1151604247 0 :pgimeno!unknown@unknown.invalid PRIVMSG #esoteric :having nonzero cells other than the generater number, that is < 1151604250 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :Yeah, I guess so. < 1151604255 0 :pgimeno!unknown@unknown.invalid PRIVMSG #esoteric :s/generater/generated/ < 1151604278 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :Ns/\n// < 1151604281 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :Or something like that. < 1151604336 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :I'll have to go through the list and see what programs on the form ...(((x+1)*x+1)*x+1... are shorter than the listed ones < 1151604670 0 :pgimeno!unknown@unknown.invalid PRIVMSG #esoteric :hum, a requirement seems to be that the data pointer points to the cell < 1151604701 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :You mean /(\+>)*\+\[\[\[-<\+\+>\]<<\]>\]>/? :-) < 1151604901 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :pgimeno, yes, you should be able to just add a . to have it printed < 1151604954 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :ihope, no, that'll just calculate the 2^x-1 ones < 1151604966 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :...Oh, yeah. < 1151604979 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :the middle <++> can be <+++> for 3 for instance < 1151605057 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :/(\+>)*\+\[\[\[-<\+*>\]<<\]>\]>/, then? < 1151605397 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :121 for instance, is (((3+1)*3+1)*3+1)*3+1 < 1151605469 0 :pgimeno!unknown@unknown.invalid PRIVMSG #esoteric :I'd say \++ instead of \+* < 1151605493 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :Oh, yeah... < 1151605520 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :Well, what's wrong with "+>+>+>+>+>+>+>+>+[[[-<>]<<]>]>"? :-P < 1151605540 0 :pgimeno!unknown@unknown.invalid PRIVMSG #esoteric :hehehe < 1151605613 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :and 156 is ((5+1)*5+1)*5+1 < 1151605656 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :ACTION decides to finally go back to that Wikibook < 1151605672 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :and that's all that needed update < 1151605678 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :121, 156 and 255 < 1151605685 0 :pgimeno!unknown@unknown.invalid PRIVMSG #esoteric :is there a generator of (e.g. randomly-chosen) expressions matched by a regexp? < 1151605704 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :I'm sure someone have written one in prolog < 1151605723 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :or if nothing else, a compiler from regexp to a prolog generator < 1151605753 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :not sure it's easy to find on the web tho, seems very niche < 1151605768 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :pgimeno: I've been wondering if there's one floating around. < 1151605829 0 :pgimeno!unknown@unknown.invalid PRIVMSG #esoteric :ACTION apt-searches < 1151605856 0 :bsmntbombdood!n=gavin@unaffiliated/bsmntbombdood JOIN :#esoteric < 1151605942 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :And the predicate says what Mr. Morton must do. < 1151605966 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :Oh, hi, bsmntbombdood. We were just getting into a heated argument about Schoolhouse Rock... < 1151605992 0 :bsmntbombdood!unknown@unknown.invalid PRIVMSG #esoteric :I'm not familiar with the topic < 1151606067 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :http://esoteric.voxelperfect.net/wiki/Brainfuck_constants#115 must surely be possible to improve < 1151606101 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :((10+1)*10+1)+4 < 1151606154 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :no, that's 34 symbols < 1151606160 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :gotta come up with something simpler tho < 1151606286 0 :pgimeno!unknown@unknown.invalid PRIVMSG #esoteric :what is the point with listing >++++++++++[>+++++++++++<-]> (28, 3) in 110? < 1151606302 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :no idea < 1151606309 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :same happens at the wrappable 255 as well < 1151606316 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :- is listed, and so is >- < 1151606349 0 :pgimeno!unknown@unknown.invalid PRIVMSG #esoteric :I see < 1151606364 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :And with lots of other things near 255. < 1151606437 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :the talk page discusses them < 1151606987 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :I assume negative values are never allowed? < 1151606999 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :if one has non-wrapping cells I mean < 1151607005 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :s/if/even if < 1151607067 0 :pgimeno!unknown@unknown.invalid PRIVMSG #esoteric :that might be a controversial point but I'd say no < 1151607138 0 :pgimeno!unknown@unknown.invalid PRIVMSG #esoteric :one of my readers sent this for 111: +++++++[>++++<-]->[<++++>-] < 1151607304 0 :pgimeno!unknown@unknown.invalid PRIVMSG #esoteric :I accepted it as a solution but I can imagine it failing for some interpreters with non-wrapping check < 1151607514 0 :pgimeno!unknown@unknown.invalid PRIVMSG #esoteric :(for context see ) < 1151607943 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :what's the shortest program that multiplies a number by itself? ie that does x^2 < 1151608147 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :[[[->+>+<<]>>-]<]>[-->+<][[->+<]>] is my first attempt < 1151608256 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :it'll be wrong half the time actually, only working on even numbers < 1151608343 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :actually, it won't work at all :( < 1151608735 0 :ihope_!n=foo@c-71-205-100-59.hsd1.mi.comcast.net JOIN :#esoteric < 1151609728 0 :ihope!unknown@unknown.invalid QUIT :Read error: 110 (Connection timed out) < 1151609795 0 :poiuy_qwert!unknown@unknown.invalid QUIT :Read error: 110 (Connection timed out) < 1151609866 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :[[->+>+<<]>>-]<<<[>>[-<++>]<<<<]>>[->+<]>>[<<[->>+<<]>>>>]<<. fixed! < 1151609963 0 :ihope_!unknown@unknown.invalid PRIVMSG #esoteric :Uh oh. < 1151610046 0 :ihope_!unknown@unknown.invalid PRIVMSG #esoteric :Well, to multiply A by B, you loop through moving B to C and D, then moving C to B... < 1151610065 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :sure, that's /one/ way < 1151610089 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :but when you program in BF, isn't the point to think outside the box? < 1151610098 0 :ihope_!unknown@unknown.invalid PRIVMSG #esoteric :No? :-P < 1151610106 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric ::/ < 1151610124 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :can you see how my program does it? < 1151610133 0 :ihope_!unknown@unknown.invalid PRIVMSG #esoteric :Just a minute... < 1151610226 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :nevermind, it doesn't pass my unit test :( < 1151610236 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :I've got a > or < too much somewhere < 1151610298 0 :ihope_!unknown@unknown.invalid PRIVMSG #esoteric :[-<+<+>>]<[[->+>+<<]>[-<+>]<]>>[-<+>]< < 1151610313 0 :ihope_!unknown@unknown.invalid PRIVMSG #esoteric :Try that. < 1151610355 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :infinite loop < 1151610375 0 :ihope_!unknown@unknown.invalid PRIVMSG #esoteric :Where? < 1151610384 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :dunno, tried running it < 1151610402 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :on 10 (so it should output an ascii 'd') < 1151610418 0 :ihope_!unknown@unknown.invalid PRIVMSG #esoteric :It didn't run off the left side of the tape, did it? < 1151610437 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :I started with >>>>++++++++++ < 1151610442 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :how much left spac edo you need? < 1151610453 0 :ihope_!unknown@unknown.invalid PRIVMSG #esoteric :That should be enough. < 1151610467 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :yeah that's what I gathered < 1151610469 0 :ihope_!unknown@unknown.invalid PRIVMSG #esoteric :It needs 2 to the left and 1 to the right. < 1151610490 0 :ihope_!unknown@unknown.invalid PRIVMSG #esoteric :Well, we could run through it manually... < 1151610509 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :let me try with 1 first; if that hangs that's easier to trace < 1151610542 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :yepp < 1151610570 0 :tgwizard!unknown@unknown.invalid QUIT :Connection timed out < 1151610648 0 :lament!unknown@unknown.invalid PRIVMSG #esoteric :++++++++++++++++++++++++++++++++++++++ < 1151610701 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :0,0,1*->1,1,0*->1,1*->1,0*,1,1->1,0,1*,1->1,1,0*,1->1,1*,0,1->2,0*,0,1->2*,0,0,1->run out of tape to the left, or continue moving the 2 to the left infinitely < 1151610756 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :probably the later, in my implementation < 1151610984 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :[->+>+<<]>[>[->+>+<<]>[-<+>]<<-]>>> < 1151610994 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :that only moves to the right < 1151611004 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :uses same space < 1151611100 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :yeah passes test < 1151611184 0 :ihope!n=foo@c-71-205-100-59.hsd1.mi.comcast.net JOIN :#esoteric < 1151611210 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :How nice. My computer freezes up in the middle of a conversation, and it's still frozen when it's time to pack up and all that. < 1151611223 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :We're going on a road trip... < 1151611245 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :well, have fun < 1151611312 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :Did you say that "[-<+<+>>]<[[->+>+<<]>[-<+>]<]>>[-<+>]<" went to the left forever? < 1151611336 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :I think so < 1151611367 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :naive trace of 1 as input at least < 1151611371 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :How's that possible? Each of the inner loops has the same number of "<" as ">", so it should be balanced. < 1151611375 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :that might be an edge case tho < 1151611377 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :s/ inner / / < 1151611382 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :oh right < 1151611390 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :probably did something wrong somewhere then < 1151611409 0 :ihope!unknown@unknown.invalid PRIVMSG #esoteric :Well, it's time for me to disappear. Bye. < 1151611911 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :it was one > too little < 1151611936 0 :_W_!unknown@unknown.invalid PRIVMSG #esoteric :[[->+>+<<]>>-]<<<[>>[-<++>]<<<<]>>[->+<]>>>[<<[->>+<<]>>>>]<< multiplies X with itself, using lots and lots of cells. < 1151612040 0 :ihope_!unknown@unknown.invalid QUIT :Read error: 110 (Connection timed out) < 1151612678 0 :ihope!unknown@unknown.invalid QUIT :Read error: 110 (Connection timed out) < 1151612809 0 :calamari!n=calamari@ip68-231-173-86.tc.ph.cox.net JOIN :#esoteric < 1151624088 0 :poiuy_qwert!i=poiuyqwe@toronto-HSE-ppp4227184.sympatico.ca JOIN :#esoteric