Yampolsky, Michael
- Computability of Julia sets
2006/10/10 by Mark Braverman, Braverman, Mark, Michael Yampolsky +1 · 4 citations
Computer Science · Mathematics · #37F50 #Computability, Logic, AI Algorithms #Dynamical Systems (math.DS) #FOS: Mathematics #Mathematical Dynamics and Fractals #semigroups and automata theory
- Almost every real quadratic polynomial has a poly-time computable Julia set
2017/02/19 by Dudko, Artem, Yampolsky, Michael · 2 citations
#Dynamical Systems (math.DS) #FOS: Mathematics
- Mating Siegel Quadratic Polynomials
1998/08/03 by Michael Yampolsky, Saeed Zakeri, Yampolsky, Michael +1 · 1 citation
Mathematics · #Advanced Combinatorial Mathematics #Geometric and Algebraic Topology #Mathematical Dynamics and Fractals #math.DS
- Non-computable Julia sets
2004/06/22 by Braverman, Mark, Yampolsky, Michael · 1 citation
#37F50 #68Q17 #Computational Complexity (cs.CC) #Dynamical Systems (math.DS) #FOS: Computer and information sciences #FOS: Mathematics
- Modeling the variability of shapes of a human placenta
2007/11/06 by Michael Yampolsky, Carolyn M. Salafia, Yampolsky, Michael +9 · 1 citation
Mathematics · Computer Science · #Morphological variations and asymmetry #Image Retrieval and Classification Techniques #Graph Theory and Algorithms
- Thurston equivalence to a rational map is decidable
2010/09/28 by Bonnot, Sylvain, Braverman, Mark, Yampolsky, Michael · 1 citation
#03D80 #37F20 #Dynamical Systems (math.DS) #FOS: Mathematics #Geometric Topology (math.GT) #Logic (math.LO)
- Constructive geometrization of Thurston maps and decidability of\n Thurston equivalence
2013/10/05 by Nikita Selinger, Michael Yampolsky, Selinger, Nikita +1 · 1 citation
Mathematics · #37F20 #37F30 #57M12 #Dynamical Systems (math.DS) #FOS: Mathematics #Geometric and Algebraic Topology #Homotopy and Cohomology in Algebraic Topology #Mathematical Dynamics and Fractals
- Computable geometric complex analysis and complex dynamics
2017/03/19 by Cristóbal Rojas, Rojas, Cristobal, Michael Yampolsky +1 · 1 citation
Computer Science · Mathematics · #Complex Variables (math.CV) #FOS: Mathematics #Geometric and Algebraic Topology #Mathematical Dynamics and Fractals #Topological and Geometric Data Analysis
- Centralizers in Mapping Class Group and decidability of Thurston Equivalence
2019/02/05 by Rafi, Kasra, Selinger, Nikita, Yampolsky, Michael · 1 citation
#FOS: Mathematics #Geometric Topology (math.GT)
- Real quadratic Julia sets can have arbitrarily high complexity
2019/04/11 by Rojas, Cristobal, Yampolsky, Michael · 1 citation
#68Q17 and 37E05 #Computational Complexity (cs.CC) #Dynamical Systems (math.DS) #FOS: Computer and information sciences #FOS: Mathematics
- On computational complexity of Cremer Julia sets
2019/07/25 by Dudko, Artem, Yampolsky, Michael · 1 citation
#Dynamical Systems (math.DS) #FOS: Mathematics
- Computable Caratheodory Theory
2012/09/26 by Ilia Binder, Binder, Ilia, Cristóbal Rojas +3 · 1 citation
Computer Science · Mathematics · #03F60 #30C35 #Cellular Automata and Applications #Complex Variables (math.CV) #Computability, Logic, AI Algorithms #FOS: Mathematics #Mathematical Dynamics and Fractals
- Computability in Harmonic Analysis
2020/11/19 by Binder, Ilia, Glucksam, Adi, Rojas, Cristobal +1 · 1 citation
#03D80 #30C85 #31A15 #Classical Analysis and ODEs (math.CA) #Complex Variables (math.CV) #FOS: Mathematics #Logic (math.LO)
- Ulam meets Turing: constructing quadratic maps with non-computable SRB measures
2024/11/26 by Cristóbal Rojas, Rojas, Cristóbal, Michael Yampolsky +1 · 2 citations
Computer Science · Mathematics · #68Q17 and 37E05 #Cellular Automata and Applications #Computability, Logic, AI Algorithms #Dynamical Systems (math.DS) #FOS: Mathematics #Mathematical Dynamics and Fractals