{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:21:06Z","timestamp":1777645266662,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[2015,8,1]],"date-time":"2015-08-01T00:00:00Z","timestamp":1438387200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2015,8]]},"abstract":"<jats:p>We investigate Mark Titchener\u2019s T-complexity, an algorithm which measures the information content of finite strings. After introducing the T-complexity algorithm, we turn our attention to a particular class of \u201csimple\u201d finite strings. By exploiting special properties of simple strings, we obtain a fast algorithm to compute the maximum T-complexity among strings of a given length, and our estimates of these maxima show that T-complexity differs asymptotically from Kolmogorov complexity. Finally, we examine how closely de Bruijn sequences resemble strings with high T-complexity.<\/jats:p>","DOI":"10.3233\/fi-2015-1223","type":"journal-article","created":{"date-parts":[[2015,7,14]],"date-time":"2015-07-14T14:21:19Z","timestamp":1436883679000},"page":"1-19","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":2,"title":["Maximizing T-complexity"],"prefix":"10.1177","volume":"139","author":[{"given":"Gregory","family":"Clark","sequence":"first","affiliation":[{"name":"U.S. Department of Defense, Washington, DC 20301-1400, USA."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jason","family":"Teutsch","sequence":"additional","affiliation":[{"name":"Penn State University, University Park, PA 16082, USA."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2015,8,1]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2015-1223","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2015-1223","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:31:48Z","timestamp":1777444308000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2015-1223"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8]]},"references-count":0,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["10.3233\/FI-2015-1223"],"URL":"https:\/\/doi.org\/10.3233\/fi-2015-1223","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8]]}}}