Andrej Muchnik

From MaRDI portal
Person:235569

Available identifiers

zbMath Open muchnik.andrej-aWikidataQ23072507 ScholiaQ23072507MaRDI QIDQ235569

List of research outcomes





PublicationDate of PublicationType
Lattice of definability in the order of rational numbers2020-08-31Paper
Algorithmic aspects of decomposition and equivalence of finite-valued transducers2016-03-18Paper
On joint conditional complexity (entropy)2014-08-04Paper
Kolmogorov complexity and cryptography2014-08-04Paper
Determinization of ordinal automata2013-11-25Paper
https://portal.mardi4nfdi.de/entity/Q49107092013-03-19Paper
Limit complexities revisited [once more]2012-04-01Paper
Stability of properties of Kolmogorov complexity under relativization2011-01-25Paper
Limit complexities revisited2010-10-06Paper
Sequences close to periodic2010-04-08Paper
Algorithmic randomness and splitting of supermartingales2009-10-20Paper
A Random Oracle Does Not Help Extract the Mutual Information2009-02-03Paper
An improvement of Kolmogorov's estimates related to random number generators and a definition of randomness in terms of complexity2007-10-22Paper
Non-reducible descriptions for conditional Kolmogorov complexity2007-09-28Paper
On semimeasures predicting Martin-Löf random sequences2007-09-18Paper
Shannon Entropy vs. Kolmogorov Complexity2007-05-02Paper
Theory and Applications of Models of Computation2007-04-30Paper
Effective bounds for convergence, descriptive complexity, and natural examples of simple and hypersimple sets2006-08-16Paper
Enumerations of the Kolmogorov function2006-08-03Paper
https://portal.mardi4nfdi.de/entity/Q53174212005-09-16Paper
Automata, Languages and Programming2005-08-24Paper
Algorithmic Learning Theory2005-08-18Paper
On the role of the law of large numbers in the theory of randomness2005-08-17Paper
https://portal.mardi4nfdi.de/entity/Q44313952003-10-21Paper
Almost periodic sequences.2003-08-17Paper
One application of real-valued interpretation of formal power series.2003-08-17Paper
The definable criterion for definability in Presburger arithmetic and its applications.2003-08-17Paper
Conditional complexity and codes2002-03-03Paper
Kolmogorov entropy in the context of computability theory2002-03-03Paper
Upper semi-lattice of binary strings with the relation ``\(x\) is simple conditional to \(y\)2002-03-03Paper
A class of enumerable sets2001-07-26Paper
Mathematical metaphysics of randomness1999-01-12Paper
On common information1999-01-12Paper
https://portal.mardi4nfdi.de/entity/Q42090951998-11-09Paper
A general method to construct oracles realizing given relationships between complexity classes1997-02-27Paper
Lower Limits of Frequencies in Computable Sequences and Relativized a Priori Probability1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37490461985-01-01Paper

Research outcomes over time

This page was built for person: Andrej Muchnik