Approximation by Enumerable Sets

R. M. Redheffer

Type: Article

Publication Date: 1955-10-01

Citations: 1

DOI: https://doi.org/10.2307/2307251

Similar Works

Action	Title	Year	Authors
+	A class of enumerable sets	1999	An. A. Muchnik Семен Ефимович Посицельский
+	Approximation of bounded sets	1982	J.H Freilich H.W McLaughlin
+	Completely enumerated sets	1970	Yu. L. Ershov
+	Computational complexity of recursively enumerable sets	1982	Robert I. Soare
+	Computably enumerable sets and related issues	2012	I. A. Lavrov
+	Algorithms for Approximation	2006	Armin Iske Jeremy Levesley
+	Algorithms for approximation	1987
+	Algorithms for approximation	1986	E. W. Cheney
+	Algorithms for approximation	1987	J. C. Mason M. G. Cox
+ PDF Chat	Intersective sets and Diophantine approximation	2004	Yann Bugeaud
+	Approximation Algorithms	2008	Ming‐Yang Kao
+	Approximation Algorithms	1999
+	Approximation Algorithms	2021	Sachi Nandan Mohanty Pabitra Kumar Tripathy Suneeta Satpathy
+	Approximation Algorithms	2023
+	Diophantine approximation and Cantor sets	2008	Yann Bugeaud
+	Algorithms for chebychev approximation over finite sets	1972	David F. McAllister
+	Small sets in best approximation theory	2010	J. P. Revalski N. V. Zhivkov
+	Approximation of Functions and Sets	2014	R. M. Dudley
+ PDF Chat	Bounded approximation by polynomials	1963	L. A. Rubel A. L. Shields
+ PDF Chat	Approximate Set Union via Approximate Randomization	2020	Bin Fu Pengfei Gu Yuming Zhao

Action	Title	Year	Authors
+ PDF Chat	Sur les propriétés différentielles des fonctions dont les points de continuité forment un ensemble frontière partout dense	1962	Solomon Marcus

Action	Title	Year	Authors