High Speed Binary Parallel Adder
Published in IEEE Transactions on Electronic Computers • Oct 1, 1966
NobleIDNI0P69W23R81S59
Authors:
Haobo Ling
Abstract
A study of the output of a heuristic computer program reveals two four-state binary Turing machines which yield the highest known score for four states in Rado's co-called "Busy Beaver" logical game. There is evidence which supports the conjecture that this score of 13 is the particular value of Σ(4...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!