Share Your Research, Maximize Your Social Impacts
Computable points in co-c.e. polyhedra
Journal: Global Journal of Mathematics (GJM) (Vol.4, No. 1)Publication Date: 2015-09-01
Authors : Zvonko Iljazovic; Marijana Bradas;
Page : 374-378
Keywords : Computable point; Co-c.e. set; Polyhedron;
Source : Download
Find it from : Google Scholar
Abstract
Co-c.e. sets need not be computable, moreover they need not contain any computable point. Co-c.e. polyhedra also do not have to be computable. However, each co-c.e. polyhedron P contains computable points, in fact we prove that computable points are dense in P.
Other Latest Articles
- HSGS Method for the Finite Element Solution of Two-Dimensional Helmholtz Equations
- Economical Scheme for Computing the Permanent of a Matrix
- P-Labeling (Nearly Graceful Labeling) of Cycles with Parallel Pk Chords
- On a nonlocal boundary value problem of a coupled system of functional integro-differential equations
- Existence of a unique solution of a coupled system of integro - differential equations with nonlocal conditions
Last modified: 2015-08-26 16:51:11