MoinMoin: MoinMoinChat/Logs/moin-dev/2006-01-11

2006-01-11T00:05:43  <xorAxAx> [PERIODIC ANNOUNCEMENT] Logs can be found on http://moinmoin.wikiwikiweb.de/MoinMoinChat/Logs/moin-dev
2006-01-11T08:15:25  <lydon> moin
2006-01-11T08:48:47  <ThomasWaldmann> moin
2006-01-11T10:42:41  * xorAxAx runs pylint on MoinMoin
2006-01-11T10:42:52  <xorAxAx> so - which rating x of 10 points do you expect? :)
2006-01-11T13:04:23  <ThomasWaldmann> hehe. I don't know pylint too much, so just guessing a 7.
2006-01-11T13:06:24  <xorAxAx> i had to rerun it a few times, still calculating
2006-01-11T13:09:31  <ThomasWaldmann> bbl...
2006-01-11T15:34:18  * xorAxAx runs pylint on thinkmo.de (niced) - it stalled for me after 30 minutes on import analysis - moinmoin is too big :)
2006-01-11T20:18:32  * xorAxAx announces that the moinmoin team has triggered a bug in the pylint code. our code seems too bad. they will investigate it :)
2006-01-11T20:35:18  <Fabi> badness overflow (in the caching module I guess)
2006-01-11T20:36:31  <xorAxAx> the caching module?
2006-01-11T20:36:37  <xorAxAx> why? its one of the cleanest ones
2006-01-11T20:37:35  <ThomasWaldmann> moin
2006-01-11T20:38:02  <ThomasWaldmann> lol
2006-01-11T20:39:11  <Fabi> I guess they use an Int for messuring badness that overflows ;)=
2006-01-11T20:39:37  <xorAxAx> it was stuck in a weird getcycle()-cycle
2006-01-11T20:39:49  <xorAxAx> no idea why cycle they wanted to track. but it called itself in a cycle
2006-01-11T20:40:03  <Fabi> LOL
2006-01-11T20:40:03  <xorAxAx> recursively
2006-01-11T20:40:13  <xorAxAx> s/why/what/
2006-01-11T20:40:54  <xorAxAx> the company is called logilab - it possibly just works with logic code
2006-01-11T20:41:00  <xorAxAx> or logical code even
2006-01-11T20:49:20  <ThomasWaldmann> a getcycle function cycling forever is kind of funny
2006-01-11T20:51:45  <xorAxAx> yeah, it reminds us at the halt-problem
2006-01-11T20:52:09  <xorAxAx> maybe it tried to solve it. who knows :)
2006-01-11T20:53:02  <Fabi> the halt problem says: You don't know if it really cycles for ever
2006-01-11T20:53:13  <Fabi> not until you waited forever
2006-01-11T20:54:17  <Fabi> for solving the halt probem you need a super computer
2006-01-11T20:54:32  <Fabi> because a super computer can do an infinite loop within 5 minutes
2006-01-11T20:55:33  <xorAxAx> you have strange computers down there in stuttgart
2006-01-11T20:56:53  <Fabi> our theoretists wanted to buy a turing maschine
2006-01-11T20:59:19  <Fabi> but it was refused because the universitiy was afraid of the costs of the infinite tape
2006-01-11T21:01:58  <xorAxAx> somebody said that you can transform a turing machine to one having a fixed width tape
2006-01-11T21:02:07  <Fabi> .oO(oh, oh, infinite badness)
2006-01-11T21:02:10  <xorAxAx> no, fixed length
2006-01-11T21:02:31  <xorAxAx> but i have no idea if that is true
2006-01-11T21:02:41  <Fabi> I doubt that
2006-01-11T21:03:10  <Fabi> becuase a turing maschine with limited length in only a regular  maschine
2006-01-11T21:03:25  <xorAxAx> even if it can store values of arbitary length?
2006-01-11T21:03:34  <Fabi> hmm
2006-01-11T21:04:15  <Fabi> It can't because the regular part of the turing machsine can only cope with a fixed number of values
2006-01-11T22:25:52  * xorAxAx prepares the next MMDE release
2006-01-11T22:50:27  * xorAxAx released MMDE 1.5.0-1
2006-01-11T22:53:23  <ThomasWaldmann> 5 minutes too early for sl :)
2006-01-11T22:54:33  <xorAxAx> s1?
2006-01-11T22:55:19  <ThomasWaldmann> SL
2006-01-11T22:56:06  <xorAxAx> SL?
2006-01-11T23:01:55  <ThomasWaldmann> (22:50) < ThomasWal> oops, we have a full slovenian po file
2006-01-11T23:03:42  <xorAxAx> ah