Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Michael Yampolsky

dblp:93/777 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
3 papers
Computational complexity · 76% Mathematical optimization · 24%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational complexity › computability theory
uncomputability
0.522020
How to lose at Monte Carlo: a simple dynamical system whose typical statistical behavior is non-computable · STOC 2020
Constructing non-computable Julia sets · STOC 2007
Computational complexity
computability theory
0.412020
How to lose at Monte Carlo: a simple dynamical system whose typical statistical behavior is non-computable · STOC 2020
Mathematical optimization
dynamical systems
0.412020
How to lose at Monte Carlo: a simple dynamical system whose typical statistical behavior is non-computable · STOC 2020
Computational complexity
undecidability
0.312018
Non computable Mandelbrot-like sets for a one-parameter complex family · Inf. Comput. 2018

Methods — techniques the papers use, named apart from their topics

monte carlo method · 0.4logistic maps · 0.4complex analysis · 0.3complex dynamics · 0.1
YearPublicationVenuePosition
2020 How to lose at Monte Carlo: a simple dynamical system whose typical statistical behavior is non-computable
abstract
We consider the simplest non-linear discrete dynamical systems, given by the logistic maps f a (x)=ax(1−x) of the interval [0,1]. We show that there exist real parameters a∈ (0,4) for which almost every orbit of f a has the same statistical distribution in [0,1], but this limiting distribution is not Turing computable. In particular, the Monte Carlo method cannot be applied to study these dynamical systems.
Cristobal Rojas, Michael Yampolsky
STOC2
2018 Non computable Mandelbrot-like sets for a one-parameter complex family
Daniel Coronel, Cristobal Rojas, Michael Yampolsky
Inf. Comput.3
2007 Constructing non-computable Julia sets
abstract
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were doubts as to whether specific examples of parameters with non-computable Julia sets could be constructed. It was also unknown whether the non-computability proof can be extended to the filled Julia sets. In this paper we give an answer to both of these questions, which were the main open problems concerning the computability of polynomial Julia sets.
Mark Braverman, Michael Yampolsky
STOC2