On a simple definition of computable function of a real variable‐with applications to functions of a complex variable

Marian Boykan Pour-El & Jerome Caldwell

Mathematical Logic Quarterly 21 (1):1-19 (1975) Copy BIBT_EX

Abstract

This article has no associated abstract. (fix it)

Cite

Plain text

BibTeX

Formatted text

Reference Manager

RefWorks

Options

Mark as duplicate

Find it on Scholar

Request removal from index

Revision history

Categories

Computability in Philosophy of Computing and Information

Keywords

Reprint years

DOI

10.1002/malq.19750210102

Links

PhilArchive

Upload a copy of this work Papers currently archived: 91,672

External links

From the Publisher via CrossRef (no proxy)

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Sign in / register and customize your OpenURL resolver
Configure custom resolver

My notes

Sign in to use this feature

Similar books and articles

Analytics

Added to PP
2013-11-02

Downloads
24 (#653,725)

6 months
1 (#1,462,504)

Historical graph of downloads

How can I increase my downloads?

Citations of this work

Effective choice and boundedness principles in computable analysis.Vasco Brattka & Guido Gherardi - 2011 - Bulletin of Symbolic Logic 17 (1):73-117.

Two dogmas of computationalism.Oron Shagrir - 1997 - Minds and Machines 7 (3):321-44.

Degrees of Unsolvability of Continuous Functions.Joseph S. Miller - 2004 - Journal of Symbolic Logic 69 (2):555 - 584.

About and Around Computing Over the Reals.Solomon Feferman - unknown

Undecidability in Rn: Riddled basins, the KAM tori, and the stability of the solar system.Matthew W. Parker - 2003 - Philosophy of Science 70 (2):359-382.

View all 11 citations / Add more citations

References found in this work

Nicht konstruktiv beweisbare sätze der analysis.Ernst Specker - 1949 - Journal of Symbolic Logic 14 (3):145-158.

Recursive analysis.R. L. Goodstein - 1961 - Mineola, N.Y.: Dover Publications.

Notation Systems and Recursive Ordered Fields.Yiannis N. Moschovakis - 1966 - Journal of Symbolic Logic 31 (4):650-651.

Computable Functionals.A. Grzegorczyk - 1959 - Journal of Symbolic Logic 24 (1):50-51.

The Primitive Recursive Analysis of Ordinary Differential Equations and the Complexity of their Solutions.John Cleave - 1974 - Journal of Symbolic Logic 39 (2):345-346.

View all 8 references / Add more references