<!DOCTYPE html>
<html>
<head>
<title>Set Theory and Analysis</title>
</head>
<body>
<p>
Tuesday, 21 April 2026 - 10:00 to 11:30 <br />
Place: IM, konÃrna
</p>
<p>
Speaker: Nicanor Carrasco Vargas, Jagiellonian university, Krakow<br />
Title: Topological dynamical systems with a computable copy
</p>
<p class="ql-ed">
Abstract <br />
<p>While computability theory or recursion theory was classically introduced in the countable world, many concepts can be extended to Polish spaces. One obtains effective versions of concepts like continuity, open, closed, compact, and so on. A natural problem in this area is determining how computable are classic theorems from analysis and topology. This talk will be about a computable version of the classic result that every topological dynamical system is the topological factor of a zero-dimensional system. Under some conditions, this computable statement allows us to prove that some topological dynamical systems are topological factors of subshifts of finite type, by simply proving that they have a computable copy.</p><p>This is joint work with S. Barbieri and C. Rojas.</p>
</p>
<p>
For more information see the seminar web page at <br />
https://www.math.cas.cz/index.php/events/seminar/6
</p>
<p>
Set Theory and Analysis mailing list <br />
settfa@math.cas.cz <br />
https://list.math.cas.cz/listinfo/settfa@math.cas.cz
</p>
</body>
</html>