Keyword

program-size complexity

Description: Program-size complexity is a measure of the shortest program or description needed to generate an object, central to algorithmic information theory.
Wikidata ID: wiki/Q1456811
OpenAlex ID: keywords/program-size-complexity
1975 · Gregory J. Chaitin · Journal of the ACM · 851
2000 · Paul W. K. Rothemund, Erik Winfree · ACM Symposium on Theory of Computing (STOC) · 422
2001 · Leonard Adleman, Qi Cheng, et al. · ACM Symposium on Theory of Computing (STOC) · 229
2000 · Paul W. K. Rothemund, Erik Winfree · CaltechAUTHORS (California Institute of Technology) · 216
1976 · Gregory J. Chaitin · Theoretical Computer Science · 89
2010 · Laboratoire d'Informatique Fondamentale de Lille, Hector Zenil, et al. · Complex Systems · 82
2007 · Gregory J Chaitin, Paul Davies · WORLD SCIENTIFIC eBooks · 43
2007 · John Tromp · WORLD SCIENTIFIC eBooks · 42
1991 · Ker-I Ko · SIAM Journal on Computing · 38
2006 · Cristian S. Calude, Michael A. Stay · Information and Computation · 34
2020 · Pierre-Étienne Meunier, Damien Regnault, et al. · ACM Symposium on Theory of Computing (STOC) · 20
2008 · Tadaki, Kohtaro · arXiv (Cornell University) · 20
2003 · Gregory Chaitin · Lecture notes in computer science · 15
1995 · Gregory J. Chaitin, Asat Arslanov, et al. · ResearchSpace (University of Auckland) · 15
2008 · Kohtaro Tadaki · IEEE International Symposium on Information Theory (ISIT) · 13
2007 · Damien Woods, Turlough Neary · Lecture notes in computer science · 13
2003 · Chaitin, G. J. · arXiv (Cornell University) · 13
2011 · Joosten, Joost J., Soler-Toscano, Fernando, et al. · International journal of unconventional computing · 12
2003 · J.H. Lutz · Structure in Complexity Theory Annual Conference · 11
1997 · François Denis, Rémi Gilleron · Lecture notes in computer science · 11
2008 · Kohtaro Tadaki · Lecture notes in computer science · 10
2009 · Kohtaro Tadaki · Lecture notes in computer science · 9
Works count: 116
Citation count: 2,437
Year
Topic
Type