Dubrovnik VI – Geometric Topology September 30 – October 7, 2007
	ABSTRACTS	pdf-version of this abstract

Zvonko Iljazović
University of Zagreb, Croatia

Weakly computable arcs

The title refers to the following situation: Suppose $S$ is weakly computable set in $\R^n$ such that $\R^n\setminus S$ has finitely many components. Under what conditions $S$ becomes computable set? The following terminology is used. One says that $S$ is weakly computable if there exists a computable function $f:\R^n\to\R$ such that $S=f^{-1}(\{0\})$ and computable if $S$ is closed in $\R^n$ and the function $d_S:\R^n \to \R$, $d_S(x)=d(x,S)$ is computable.

The talk will present results obtained on this subject.