Filtrer vos résultats
- 26
- 11
- 15
- 11
- 6
- 2
- 2
- 1
- 1
- 31
- 26
- 1
- 1
- 1
- 2
- 1
- 2
- 4
- 2
- 3
- 2
- 6
- 4
- 1
- 2
- 3
- 1
- 1
- 36
- 1
- 16
- 15
- 7
- 4
- 4
- 4
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 37
- 14
- 4
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
37 résultats
|
|
|
triés par
|
|
|
Une brève introduction à la théorie effective de l'aléatoireGazette des Mathématiciens, 2010, 123, pp.35-47
Article dans une revue
inria-00449022v1
|
||
On the interplay between effective notions of randomness and genericityThe Journal of Symbolic Logic, 2019
Article dans une revue
hal-03019092v1
|
|||
|
|
Distributed computing power : from local function to global computing[Research Report] LIP RR-2003-15, Laboratoire de l'informatique du parallélisme. 2003, 2+10p
Rapport
hal-02101834v1
|
||
|
|
Optimal bounds for single-source Kolmogorov extractorsTransactions of the American Mathematical Society, 2020, 373, pp.1983-2006. ⟨10.1090/tran/7972⟩
Article dans une revue
hal-02392727v1
|
||
|
|
On low for speed oraclesJournal of Computer and System Sciences, 2020, 108, pp.49-63. ⟨10.1016/j.jcss.2019.08.007⟩
Article dans une revue
hal-02377935v1
|
||
|
|
The Denjoy alternative for computable functions2011
Pré-publication, Document de travail
hal-00626275v3
|
||
|
|
The Denjoy alternative for computable functionsSTACS'12 (29th Symposium on Theoretical Aspects of Computer Science), Feb 2012, Paris, France. pp.543-554
Communication dans un congrès
hal-00678180v1
|
||
|
|
The axiomatic power of Kolmogorov complexityAnnals of Pure and Applied Logic, 2014, 165 (9), pp.1380-1402. ⟨10.1016/j.apal.2014.04.009⟩
Article dans une revue
hal-01165098v1
|
||
|
|
Algorithmic Identification of Probabilities Is HardALT: Algorithmic Learning Theory, Oct 2014, Bled, Slovenia. pp.85-95, ⟨10.1007/978-3-319-11662-4_7⟩
Communication dans un congrès
hal-01397246v1
|
||
|
|
Generic algorithms for halting problem and optimal machines revisited2015
Pré-publication, Document de travail
lirmm-01233778v1
|
||
|
|
Parallel and Serial Jumps of Weak Weak König’s LemmaComputability and Complexity, LNCS (10010), Springer, pp.201-217, 2017, Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday, 978-3-319-50061-4 (print) 978-3-319-50062-1 (online). ⟨10.1007/978-3-319-50062-1_15⟩
Chapitre d'ouvrage
hal-01451088v1
|
||
|
|
Algorithmic tests and randomness with respect to a class of measuresProceedings of the Steklov Institute of Mathematics, 2011, 274 (1), pp.34-89. ⟨10.1134/S0081543811060058⟩
Article dans une revue
hal-00644785v1
|
||
|
|
Separations of non-monotonic randomness notions2009
Pré-publication, Document de travail
hal-00403921v1
|
||
|
|
Kolmogorov Complexity and Solovay Functions26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. pp.147-158
Communication dans un congrès
inria-00359056v1
|
||
|
|
Layerwise Computability and Image RandomnessTheory of Computing Systems, 2017, 61 (4), pp.1353-1375. ⟨10.1007/s00224-017-9791-8⟩
Article dans une revue
hal-01650910v1
|
||
|
|
Algorithmic identification of probabilities is hardJournal of Computer and System Sciences, 2018, 95, pp.98-108. ⟨10.1016/j.jcss.2018.01.002⟩
Article dans une revue
lirmm-01803441v1
|
||
Limit complexities revisited [ once more ]arxiv:1204-0201, 2012, pp.1-12
Rapport
lirmm-00786224v1
|
|||
|
|
Effective randomness, strong reductions and Demuth's theorem2011
Pré-publication, Document de travail
hal-00630308v2
|
||
|
|
Game-theoretic approaches to randomness: unpredictability and stochasticity.Other [cs.OH]. Université de Provence - Aix-Marseille I, 2008. English. ⟨NNT : ⟩
Thèse
tel-00332425v2
|
||
|
|
On Low for Speed Oracles35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), Feb 2018, Caen, France. pp.15:1-15:13, ⟨10.4230/LIPIcs.STACS.2018.15⟩
Communication dans un congrès
lirmm-03113211v1
|
||
|
|
A constructive version of Birkhoff's ergodic theorem for Martin-Lof random pointsInformation and Computation, 2012, 210, pp.021-030. ⟨10.1016/j.ic.2011.10.006⟩
Article dans une revue
hal-00643629v1
|
||
|
|
Constructive dimension and weak truth-table degrees2007
Pré-publication, Document de travail
hal-00191125v1
|
||
|
|
Generic algorithms for halting problem and optimal machines revisitedLogical Methods in Computer Science, 2016, Logical Methods in Computer Science, 12 (2), pp.1-29. ⟨10.2168/LMCS-12(2:1)2016⟩
Article dans une revue
lirmm-01486494v1
|
||
|
|
Probabilistic vs Deterministic Gamblers39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022), Mar 2022, Marseille, France. ⟨10.4230/LIPIcs.STACS.2022.11⟩
Communication dans un congrès
hal-03788054v1
|
||
|
|
Limit complexities revisitedSTACS 2008, Feb 2008, Bordeaux, France. pp.73-84
Communication dans un congrès
hal-00218279v1
|
||
|
|
Relativized depthTheoretical Computer Science, 2023, 949, pp.113694. ⟨10.1016/j.tcs.2023.113694⟩
Article dans une revue
hal-04294555v1
|
||
|
|
On the logical strengths of partial solutions to mathematical problemsTransactions of the London Mathematical Society, 2017, 4 (1), pp.30 - 71. ⟨10.1112/tlm3.12001⟩
Article dans une revue
hal-01888542v1
|
||
What Percentage of Programs Halt?ICALP: International Colloquium on Automata, Languages and Programming, EATCS, Jul 2015, Kyoto, Japan. pp.219-230, ⟨10.1007/978-3-662-47672-7⟩
Communication dans un congrès
lirmm-01279151v1
|
|||
|
|
Solovay functions and K-trivialitySymposium on Theoretical Aspects of Computer Science (STACS2011), Mar 2011, Dortmund, Germany. pp.452-463
Communication dans un congrès
hal-00573598v1
|
||
|
|
von Neumann’s biased coin revisitedLICS: Logic in Computer Science, Jun 2012, Dubrovnik, Croatia
Communication dans un congrès
hal-01397207v1
|
- 1
- 2