Reply to comment
Might be a silly question, but..
October 23, 2007 by MainFragger, 2 years 2 weeks ago
Comment id: 25626
Reply
About us
Science Blog was started in August 2002. It lives, breathes and eats press releases from research organizations around the globe. Most of what you read here are press releases from the outfits named in the stories themselves. Got a news story you think belongs here? Let's talk. The other half of the equation is blog posts from readers like you. So if you have an interest in science, please register and join others like you in an ongoing, vibrant dialog about what makes the world tick. Meantime, please take a minute to read our Privacy Policy and Site Disclaimer.Recommended
Andrew Sullivan Dan Sullivan Doug Arellanes Emmanuelle Richard Faith Sullivan Fred Bortz Heather Havrilesky Henry Copeland Kate Sullivan Ken Layne lagreenbean.com LAist.com Maggie Sullivan Matt Welch NewYorkology Opinion L.A. Ron Kaye Slashdot Steve Elzer & Family TheNewsroom.org Thor Garcia Tony Pierce Wonkette OlderThanks CNET for naming Science Blog one of your Blog 100!
Why aren't there processors that can compute in straight hex? There has to be a way to make a 0 state and 15 clean voltage ranges to create digital hex. It just seems to me that processing FFFF at an adress of ffff is a lot faster than processing 111111111 at an adress of 111111111 or whatever..
And for optical media, the pits can be circular and match the maximum size readable by the beam. Then have 0 be empty, 1-8 ascending pit sizes, 9-F being inverse conectrentric circles unpitted. 9 would be the next circle edge size down from the other edge of the pit unpitted. F would be the outer ring of the pit with nothing pitted inside that ring.