## Abstract The computability of reals was introduced by Alan Turing [20] by means of decimal representations. But the equivalent notion can also be introduced accordingly if the binary expansion, Dedekind cut or Cauchy sequence representations are considered instead. In other words, the computabil
Computability of Minimizers and Separating Hyperplanes
β Scribed by Kam-Chau Wong
- Publisher
- John Wiley and Sons
- Year
- 1996
- Tongue
- English
- Weight
- 253 KB
- Volume
- 42
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
β¦ Synopsis
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^.
Mathematics Subject Classification: 03F60, 52A40.
π SIMILAR VOLUMES
Let n and k be fixed positive integers. A collection C of k-sets of [n] is a completely separating system if, for all distinct i, j # [n], there is an S # C for which i # S and j Γ S. Let R(n, k) denote the minimum size of such a C. Our results include showing that if n k is a sequence with k< 0, th
We study amoebas associated with Laurent polynomials and obtain new results regarding the number and structure of the connected components of the complement of the amoeba. We also investigate the associated Laurent determinant. In the case of a hyperplane arrangement we perform explicit computations