CIE 2009 - PDF Preprint Papers

CIE 2009 Conference on Computability in Europe

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CIE-2009 Paper

click to vote

CIE
2009
Springer

147views Applied Computing» more CIE 2009»

Computable Exchangeable Sequences Have Computable de Finetti Measures

14 years 7 months ago

Download math.mit.edu

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 ...

Cameron E. Freer, Daniel M. Roy

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	147	Computable Exchangeable Sequences Have Computable de Finetti Measures	claim
2	137	Decidability of Sub-theories of Polynomials over a Finite Field	claim
3	137	Stochastic Programs and Hybrid Automata for (Biological) Modeling	claim
4	135	Complexity of Existential Positive First-Order Logic	claim
5	122	Ordinal Computability	claim
6	121	Computational Heuristics for Simplifying a Biological Model	claim
7	120	Relationship between Kanamori-McAloon Principle and Paris-Harrington Theorem	claim
8	118	Algorithmic Minimal Sufficient Statistic Revisited	claim
9	113	Stability under Strategy Switching	claim
10	113	First-Order Universality for Real Programs	claim
11	106	Cutting Planes and the Parameter Cutwidth	claim
12	98	Numberings and Randomness	claim
13	97	Lowness for Demuth Randomness	claim
14	95	Computability of Continuous Solutions of Higher-Type Equations	claim
15	91	Dialectica Interpretation with Fine Computational Control	claim
16	90	Immunity for Closed Sets	claim
17	88	Members of Random Closed Sets	claim
18	88	On Generating Independent Random Strings	claim
19	88	Notes on the Jump of a Structure	claim
20	88	Program Self-reference in Constructive Scott Subdomains	claim
21	87	Functions Definable by Arithmetic Circuits	claim
22	85	The First Order Theories of the Medvedev and Muchnik Lattices	claim
23	84	On Stateless Multicounter Machines	claim
24	84	Spectra of Algebraic Fields and Subfields	claim
25	81	A Divergence Formula for Randomness and Dimension	claim
26	81	Index Sets and Universal Numberings	claim
27	79	Equivalence Relations on Classes of Computable Structures	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers