Period of time： 2014年1期
Publisher： Springer Publishing Company
Founded in： 1966
Total resources： 31
ISSN： 1432-4350
Subject： O1 Mathematics
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Theory of Computing Systems,volume 52,issue 1
Menu
Computability, Complexity and Randomness
Theory of Computing Systems,volume 52,issue 1 , Vol. 52, Iss. 1, 2013-01 , pp.
Access to resources
Recommend
Maximal Pairs of Computably Enumerable Sets in the Computably Lipschitz Degrees
By Ambos-Spies Klaus in (2013)
Theory of Computing Systems,volume 52,issue 1 , Vol. 52, Iss. 1, 2013-01 , pp.On the Gap Between Trivial and Nontrivial Initial Segment Prefix-Free Complexity
Theory of Computing Systems,volume 52,issue 1 , Vol. 52, Iss. 1, 2013-01 , pp.Effective Randomness of Unions and Intersections
Theory of Computing Systems,volume 52,issue 1 , Vol. 52, Iss. 1, 2013-01 , pp.Martin-Löf Randomness, Invariant Measures and Countable Homogeneous Structures
Theory of Computing Systems,volume 52,issue 1 , Vol. 52, Iss. 1, 2013-01 , pp.Time-Bounded Kolmogorov Complexity and Solovay Functions
Theory of Computing Systems,volume 52,issue 1 , Vol. 52, Iss. 1, 2013-01 , pp.By López-Valdés María in (2013)
Theory of Computing Systems,volume 52,issue 1 , Vol. 52, Iss. 1, 2013-01 , pp.Characterization of Kurtz Randomness by a Differentiation Theorem
Theory of Computing Systems,volume 52,issue 1 , Vol. 52, Iss. 1, 2013-01 , pp.Using Ideas of Kolmogorov Complexity for Studying Biological Texts
Theory of Computing Systems,volume 52,issue 1 , Vol. 52, Iss. 1, 2013-01 , pp.Axiomatizing Kolmogorov Complexity
By Taveneaux Antoine in (2013)
Theory of Computing Systems,volume 52,issue 1 , Vol. 52, Iss. 1, 2013-01 , pp.
Previous
Next