On Lack of Effectiveness in Semi-algebraic Geometry
It is a fact and a motivation of this meeting, that many interesting constructions in semi-algebraic geometry can be effectively done, that is, roughly speaking, by means of algorithms with computably bounded complexity. It is also a fact that semi-algebraic objects have some effective finiteness properties. Hence the interest in finding reasonably ”fast” algorithms or “sharp” bounds. Neverthless, on the other side of the mainstream, one can be interested in essential lack of effectiveness or finiteness. We are going to see some examples and to discuss shortly some possible basic sources of such a lack.
KeywordsSimplicial Complex Computable Function Topological Type Secant Approximation Whitney Stratification
Unable to display preview. Download preview PDF.
- [ABB]F. Acquistapace, R. Benedetti, F. Broglia, Effectiveness — non Effectiveness in semialgebraic and P. L. geometry, Inventiones Math. (to appear).Google Scholar
- [BS]R. Benedetti, M. Shiota, Finiteness of semialgebraic types of polynomial functions, to appear.Google Scholar
- [M]J. R. Munkres, “Elementary Differential Topology,” Am. math. Studies, n.61, Princeton Univ. Press, 1968.Google Scholar
- [Na]A. Nabutovski, Isotopies and non-recursive functions in real algebraic geometry, in “Real analytic and algebraic geometry,” Springer Lect. Notes in Math. n. 1420, 1990.Google Scholar
- [T]R. Thorn, La stabilité topologique des applications polynomiales, Einseign. Math. 8 (1962), 24–33.Google Scholar