|
Pages: [1]
|
 |
|
 Author
|
Topic: rihodym: binary sorter (Read 2301 times)
|
Mystiq
Shelf-stacker
Posts: 3
|
I know it's very simple, but I started out trying to make the fibonacci sequence, and failed miserably.  |
|
|
|
|
Logged
|
|
|
|
|
borogove
|
ZEFYGET - a completely unoptimised hexadecimal little-endian 2-digit fibonacci counter. That leaves plenty of scope for improvement...
|
|
|
|
|
Logged
|
|
|
|
Mystiq
Shelf-stacker
Posts: 3
|
foferak
I made it look better, added a display on the right, and shrunk it. The long path for the dozer on the right is to give the random crate generator time to fill up the system. In fact, I shrunk it so much that some of the "pipes" get overloaded and it causes some number slots to halt.
All of the furnaces are because I noticed it was dumping numbers in the wrong slots due to overflows.
|
|
|
|
« Last Edit: October 25, 2006, 06:39:39 AM by Mystiq »
|
Logged
|
|
|
|
finka
Shelf-stacker
Posts: 4
|
The octal serial adder doretog I made awhile ago is set up to generate the Fibonacci sequence, with an expandable number of digits. You could get one in hex by using the adder component from Daniel Nilsson's xobacek. |
|
|
|
|
Logged
|
|
|
|
|
sluutthefeared
|
I thought the fibonacci sequence would be interesting so I tried it out. gysypopI couldn't think of a way to make it go any faster but maybe I'll try a 3 or 4 digit one later. |
|
|
|
|
Logged
|
|
|
|
|
|
Pages: [1]
|
|
|
 |
Rubicon Forum
