Computable real function

Results: 22



#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
3Computability Theory, Reverse Mathematics, and Ordered Fields Oscar Louis Levin, Ph.D. University of Connecticut, 2009

Computability Theory, Reverse Mathematics, and Ordered Fields Oscar Louis Levin, Ph.D. University of Connecticut, 2009

Add to Reading List

Source URL: www.math.uconn.edu

Language: English - Date: 2009-04-27 16:38:49
4A Lambda Calculus for Real Analysis Paul Taylor1 Andrej Bauer2  1 Department

A Lambda Calculus for Real Analysis Paul Taylor1 Andrej Bauer2 1 Department

Add to Reading List

Source URL: www.paultaylor.eu

Language: English - Date: 2009-02-12 12:32:31
5Computable Real Analysis without Set Theory or Turing Machines Paul Taylor Department of Computer Science University of Manchester UK EPSRC GR/S58522

Computable Real Analysis without Set Theory or Turing Machines Paul Taylor Department of Computer Science University of Manchester UK EPSRC GR/S58522

Add to Reading List

Source URL: www.paultaylor.eu

Language: English - Date: 2009-02-12 12:33:09
6Computable Real Analysis without Set Theory or Turing Machines Paul Taylor Department of Computer Science University of Manchester UK EPSRC GR/S58522

Computable Real Analysis without Set Theory or Turing Machines Paul Taylor Department of Computer Science University of Manchester UK EPSRC GR/S58522

Add to Reading List

Source URL: www.paultaylor.eu

Language: English - Date: 2009-02-12 12:32:50
7Preface  Computable analysis is a branch of computability theory studying those functions on the real numbers and related sets which can be computed by machines such as digital computers. The increasing demand for reliab

Preface Computable analysis is a branch of computability theory studying those functions on the real numbers and related sets which can be computed by machines such as digital computers. The increasing demand for reliab

Add to Reading List

Source URL: www.fernuni-hagen.de

Language: English - Date: 2009-09-05 02:34:00
8arXiv:1204.6671v1 [cs.LO] 30 Apr 2012  δ-Decidability over the Reals∗ Sicun Gao, Jeremy Avigad, and Edmund M. Clarke Carnegie Mellon University, Pittsburgh, PAMay 1, 2012

arXiv:1204.6671v1 [cs.LO] 30 Apr 2012 δ-Decidability over the Reals∗ Sicun Gao, Jeremy Avigad, and Edmund M. Clarke Carnegie Mellon University, Pittsburgh, PAMay 1, 2012

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2012-04-30 22:29:41
9Differential Equations, Infinite Limits and Real Recursive Functions ´ JOSE´ FELIX COSTA∗ Instituto Superior T´ecnico

Differential Equations, Infinite Limits and Real Recursive Functions ´ JOSE´ FELIX COSTA∗ Instituto Superior T´ecnico

Add to Reading List

Source URL: fgc.math.ist.utl.pt

Language: English - Date: 2008-12-02 06:06:34
10Theory of Real Computation according to EGC∗ Chee Yap Courant Institute of Mathematical Sciences Department of Computer Science New York University April 17, 2007

Theory of Real Computation according to EGC∗ Chee Yap Courant Institute of Mathematical Sciences Department of Computer Science New York University April 17, 2007

Add to Reading List

Source URL: www.cs.nyu.edu

Language: English - Date: 2007-04-17 11:20:36