Biography

https://www.linkedin.com/in/margret-tembo/?originalSubdomain=gh

Abstract

We consider a natural computational problem: does every point of a given polyhedron escape the polyhedron under iteration of a given matrix? Tiwari (2004) has shown this problem to be decidable when the matrix and polyhedron are given by rational data. I will show that the problem is maximally partially decidable over arbitrary real data.