{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T02:32:35Z","timestamp":1760236355479,"version":"build-2065373602"},"reference-count":33,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2021,11,16]],"date-time":"2021-11-16T00:00:00Z","timestamp":1637020800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council","doi-asserted-by":"publisher","award":["RGPIN 2016-03661"],"award-info":[{"award-number":["RGPIN 2016-03661"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>We discuss how to assess computationally the aesthetic value of \u201csmall\u201d objects, namely those that have short digital descriptions. Such small objects still matter: they include headlines, poems, song lyrics, short musical scripts and other culturally crucial items. Yet, small objects are a confounding case for our recent work adapting ideas from algorithmic information theory (AIT) to the domain of computational creativity, as they cannot be either logically deep or sophisticated following the traditional definitions of AIT. We show how restricting the class of models under analysis can make it the case that we can still separate high-quality small objects from ordinary ones, and discuss the strengths and limitations of our adaptation.<\/jats:p>","DOI":"10.3390\/e23111524","type":"journal-article","created":{"date-parts":[[2021,11,16]],"date-time":"2021-11-16T11:32:03Z","timestamp":1637062323000},"page":"1524","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Problem of Small Objects"],"prefix":"10.3390","volume":"23","author":[{"given":"Daniel G.","family":"Brown","sequence":"first","affiliation":[{"name":"David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, ON N2L 3G1, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4850-661X","authenticated-orcid":false,"given":"Tiasa","family":"Mondol","sequence":"additional","affiliation":[{"name":"Untether AI, Toronto, ON M5V 2H2, Canada"}]}],"member":"1968","published-online":{"date-parts":[[2021,11,16]]},"reference":[{"key":"ref_1","unstructured":"Shinkokai, K.B. (1948). Introduction to Classic Japanese Literature, Kokusai Bunka Shinkokai."},{"key":"ref_2","unstructured":"McGraw, H., DeLong, R.L., Smith, T., Hamrick, R.C., Sheppard, J., Ivey, D., and Wootten, T.L. (1991). The Sacred Harp, Sacred Harp Publishing Company. [1991st ed.]."},{"key":"ref_3","unstructured":"(2021, September 21). Madonna. Papa Don\u2019t Preach. Available online: https:\/\/genius.com\/Madonna-papa-dont-preach-lyrics."},{"key":"ref_4","unstructured":"(Variety, 1929). Wall Street Lays an Egg, Variety."},{"key":"ref_5","unstructured":"Van Riper, F. (New York Daily News, 1975). Ford to City: Drop Dead, New York Daily News."},{"key":"ref_6","unstructured":"Musetto, V. (New York Post, 1983). Headless Body in Topless Bar, New York Post."},{"key":"ref_7","unstructured":"Williams, W.C. (1923). Spring and All, Contact Editions."},{"key":"ref_8","unstructured":"Williams, W.C. (1991). The Collected Poems: Volume I, 1909\u20131939, New Directions."},{"key":"ref_9","first-page":"201","article-title":"A Few Don\u2019ts by an Imagiste","volume":"1","author":"Pound","year":"1913","journal-title":"Poetry"},{"key":"ref_10","unstructured":"King, R. (2010). English Church Music Volume 1: Anthems and Motets, Oxford University Press."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Willis, J. (2016). Church Music and Protestantism in Post-Reformation England: Discourses, Sites and Identities, Routledge.","DOI":"10.4324\/9781315572031"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Carl, R. (2009). Terry Riley\u2019s \u201cIn C\u201d, Oxford University Press.","DOI":"10.1093\/acprof:oso\/9780195325287.001.0001"},{"key":"ref_13","unstructured":"P\u00e4rt, A. (1976). F\u00fcr Alina, Universal Edition."},{"key":"ref_14","unstructured":"Cage, J. (1952). 4\u203233\u2033, Edition Peters."},{"key":"ref_15","unstructured":"Gann, K. (2011). No Such Thing as Silence: John Cage\u2019s 4\u203233\u2033, Yale University Press."},{"key":"ref_16","unstructured":"Johnson, K. (The New York Times, 2011). Liberating Viewers, and the World, with Silliness, The New York Times."},{"key":"ref_17","unstructured":"Young, D., and Priest, G. (2021, September 14). It Is and It Isn\u2019t. Aeon, Available online: https:\/\/aeon.co\/essays\/how-can-duchamp-s-fountain-be-both-art-and-not-art."},{"key":"ref_18","unstructured":"Spendlove, B., and Ventura, D. (2020, January 1\u20137). Creating Six-word Stories via Inferred Linguistic and Semantic Formats. Proceedings of the ICCC\u2014International Conference on Computational Creativity, Coimbra, Portugal."},{"key":"ref_19","unstructured":"Wen, M., Baym, N., Tamuz, O., Teevan, J., Dumais, S., and Kalai, A. (July, January 29). OMG UR Funny! Computer-Aided Humor with an Application to Chat. Proceedings of the ICCC\u2014International Conference on Computational Creativity, Park City, UT, USA."},{"key":"ref_20","unstructured":"Lamb, C., Brown, D.G., and Clarke, C. (2017, January 19\u201323). Incorporating novelty, meaning, reaction and craft into computational poetry: A negative experimental result. Proceedings of the ICCC\u2014International Conference on Computational Creativity, Atlanta, GA, USA."},{"key":"ref_21","unstructured":"Eigenfeldt, A., Bown, O., Brown, A.R., and Gifford, T. (July, January 27). Flexible Generation of Musical Form: Beyond Mere Generation. Proceedings of the ICCC\u2014International Conference on Computational Creativity, Paris, France."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1080\/09540091.2017.1345857","article-title":"Has computational creativity successfully made it \u201cBeyond the Fence\u201d in musical theatre?","volume":"29","author":"Jordanous","year":"2016","journal-title":"Connect. Sci."},{"key":"ref_23","unstructured":"Ventura, D. (2017, January 19\u201323). How to Build a CC System. Proceedings of the ICCC\u2014International Conference on Computational Creativity, Atlanta, GA, USA."},{"key":"ref_24","unstructured":"Mondol, T., and Brown, D.G. (2021, January 14\u201318). Incorporating Algorithmic Information Theory into Fundamental Concepts of Computational Creativity. Proceedings of the ICCC\u2014International Conference on Computational Creativity, Mexico City, Mexico."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Mondol, T., and Brown, D.G. (2021). Computational Creativity and Aesthetics with Algorithmic Information Theory. Entropy, submitted.","DOI":"10.3390\/e23121654"},{"key":"ref_26","unstructured":"Leonhardt, E., and Sabatier, V. (2021, September 14). 10 Billion Pixel Panorama of Vermeer\u2019s Girl with a Pearl Earring. Available online: https:\/\/www.micro-pano.com\/pearl\/index.html."},{"key":"ref_27","unstructured":"Bennett, C.H. (1988). Logical Depth and Physical Complexity. A Half-Century Survey on The Universal Turing Machine, Oxford University Press, Inc."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Koppel, M. (1995). Structure. The Universal Turing Machine: A Half-Century Survey, Springer. [2nd ed.].","DOI":"10.1007\/978-3-7091-6597-3_19"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Li, M., and Vit\u00e1nyi, P.M. (2019). An Introduction to Kolmogorov Complexity and Its Applications, Springer. [4th ed.].","DOI":"10.1007\/978-3-030-11298-1"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/s00224-007-9095-5","article-title":"Sophistication Revisited","volume":"45","author":"Antunes","year":"2009","journal-title":"Theory Comput. Syst."},{"key":"ref_31","unstructured":"(2021, September 14). The CMU Pronouncing Dictionary, Version 0.7b. Available online: http:\/\/www.speech.cs.cmu.edu\/cgi-bin\/cmudict."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"1696","DOI":"10.1093\/bioinformatics\/18.12.1696","article-title":"DNACompress: Fast and effective DNA sequence compression","volume":"18","author":"Chen","year":"2003","journal-title":"Bioinformatics"},{"key":"ref_33","unstructured":"Radford, A., Wu, J., Child, R., Luan, D., Amodei, D., and Sutskever, I. (2021, September 14). Language Models Are Unsupervised Multitask Learners. Available online: https:\/\/cdn.openai.com\/better-language-models\/language_models_are_unsupervised_multitask_learners.pdf."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/11\/1524\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T07:31:06Z","timestamp":1760167866000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/11\/1524"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,16]]},"references-count":33,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2021,11]]}},"alternative-id":["e23111524"],"URL":"https:\/\/doi.org\/10.3390\/e23111524","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2021,11,16]]}}}