Co-Recursively Enumerable Triods with Computable Endpoints

Journal Title: International Journal on Computer Science and Engineering - Year 2010, Vol 2, Issue 3

Abstract

Recursive sets in the Euclidean space are those sets which an be effectively approximated by finitely many points for an arbitrary given precision. On the other hand, co-recursively enumerable sets are those sets whose complements can be effectively covered by open balls. If a set is recursive, then it is orecursively enumerable, however the converse is not true in general. In this paper we investigate the subsets of the uclidean space called triods and we prove that each co-r.e. triod with computable endpoints is recursive.

Authors and Affiliations

Zvonko Iljazović

Keywords

Related Articles

A NOVEL APPROACH FOR PATTERN ANALYSIS FROM HUGE DATAWAREHOUSE

Due to the tremendous growth of data and large databases, efficient extraction of required data has become a challenging task. This paper propose a novel approach for knowledge discovery from huge unlabeled temporal data...

CP-Miner : A hybrid Approach for Colorectal Polyp Detection

Computed Tomography Colonography (CTC) is the new eneration technique for detecting colorectal polyps using volumetric CT data combined with Computer Aided Detection (CAD) system. The aim of this paper is to detail the i...

Global Cluster Cooperation Strategy in Mobile Ad Hoc Networks

MANETs or mobile ad hoc networks are a form of wireless networks which do not require a base station for providing network connectivity. Mobile ad hoc networks have many characteristics which distinguish them from other...

Developing a Mobile Adaptive Test (MAT) in an M-Learning Environment for Android Based 3G Mobile Devices

M-Learning (e-Learning through mobile device) is gaining its importance worldwide among the Learning Community owing to the ubiquitous and powerful computing nature of the Mobile Devices. In an M-Learning environment, St...

MAX-MIN ANT OPTIMIZER FOR PROBLEM OF UNCERTAINITY

The real life problems deal with imperfectly specified nowledge and some degree of imprecision, uncertainty or nconsistency is embedded in the problem specification. The well-founded theory of fuzzy sets is a special w...

Download PDF file
  • EP ID EP124229
  • DOI -
  • Views 104
  • Downloads 0

How To Cite

Zvonko Iljazović (2010). Co-Recursively Enumerable Triods with Computable Endpoints. International Journal on Computer Science and Engineering, 2(3), 799-803. https://europub.co.uk/articles/-A-124229