Define the Linus sequence Ln for n 1 as a 0-1 sequence with L1 = 0, and Ln chosen so as to minimize the length of the longest immediately repeated block Ln-2r+1 . . . Ln-r = Ln-r...
The relationship between BQP and PH has been an open problem since the earliest days of quantum computing. We present evidence that quantum computers can solve problems outside th...
Every algebraic theory gives rise to a monad, and monads allow a meta-language which is a basic programming language with sideeffects. Equations in the algebraic theory give rise ...
Methods for deciding quantifier-free non-linear arithmetical conjectures over R are crucial in the formal verification of many realworld systems and in formalised mathematics. Wh...
Open content web sites depend on users to produce information of value. Wikipedia is the largest and most well-known such site. Previous work has shown that a small fraction of ed...
Katherine A. Panciera, Aaron Halfaker, Loren G. Te...