Pregled bibliografske jedinice broj: 1104623
Dense computability structures
Dense computability structures // Journal of complexity, 65 (2021), 101543, 24 doi:10.1016/j.jco.2020.101543 (međunarodna recenzija, članak, znanstveni)
CROSBI ID: 1104623 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Dense computability structures
Autori
Burnik, Konrad ; Iljazović, Zvonko
Izvornik
Journal of complexity (0885-064X) 65
(2021);
101543, 24
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
Computable metric space ; Computability structure ; Dense computability structure ; Maximal computability structure
Sažetak
We examine computability structures on a metric space and the relationships between maximal, separable and dense computability structures. We prove that in a computable metric space which has the effective covering property and compact closed balls for a given computable sequence which is a metric basis there exists a unique maximal computability structure which contains that sequence. Furthermore, we prove that each maximal computability structure on a convex subspace of Euclidean space is dense. We also examine subspaces of Euclidean space on which each dense maximal computability structure is separable and prove that spheres, boundaries of simplices and conics are such spaces.
Izvorni jezik
Engleski
Znanstvena područja
Matematika, Računarstvo
POVEZANOST RADA
Projekti:
HRZZ-IP-2018-01-7459 - Izračunljive strukture, odlučivost i složenost (CompStruct) (Iljazović, Zvonko, HRZZ - 2018-01) ( CroRIS)
Ustanove:
Prirodoslovno-matematički fakultet, Matematički odjel, Zagreb,
Prirodoslovno-matematički fakultet, Zagreb
Profili:
Zvonko Iljazović
(autor)
Citiraj ovu publikaciju:
Časopis indeksira:
- Current Contents Connect (CCC)
- Web of Science Core Collection (WoSCC)
- Science Citation Index Expanded (SCI-EXP)
- SCI-EXP, SSCI i/ili A&HCI
- Scopus