{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T17:31:59Z","timestamp":1723570319572},"reference-count":13,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2013,6]]},"abstract":"<jats:p> An algorithmic uniform method to measure the complexity of finitely refutable statements [6, 7, 9] was used to classify famous\/interesting mathematical statements like Fermat's last theorem, the four colour theorem, and the Riemann hypothesis [8, 15, 16]. Working with inductive Turing machines of various orders [1] instead of classical computations, we propose a class of inductive complexity measures and inductive complexity classes for mathematical statements which generalise the previous method. In particular, the new method is capable to classify \u03a0<jats:sub>2<\/jats:sub>\u2013statements. As illustrations, we evaluate the inductive complexity of the Collatz and twin prime conjectures \u2014 statements which cannot be evaluated with the original method. <\/jats:p>","DOI":"10.1142\/s0129054113500160","type":"journal-article","created":{"date-parts":[[2013,8,2]],"date-time":"2013-08-02T08:04:30Z","timestamp":1375430670000},"page":"487-500","source":"Crossref","is-referenced-by-count":5,"title":["INDUCTIVE COMPLEXITY MEASURES FOR MATHEMATICAL PROBLEMS"],"prefix":"10.1142","volume":"24","author":[{"given":"MARK","family":"BURGIN","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of California, Los Angeles, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"CRISTIAN S.","family":"CALUDE","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Auckland, New Zealand"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ELENA","family":"CALUDE","sequence":"additional","affiliation":[{"name":"Institute of Natural and Mathematical Sciences Massey University at Auckland, New Zealand"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2013,8,2]]},"reference":[{"key":"p_3","first-page":"1","volume":"2","author":"Burgin M.","year":"2010","journal-title":"International Journal of Computing & Information Technology"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1112\/S1461157009000461"},{"key":"p_9","first-page":"285","volume":"12","author":"Calude C. S.","year":"2006","journal-title":"Journal for Multiple-Valued Logic and Soft Computing"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.03.023"},{"key":"p_11","first-page":"7445","volume":"2012","author":"Calude C. S.","year":"2012","journal-title":"Proceedings UCNC"},{"key":"p_12","first-page":"1","volume":"20","author":"Calude C. S.","journal-title":"Chaos"},{"key":"p_13","doi-asserted-by":"publisher","DOI":"10.1142\/S0218127407018130"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1080\/10586458.2002.10504481"},{"key":"p_15","first-page":"4","volume":"17","author":"Calude E.","year":"2011","journal-title":"Journal for Multiple-Valued Logic and Soft Computing"},{"key":"p_16","unstructured":"E. Calude. Fermat's Last Theorem and chaoticity, Natural Computing (2011), DOI: 10.1007\/s11047-011-9282-9.10.1007\/s11047-011-9282-9"},{"key":"p_20","first-page":"141","volume":"7445","author":"Hertel J.","year":"2012","journal-title":"LNCS"},{"key":"p_21","doi-asserted-by":"publisher","DOI":"10.1112\/blms\/14.4.285"},{"key":"p_22","doi-asserted-by":"publisher","DOI":"10.2307\/2322189"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054113500160","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T14:17:07Z","timestamp":1565187427000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054113500160"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":13,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2013,8,2]]},"published-print":{"date-parts":[[2013,6]]}},"alternative-id":["10.1142\/S0129054113500160"],"URL":"https:\/\/doi.org\/10.1142\/s0129054113500160","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6]]}}}