01:12:34 -!- calamari_ has joined.
01:18:01 <calamari_> that would be very confusing, almost like I'm talking to myself.. I guess here that would be perfect :)
01:52:13 -!- calamari_ has quit ("Leaving").
07:59:59 -!- clog has quit (ended).
08:00:00 -!- clog has joined.
08:16:48 -!- WildHalcyon has joined.
08:18:30 -!- iamcal has quit ("buh bye").
08:31:08 -!- WildHalcyon has quit ("leafChat IRC client: http://www.leafdigital.com/Software/leafChat/").
09:01:22 -!- andreou has joined.
09:15:40 -!- andreou has quit ("A tree excells at being a tree.").
10:56:52 -!- andreou has joined.
11:20:43 -!- andreou has quit ("A tree excells at being a tree.").
11:34:07 -!- andreou has joined.
11:46:13 -!- andreou has quit ("A tree excells at being a tree.").
15:45:49 -!- andreou has joined.
15:57:08 -!- andreou has quit ("A tree excells at being a tree.").
16:55:51 -!- calamari_ has joined.
17:00:43 * calamari_ suggests: Welcome to the esoteric programming channel! Logs of previous discussions are available at http://tunes.org/~coreyr/date.php?chan=esoteric
17:34:06 -!- andreou has joined.
17:53:56 -!- calamari_ has quit (Read error: 110 (Connection timed out)).
18:13:46 -!- andreou has quit (Read error: 113 (No route to host)).
19:20:21 -!- calamari_ has joined.
19:21:13 <calamari_> I was thinking about bf optimizations...
19:22:22 <calamari_> if a program takes no input, and produces no output then it can be replaced by either a program that immediately exits or freezes (depending on if the original exits)
19:23:11 <calamari_> if it takes no input, and exits, any output produced could be captured and reproduced
19:23:44 <calamari_> also, given a particular set of inputs, it is the same as having no inputs
19:25:02 <calamari_> if input is not predetermined and there is no output, it still can't be optimized, because the act of exiting the program provides information (could return a binary answer that way, say 1=exit, 0=didn't exit)
19:25:49 <calamari_> anyhow.. that was my random thought on optimizations :)
19:26:09 <mtve> heh, the only you should know will it exits or not :)
19:28:14 <calamari_> mtve: it could be assumed that all programs will eventually exit, by loss of power, malfunction, etc
19:30:00 <calamari_> so then, I guess we should say with no i/o commands, an empty program is the best optimization?
19:31:57 <calamari_> or should the malfunction be considered an input that is not predetermined? that would mess up the whole idea
19:31:59 <mtve> +++++++++++++ (ord 'n' times) .++++++++ (ord 'o' times). []
19:39:29 -!- andreou has joined.
19:50:58 -!- calamari_ has quit ("Leaving").
20:07:57 <fizzie> there is no such thing as a malfunction. current probabilistic primality testing algorithms are less likely to err than a "correct" primality tester is to give a wrong answer thanks to a flipped bit due to some random electromagnetic radiation (at least so 'they' tell me), but we still think the second algorithm is always correct.
20:36:01 -!- andreou has quit ("A tree excells at being a tree.").
22:51:03 -!- cmeme has quit (Read error: 54 (Connection reset by peer)).
22:51:21 -!- cmeme has joined.
22:51:21 -!- cmeme2 has joined.
22:53:17 -!- cmeme has quit (Remote closed the connection).
22:53:17 -!- cmeme2 has quit (Read error: 104 (Connection reset by peer)).
22:53:56 -!- cmeme has joined.
23:09:07 -!- cmeme has quit (Read error: 54 (Connection reset by peer)).
23:20:21 -!- cmeme has joined.
23:21:02 -!- cmeme has quit (Read error: 54 (Connection reset by peer)).
23:25:08 -!- cmeme has joined.