A stronger Kolmogorov zero-one law for resource-bounded measure

Author： Dai J.J.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.292, Iss.3, 2003-01, pp. : 723-732

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

An improved zero-one law for algorithmically random sequences

By Kautz S.M.  

Theoretical Computer Science, Vol. 191, Iss. 1, 1998-01 ,pp. : 185-192

Elsevier

Access to resources Recommend Favorite

On resource-bounded instance complexity

By Fortnow L.   Kummer M.  

Theoretical Computer Science, Vol. 161, Iss. 1, 1996-07 ,pp. : 123-140

Elsevier

Access to resources Recommend Favorite

Executable specifications of resource-bounded agents

By Fisher Michael  

Autonomous Agents and Multi-Agent Systems, Vol. 21, Iss. 3, 2010-11 ,pp. : 368-396

Springer Publishing Company

Access to resources Recommend Favorite

Co-operative scheduling for a resource-bounded multiagent planning system

By Mouaddib Abdel-illah  

Journal of Experimental & Theoretical Artificial Intelligence, Vol. 16, Iss. 2, 2004-04 ,pp. : 57-71

Taylor & Francis Ltd

Access to resources Recommend Favorite

Resource-bounded Relational Reasoning:Induction and Deduction Through Stochastic Matching

By Sebag M.  

Machine Learning, Vol. 38, Iss. 1-2, 2000-01 ,pp. : 41-62

Springer Publishing Company

Access to resources Recommend Favorite