{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T07:00:55Z","timestamp":1777618855200,"version":"3.51.4"},"reference-count":6,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,11,13]],"date-time":"2006-11-13T00:00:00Z","timestamp":1163376000000},"content-version":"vor","delay-in-days":11274,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Logic Qtrly"],"published-print":{"date-parts":[[1976,1]]},"DOI":"10.1002\/malq.19760220150","type":"journal-article","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T03:08:14Z","timestamp":1180148894000},"page":"413-418","source":"Crossref","is-referenced-by-count":4,"title":["Nat\u00fcrliche Kompliziertheitsmasze und Erhaltungss\u00e4tze I"],"prefix":"10.1002","volume":"22","author":[{"given":"Gerhard","family":"Lischke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,11,13]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/321386.321395"},{"key":"e_1_2_1_3_2","unstructured":"Hartmanis J. On the problem of finding natural computational complexity measures. Proceedings of an International Symposium and Summer School on Mathematical Foundations of Computer Science High Tatras September1973 p.95\u2013103."},{"key":"e_1_2_1_4_2","first-page":"159","article-title":"\u00dcber die Erf\u00fcllung gewisser Erhaltungss\u00e4tze durch Kompliziertheitsma\u00dfe","volume":"21","author":"Lischke G.","year":"1975","journal-title":"Diese Zeitschr."},{"key":"e_1_2_1_5_2","first-page":"423","article-title":"Flu\u00dfbildma\u00dfe \u2013 Ein Versuch zur Definition nat\u00fcrlicher Kompliziertheitsma\u00dfe","volume":"11","author":"Lischke G.","year":"1975","journal-title":"EIK"},{"key":"e_1_2_1_6_2","volume-title":"Theory of recursive functions and effective computability","author":"Rogers H.","year":"1967"},{"key":"e_1_2_1_7_2","unstructured":"Wechsung G. Zul\u00e4ssige Unterma\u00dfe von Kompliziertheitsma\u00dfen. Tagungsberichte des Symposiums \u201eAlgorithmische Kompliziertheit von Lern\u2010 und Erkennungsprozessen\u201d\ufe01 in Jena (1973)."}],"container-title":["Mathematical Logic Quarterly"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fmalq.19760220150","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/malq.19760220150","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T14:39:57Z","timestamp":1697726397000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/malq.19760220150"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,1]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1976,1]]}},"alternative-id":["10.1002\/malq.19760220150"],"URL":"https:\/\/doi.org\/10.1002\/malq.19760220150","archive":["Portico"],"relation":{},"ISSN":["0942-5616","1521-3870"],"issn-type":[{"value":"0942-5616","type":"print"},{"value":"1521-3870","type":"electronic"}],"subject":[],"published":{"date-parts":[[1976,1]]}}}