2 citations · 5 across the 7 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.AR2015
Binary Adder Circuits of Asymptotically Minimum Depth, Linear Size, and Fan-Out Two
Stephan Held, Sophie Theresa Spirkl
We consider the problem of constructing fast and small binary adder circuits. Among widely-used adders, the Kogge-Stone adder is often considered the fastest, because it computes t…
cs.AI2015
Ultimate Intelligence Part I: Physical Completeness and Objectivity of Induction
Eray Özkural
We propose that Solomonoff induction is complete in the physical sense via several strong physical arguments. We also argue that Solomonoff induction is fully applicable to quantum…