An arithmetic circuit is a labelled, directed, acyclic graph specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. In this pap...
Abstract. We express some criticism about the definition of an algorithmic sufficient statistic and, in particular, of an algorithmic minimal sufficient statistic. We propose anoth...
An algebraic field extension of Q or Z/(p) may be regarded either as a structure in its own right, or as a subfield of its algebraic closure F (either Q or Z/(p)). We consider the ...
Andrey Frolov, Iskander Sh. Kalimullin, Russell Mi...
We show that the first order theories of the Medevdev lattice and the Muchnik lattice are both computably isomorphic to the third order theory of the natural numbers.
We present a technique to associate to stochastic programs written in stochastic Concurrent Constraint Programming a semantics in terms of a lattice of hybrid automata. The aim of ...
Let Γ be a (not necessarily finite) structure with a finite relational signature. We prove that deciding whether a given existential positive sentence holds in Γ is in LOGSPACE...
Abstract. We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. In the process, we develop machinery for computably ...
We give a combinatorial proof of a tight relationship between the Kanamori-McAloon principle and the Paris-Harrington theorem with a number-theoretic parameter function. We show th...
We introduce the parameter cutwidth for the Cutting Planes (CP) system of Gomory and Chv´atal. We provide linear lower bounds on cutwidth for two simple polytopes. Considering CP ...