Semicomputable geometry - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2018

Semicomputable geometry


Computability and semicomputability of compact subsets of the Euclidean spaces are important notions, that have been investigated for many classes of sets including fractals (Julia sets, Mandelbrot set) and objects with geometrical or topological constraints (embedding of a sphere). In this paper we investigate one of the simplest classes, namely the filled triangles in the plane. We study the properties of the parameters of semicomputable triangles, such as the coordinates of their vertices. This problem is surprisingly rich. We introduce and develop a notion of semicomputability of points of the plane which is a generalization in dimension 2 of the left-c.e. and right-c.e. numbers. We relate this notion to Solovay reducibility. We show that semicomputable triangles admit no finite parametrization, for some notion of parametrization.
Fichier principal
Vignette du fichier
fullversion (1).pdf (351.62 Ko) Télécharger le fichier

Dates and versions

hal-01770562 , version 1 (19-04-2018)


  • HAL Id : hal-01770562 , version 1


Mathieu Hoyrup, Diego Nava Saucedo, Donald M Stull. Semicomputable geometry. ICALP 2018 - 45th International Colloquium on Automata, Languages, and Programming, Jul 2018, Prague, Czech Republic. ⟨hal-01770562⟩
180 View
166 Download


Gmail Mastodon Facebook X LinkedIn More