Naslov
Co-Recursively Enumerable Triods with Computable Endpoints

Autori
Iljazović, Zvonko

Izvornik
International journal on computer science and engineering (2229-5631) 02 (2010), 03; 799-803

Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni

Ključne riječi
recursive set; co-recursively enumerable set; triod

Sažetak
Recursive sets in the Euclidean space are those sets which can 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 co-recursively enumerable, however the converse is not true in general. In this paper we investigate the subsets of the Euclidean space called triods and we prove that each co-r.e. triod with computable endpoints is recursive.

Izvorni jezik
Engleski

Znanstvena područja
Matematika, Računarstvo

POVEZANOST RADA