{"id":"https://openalex.org/W2043185883","doi":"https://doi.org/10.1142/s0129054113500160","title":"INDUCTIVE COMPLEXITY MEASURES FOR MATHEMATICAL PROBLEMS","display_name":"INDUCTIVE COMPLEXITY MEASURES FOR MATHEMATICAL PROBLEMS","publication_year":2013,"publication_date":"2013-06-01","ids":{"openalex":"https://openalex.org/W2043185883","doi":"https://doi.org/10.1142/s0129054113500160","mag":"2043185883"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054113500160","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054113500160","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109006861","display_name":"Mark Burgin","orcid":null},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"MARK BURGIN","raw_affiliation_strings":["Department of Mathematics, University of California, Los Angeles, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of California, Los Angeles, USA","institution_ids":["https://openalex.org/I161318765"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079186295","display_name":"Cristian S. Calude","orcid":"https://orcid.org/0000-0002-8711-6799"},"institutions":[{"id":"https://openalex.org/I154130895","display_name":"University of Auckland","ror":"https://ror.org/03b94tp07","country_code":"NZ","type":"education","lineage":["https://openalex.org/I154130895"]}],"countries":["NZ"],"is_corresponding":false,"raw_author_name":"CRISTIAN S. CALUDE","raw_affiliation_strings":["Department of Computer Science, University of Auckland, New Zealand"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Auckland, New Zealand","institution_ids":["https://openalex.org/I154130895"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052530286","display_name":"Elena Calude","orcid":"https://orcid.org/0000-0002-5962-0867"},"institutions":[{"id":"https://openalex.org/I51158804","display_name":"Massey University","ror":"https://ror.org/052czxv31","country_code":"NZ","type":"education","lineage":["https://openalex.org/I51158804"]}],"countries":["NZ"],"is_corresponding":false,"raw_author_name":"ELENA CALUDE","raw_affiliation_strings":["Institute of Natural and Mathematical Sciences Massey University at Auckland, New Zealand","Institute of Natural and Mathematical Sciences, Massey University at Auckland, New Zealand"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Natural and Mathematical Sciences Massey University at Auckland, New Zealand","institution_ids":["https://openalex.org/I51158804"]},{"raw_affiliation_string":"Institute of Natural and Mathematical Sciences, Massey University at Auckland, New Zealand","institution_ids":["https://openalex.org/I51158804"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.8226,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.85355102,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"24","issue":"04","first_page":"487","last_page":"500"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13720","display_name":"Benford\u2019s Law and Fraud Detection","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/inductive-reasoning","display_name":"Inductive reasoning","score":0.6788949966430664},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6060192584991455},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.568231463432312},{"id":"https://openalex.org/keywords/fermats-last-theorem","display_name":"Fermat's Last Theorem","score":0.5457231402397156},{"id":"https://openalex.org/keywords/kolmogorov-complexity","display_name":"Kolmogorov complexity","score":0.48642826080322266},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.44681504368782043},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.42669692635536194},{"id":"https://openalex.org/keywords/prime","display_name":"Prime (order theory)","score":0.42502668499946594},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4120275676250458},{"id":"https://openalex.org/keywords/inductive-method","display_name":"Inductive method","score":0.4118639826774597},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.4115646481513977},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41097697615623474},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.3947082757949829},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3810974359512329},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35373246669769287},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3504411578178406},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.30024102330207825},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.2081335186958313},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16844314336776733},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.15579557418823242}],"concepts":[{"id":"https://openalex.org/C21563000","wikidata":"https://www.wikidata.org/wiki/Q484511","display_name":"Inductive reasoning","level":2,"score":0.6788949966430664},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6060192584991455},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.568231463432312},{"id":"https://openalex.org/C87670640","wikidata":"https://www.wikidata.org/wiki/Q132469","display_name":"Fermat's Last Theorem","level":2,"score":0.5457231402397156},{"id":"https://openalex.org/C2779341405","wikidata":"https://www.wikidata.org/wiki/Q1456811","display_name":"Kolmogorov complexity","level":2,"score":0.48642826080322266},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.44681504368782043},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.42669692635536194},{"id":"https://openalex.org/C184992742","wikidata":"https://www.wikidata.org/wiki/Q7243229","display_name":"Prime (order theory)","level":2,"score":0.42502668499946594},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4120275676250458},{"id":"https://openalex.org/C2993131915","wikidata":"https://www.wikidata.org/wiki/Q484511","display_name":"Inductive method","level":3,"score":0.4118639826774597},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.4115646481513977},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41097697615623474},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3947082757949829},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3810974359512329},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35373246669769287},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3504411578178406},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.30024102330207825},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.2081335186958313},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16844314336776733},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.15579557418823242},{"id":"https://openalex.org/C145420912","wikidata":"https://www.wikidata.org/wiki/Q853077","display_name":"Mathematics education","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C88610354","wikidata":"https://www.wikidata.org/wiki/Q1813494","display_name":"Teaching method","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0129054113500160","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054113500160","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:researchspace.auckland.ac.nz:2292/10569","is_oa":false,"landing_page_url":"https://hdl.handle.net/2292/10569","pdf_url":null,"source":{"id":"https://openalex.org/S7407055463","display_name":"ResearchSpace (University of Auckland)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I154130895","host_organization_name":"University of Auckland","host_organization_lineage":["https://openalex.org/I154130895"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl?serial","raw_type":"Technical Report"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W2851918","https://openalex.org/W22370945","https://openalex.org/W563490355","https://openalex.org/W1964059180","https://openalex.org/W2076882011","https://openalex.org/W2077797656","https://openalex.org/W2081739832","https://openalex.org/W2137852471","https://openalex.org/W2169523736","https://openalex.org/W2404351250","https://openalex.org/W2406263502","https://openalex.org/W2591578264","https://openalex.org/W4246319563"],"related_works":["https://openalex.org/W2350866805","https://openalex.org/W2172780573","https://openalex.org/W2576878702","https://openalex.org/W2131882306","https://openalex.org/W2567810327","https://openalex.org/W2181654780","https://openalex.org/W2389301514","https://openalex.org/W73167756","https://openalex.org/W2360869328","https://openalex.org/W1490312561"],"abstract_inverted_index":{"An":[0],"algorithmic":[1],"uniform":[2],"method":[3,74],"to":[4,17,77],"measure":[5],"the":[6,26,31,67,72,86,90,103],"complexity":[7,56,60,88],"of":[8,42,47,54,89],"finitely":[9],"refutable":[10],"statements":[11,21,64,97],"[6,":[12],"7,":[13],"9]":[14],"was":[15],"used":[16],"classify":[18,78],"famous/interesting":[19],"mathematical":[20,63],"like":[22],"Fermat's":[23],"last":[24],"theorem,":[25,29],"four":[27],"colour":[28],"and":[30,58,92],"Riemann":[32],"hypothesis":[33],"[8,":[34],"15,":[35],"16].":[36],"Working":[37],"with":[38,102],"inductive":[39,55,59,87],"Turing":[40],"machines":[41],"various":[43],"orders":[44],"[1]":[45],"instead":[46],"classical":[48],"computations,":[49],"we":[50,84],"propose":[51],"a":[52],"class":[53],"measures":[57],"classes":[61],"for":[62],"which":[65,98],"generalise":[66],"previous":[68],"method.":[69,105],"In":[70],"particular,":[71],"new":[73],"is":[75],"capable":[76],"\u03a0":[79],"2":[80],"\u2013statements.":[81],"As":[82],"illustrations,":[83],"evaluate":[85],"Collatz":[91],"twin":[93],"prime":[94],"conjectures":[95],"\u2014":[96],"cannot":[99],"be":[100],"evaluated":[101],"original":[104]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}