Andrej Muchnik

Available identifiers

zbMath Open muchnik.andrej-aWikidataQ23072507 ScholiaQ23072507MaRDI QIDQ235569

List of research outcomes

Publication	Date of Publication	Type
Lattice of definability in the order of rational numbers	2020-08-31	Paper
Algorithmic aspects of decomposition and equivalence of finite-valued transducers	2016-03-18	Paper
On joint conditional complexity (entropy)	2014-08-04	Paper
Kolmogorov complexity and cryptography	2014-08-04	Paper
Determinization of ordinal automata	2013-11-25	Paper
https://portal.mardi4nfdi.de/entity/Q4910709	2013-03-19	Paper
Limit complexities revisited [once more]	2012-04-01	Paper
Stability of properties of Kolmogorov complexity under relativization	2011-01-25	Paper
Limit complexities revisited	2010-10-06	Paper
Sequences close to periodic	2010-04-08	Paper
Algorithmic randomness and splitting of supermartingales	2009-10-20	Paper
A Random Oracle Does Not Help Extract the Mutual Information	2009-02-03	Paper
An improvement of Kolmogorov's estimates related to random number generators and a definition of randomness in terms of complexity	2007-10-22	Paper
Non-reducible descriptions for conditional Kolmogorov complexity	2007-09-28	Paper
On semimeasures predicting Martin-Löf random sequences	2007-09-18	Paper
Shannon Entropy vs. Kolmogorov Complexity	2007-05-02	Paper
Theory and Applications of Models of Computation	2007-04-30	Paper
Effective bounds for convergence, descriptive complexity, and natural examples of simple and hypersimple sets	2006-08-16	Paper
Enumerations of the Kolmogorov function	2006-08-03	Paper
https://portal.mardi4nfdi.de/entity/Q5317421	2005-09-16	Paper
Automata, Languages and Programming	2005-08-24	Paper
Algorithmic Learning Theory	2005-08-18	Paper
On the role of the law of large numbers in the theory of randomness	2005-08-17	Paper
https://portal.mardi4nfdi.de/entity/Q4431395	2003-10-21	Paper
Almost periodic sequences.	2003-08-17	Paper
One application of real-valued interpretation of formal power series.	2003-08-17	Paper
The definable criterion for definability in Presburger arithmetic and its applications.	2003-08-17	Paper
Conditional complexity and codes	2002-03-03	Paper
Kolmogorov entropy in the context of computability theory	2002-03-03	Paper
Upper semi-lattice of binary strings with the relation ``\(x\) is simple conditional to \(y\)	2002-03-03	Paper
A class of enumerable sets	2001-07-26	Paper
Mathematical metaphysics of randomness	1999-01-12	Paper
On common information	1999-01-12	Paper
https://portal.mardi4nfdi.de/entity/Q4209095	1998-11-09	Paper
A general method to construct oracles realizing given relationships between complexity classes	1997-02-27	Paper
Lower Limits of Frequencies in Computable Sequences and Relativized a Priori Probability	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3749046	1985-01-01	Paper

Research outcomes over time

This page was built for person: Andrej Muchnik