00:59:02 -!- lament has joined. 03:21:29 -!- lament has quit ("leaving"). 03:51:18 -!- lament has joined. 07:34:11 -!- lament has quit ("Lost terminal"). 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 08:10:40 -!- andreou has joined. 08:12:52 -!- andreou has quit (Client Quit). 08:39:50 -!- dbc has joined. 10:24:30 -!- andreou has joined. 10:24:57 wow, lots and lots of people 10:34:12 -!- andreou has quit ("zoom-zoom"). 12:05:07 -!- dbc1 has joined. 12:05:17 -!- dbc has quit (Read error: 104 (Connection reset by peer)). 13:18:31 -!- Aardappel has quit (Client Quit). 16:07:21 -!- Aardappel has joined. 18:00:43 -!- calamari_ has joined. 18:01:13 hello! 18:02:10 * calamari_ is happy.. figured out how to do bitwise AND, OR, & XOR with only 6 memory cells 19:44:28 -!- cognition has joined. 20:01:06 hi cognition 20:01:53 greetings 20:12:28 how goes? 20:31:06 pretty well.. implementing my and/or/xor 20:44:53 in what sense? 21:30:40 -!- cognition has left (?). 22:53:25 -!- pir2_ has joined. 22:53:31 hoy 23:16:36 -!- pir2_ has changed nick to cognition. 23:41:13 re cog :) 23:43:33 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*** 23:44:12 well, that has never been difficult, but doing it without using a lot of memory was a chore 23:45:46 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 23:46:37 So I am converting to binary, but not keeping the answer around so I only need a few temp cells 20:53:57 -!- clog has joined. 20:53:57 -!- clog has joined.