Quote
Originally posted by Regulus:
**Speaking as the guy who came up with ncb binary arithmetic in the first place, I'm pretty sure Aprosenf's alternative is the only one that stands a chance of working. The binary math hack simply doesn't scale well past a few 4-bit counters.
-reg
**
Ack, back when I was tackling Challenge Zero, and came up with my ncb counter, I thought I was original d-: Turns out I'm 2 years behind Regulus q-:
Anyways, reading your old post, it seems you need 16 crons to count up to 16. Well, my method only needs n+1 crons for n-bit numbers (5 crons to count up to 15). With that information, perhaps Aprosenf's approach wouldn't be the only one that stands a chance of working? Haven't had time to think deep about it.
I shall pursue the Ship Hanger challenge if it's still not closed by... March 2004.
sigh... so buzy )-:
Pan Sola
------------------
fundraising to buy a mac so I don't have to develope plug-ins on an emulator. Please send all contributions via paypal to panguim@uclink4.berkeley.edu
Making a TC based on J.R.R. Tolkein's works. (url="http://"http://www.ev-nova.net/forums/viewtopic.php?t=935")http://www.ev-nova.n...topic.php?t=935(/url)