< 1067907542 0 :lament!~lament@h24-85-63-178.vc.shawcable.net JOIN :#esoteric < 1067916089 0 :lament!unknown@unknown.invalid QUIT :"leaving" < 1067917878 0 :lament!~lament@h24-85-63-178.vc.shawcable.net JOIN :#esoteric < 1067931251 0 :lament!unknown@unknown.invalid QUIT :"Lost terminal" < 1067932799 0 :clog!unknown@unknown.invalid QUIT :ended < 1067932800 0 :clog!unknown@unknown.invalid JOIN :#esoteric < 1067933440 0 :andreou!~peace@195.130.107.55 JOIN :#esoteric < 1067933572 0 :andreou!unknown@unknown.invalid QUIT :Client Quit < 1067935190 0 :dbc!dbc@130-94-161-238-dsl.hevanet.com JOIN :#esoteric < 1067941470 0 :andreou!~peace@195.130.107.57 JOIN :#esoteric < 1067941497 0 :andreou!unknown@unknown.invalid PRIVMSG #esoteric :wow, lots and lots of people < 1067942052 0 :andreou!unknown@unknown.invalid QUIT :"zoom-zoom" < 1067947507 0 :dbc1!dbc@130-94-161-238-dsl.hevanet.com JOIN :#esoteric < 1067947517 0 :dbc!unknown@unknown.invalid QUIT :Read error: 104 (Connection reset by peer) < 1067951911 0 :Aardappel!unknown@unknown.invalid QUIT :Client Quit < 1067962041 0 :Aardappel!wvo96r@p508C7660.dip.t-dialin.net JOIN :#esoteric < 1067968843 0 :calamari_!killerkal@ip68-0-154-225.tc.ph.cox.net JOIN :#esoteric < 1067968873 0 :calamari_!unknown@unknown.invalid PRIVMSG #esoteric :hello! < 1067968930 0 :calamari_!unknown@unknown.invalid PRIVMSG #esoteric :ACTION is happy.. figured out how to do bitwise AND, OR, & XOR with only 6 memory cells < 1067975068 0 :cognition!~cognition@labs16918.instruct.langara.bc.ca JOIN :#esoteric < 1067976066 0 :calamari_!unknown@unknown.invalid PRIVMSG #esoteric :hi cognition < 1067976113 0 :cognition!unknown@unknown.invalid PRIVMSG #esoteric :greetings < 1067976748 0 :cognition!unknown@unknown.invalid PRIVMSG #esoteric :how goes? < 1067977866 0 :calamari_!unknown@unknown.invalid PRIVMSG #esoteric :pretty well.. implementing my and/or/xor < 1067978693 0 :cognition!unknown@unknown.invalid PRIVMSG #esoteric :in what sense? < 1067981440 0 :cognition!unknown@unknown.invalid PART #esoteric :? < 1067986405 0 :pir2_!~oak3120@gambit.instruct.langara.bc.ca JOIN :#esoteric < 1067986411 0 :pir2_!unknown@unknown.invalid PRIVMSG #esoteric :hoy < 1067987796 0 :pir2_!unknown@unknown.invalid NICK :cognition < 1067989273 0 :calamari_!unknown@unknown.invalid PRIVMSG #esoteric :re cog :) < 1067989413 0 :calamari_!unknown@unknown.invalid PRIVMSG #esoteric :oh, to answer your question.. I have logical AND and OR support in BFBASIC, but I figured out how to do bitwise AND OR and XOR in brainf*** < 1067989452 0 :calamari_!unknown@unknown.invalid PRIVMSG #esoteric :well, that has never been difficult, but doing it without using a lot of memory was a chore < 1067989546 0 :calamari_!unknown@unknown.invalid PRIVMSG #esoteric :I finally decided on the lame approach.. figure out odd or even (basically get the rightmost bit), then divide by 2. Do this for the other number. Compare logic and/or/xor for 0 or 1 (easy). Add to answer. Repeat 8 times < 1067989597 0 :calamari_!unknown@unknown.invalid PRIVMSG #esoteric :So I am converting to binary, but not keeping the answer around so I only need a few temp cells < 1067979237 0 :clog!unknown@unknown.invalid JOIN :#esoteric < 1067979237 0 :clog!nef@bespin.org JOIN :#esoteric