Computability of Minimizers and Separating Hyperplanes

Mathematical Logic Quarterly 42 (1):564-568 (1996)
  Copy   BIBTEX

Abstract

We prove in recursive analysis an existence theorem for computable minimizers of convex computable continuous real-valued functions, and a computable separation theorem for convex sets in ℝm

Categories

Keywords

Reprint years

DOI

10.1002/malq.19960420144

Links

PhilArchive



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

External links

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

Through your library

My notes

Similar books and articles

Computability of Real Numbers by Using a Given Class of Functions in the Set of the Natural Numbers.Dimiter Skordev - 2002 - Mathematical Logic Quarterly 48 (S1):91-106.
Monotonically Computable Real Numbers.Robert Rettinger, Xizhong Zheng, Romain Gengler & Burchard von Braunmühl - 2002 - Mathematical Logic Quarterly 48 (3):459-479.
Computability and continuity in computable metric partial algebras equipped with computability structures.Fredrik Dahlgren - 2004 - Mathematical Logic Quarterly 50 (4):486.
Computability and recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
Church's Thesis and the Conceptual Analysis of Computability.Michael Rescorla - 2007 - Notre Dame Journal of Formal Logic 48 (2):253-280.
Alan Turing and the foundations of computable analysis.Guido Gherardi - 2011 - Bulletin of Symbolic Logic 17 (3):394-430.
On degree-preserving homeomorphisms between trees in computable topology.Iraj Kalantari & Larry Welch - 2008 - Archive for Mathematical Logic 46 (7-8):679-693.
Primitive recursive real numbers.Qingliang Chen, Kaile Kaile & Xizhong Zheng - 2007 - Mathematical Logic Quarterly 53 (4):365-380.
On a complexity-based way of constructivizing the recursive functions.F. W. Kroon & W. A. Burkhard - 1990 - Studia Logica 49 (1):133 - 149.
Computability & unsolvability.Martin Davis - 1958 - New York: Dover Publications.
Computability and Logic.George Boolos, John Burgess, Richard P. & C. Jeffrey - 1980 - New York: Cambridge University Press. Edited by John P. Burgess & Richard C. Jeffrey.
Recursive Approximability of Real Numbers.Xizhong Zheng - 2002 - Mathematical Logic Quarterly 48 (S1):131-156.
WHAT IS. . . a Halting Probability?Cristian S. Calude - 2010 - Notices of the AMS 57:236-237.
Computable Real‐Valued Functions on Recursive Open and Closed Subsets of Euclidean Space.Qing Zhou - 1996 - Mathematical Logic Quarterly 42 (1):379-409.

Analytics

Added to PP
2013-12-01

Downloads
11 (#1,110,001)

6 months
4 (#790,687)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

Introduction to metamathematics.Stephen Cole Kleene - 1952 - Groningen: P. Noordhoff N.V..
Introduction to Metamathematics.Ann Singleterry Ferebee - 1968 - Journal of Symbolic Logic 33 (2):290-291.
Foundations of Constructive Mathematics.Michael J. Beeson - 1987 - Studia Logica 46 (4):398-399.

Add more references