Computable number

Results: 71



#Item
1Lines Missing Every Random Point∗ Jack H. Lutz† Neil Lutz‡  Abstract

Lines Missing Every Random Point∗ Jack H. Lutz† Neil Lutz‡ Abstract

Add to Reading List

Source URL: paul.rutgers.edu

Language: English - Date: 2014-07-23 19:14:22
2

PDF Document

Add to Reading List

Source URL: homepages.math.uic.edu

Language: English - Date: 2016-01-08 10:48:49
3A computable axiomatisation of the topology of R and C Paul Taylor 6 August 2009

A computable axiomatisation of the topology of R and C Paul Taylor 6 August 2009

Add to Reading List

Source URL: www.paultaylor.eu

Language: English - Date: 2009-08-10 10:52:15
4Microsoft Word - IBSAlgorithms.doc

Microsoft Word - IBSAlgorithms.doc

Add to Reading List

Source URL: foibg.com

Language: English - Date: 2015-02-02 08:45:52
5Who Can Name the Bigger Number? Scott Aaronson∗ 1999 In an old joke, two noblemen vie to name the bigger number. The first, after ruminating for hours, triumphantly announces ”Eighty-three!” The second,

Who Can Name the Bigger Number? Scott Aaronson∗ 1999 In an old joke, two noblemen vie to name the bigger number. The first, after ruminating for hours, triumphantly announces ”Eighty-three!” The second,

Add to Reading List

Source URL: homepages.math.uic.edu

Language: English - Date: 2016-01-08 10:48:49
6ON COMBINATORIAL WEAKNESSES OF RAMSEYAN PRINCIPLES LUDOVIC PATEY ABSTRACT. Avoidance properties such as cone avoidance or PA avoidance for a principle P in reverse mathematics shows the effectiveness weakness of P. Stron

ON COMBINATORIAL WEAKNESSES OF RAMSEYAN PRINCIPLES LUDOVIC PATEY ABSTRACT. Avoidance properties such as cone avoidance or PA avoidance for a principle P in reverse mathematics shows the effectiveness weakness of P. Stron

Add to Reading List

Source URL: ludovicpatey.com

Language: English - Date: 2015-10-09 14:07:43
715 > 17 JUNE  http://cca-net.de anfiteatro -1.A, Faculdade de Economia

15 > 17 JUNE http://cca-net.de anfiteatro -1.A, Faculdade de Economia

Add to Reading List

Source URL: cca-net.de

Language: English - Date: 2016-05-26 12:34:11
8A LIGHTFACE ANALYSIS OF THE DIFFERENTIABILITY RANK LINDA BROWN WESTRICK Abstract. We examine the computable part of the differentiability hierarchy defined by Kechris and Woodin. In that hierarchy, the rank of a differen

A LIGHTFACE ANALYSIS OF THE DIFFERENTIABILITY RANK LINDA BROWN WESTRICK Abstract. We examine the computable part of the differentiability hierarchy defined by Kechris and Woodin. In that hierarchy, the rank of a differen

Add to Reading List

Source URL: www.math.uconn.edu

Language: English - Date: 2014-10-24 11:30:43
9RAMSEY’S THEOREM FOR SINGLETONS AND STRONG COMPUTABLE REDUCIBILITY DAMIR D. DZHAFAROV, LUDOVIC PATEY, REED SOLOMON, AND LINDA BROWN WESTRICK  Abstract. We answer a question posed by Hirschfeldt and Jockusch by showing

RAMSEY’S THEOREM FOR SINGLETONS AND STRONG COMPUTABLE REDUCIBILITY DAMIR D. DZHAFAROV, LUDOVIC PATEY, REED SOLOMON, AND LINDA BROWN WESTRICK Abstract. We answer a question posed by Hirschfeldt and Jockusch by showing

Add to Reading List

Source URL: ludovicpatey.com

Language: English - Date: 2016-05-31 11:43:35
10THE WEAKNESS OF BEING COHESIVE, THIN OR FREE IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. Informally, a mathematical statement is robust if its strength is left unchanged under variations of the statement. In this pape

THE WEAKNESS OF BEING COHESIVE, THIN OR FREE IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. Informally, a mathematical statement is robust if its strength is left unchanged under variations of the statement. In this pape

Add to Reading List

Source URL: ludovicpatey.com

Language: English - Date: 2016-02-08 07:56:59