{"id":"https://openalex.org/W2086059606","doi":"https://doi.org/10.1137/0220059","title":"On the Complexity of Learning Minimum Time-Bounded Turing Machines","display_name":"On the Complexity of Learning Minimum Time-Bounded Turing Machines","publication_year":1991,"publication_date":"1991-10-01","ids":{"openalex":"https://openalex.org/W2086059606","doi":"https://doi.org/10.1137/0220059","mag":"2086059606"},"language":"en","primary_location":{"id":"doi:10.1137/0220059","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0220059","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5113600199","display_name":"Ker\u2010I Ko","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ker-I Ko","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5113600199"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.22911726,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"20","issue":"5","first_page":"962","last_page":"986"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9995999932289124,"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.9995999932289124,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/time-hierarchy-theorem","display_name":"Time hierarchy theorem","score":0.8154928088188171},{"id":"https://openalex.org/keywords/dtime","display_name":"DTIME","score":0.7904895544052124},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.7676701545715332},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.7032878398895264},{"id":"https://openalex.org/keywords/nspace","display_name":"NSPACE","score":0.663007378578186},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6440873742103577},{"id":"https://openalex.org/keywords/np","display_name":"NP","score":0.6083323359489441},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6056220531463623},{"id":"https://openalex.org/keywords/structural-complexity-theory","display_name":"Structural complexity theory","score":0.6026715040206909},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5744157433509827},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5721025466918945},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5348891615867615},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.5326430797576904},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5307077765464783},{"id":"https://openalex.org/keywords/probabilistic-turing-machine","display_name":"Probabilistic Turing machine","score":0.5288211703300476},{"id":"https://openalex.org/keywords/computable-number","display_name":"Computable number","score":0.512446939945221},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.43278688192367554},{"id":"https://openalex.org/keywords/p-versus-np-problem","display_name":"P versus NP problem","score":0.43127891421318054},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.42898571491241455},{"id":"https://openalex.org/keywords/super-recursive-algorithm","display_name":"Super-recursive algorithm","score":0.42856642603874207},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.38567784428596497},{"id":"https://openalex.org/keywords/computable-function","display_name":"Computable function","score":0.3472740054130554},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17590218782424927},{"id":"https://openalex.org/keywords/computable-analysis","display_name":"Computable analysis","score":0.10704022645950317}],"concepts":[{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.8154928088188171},{"id":"https://openalex.org/C15547884","wikidata":"https://www.wikidata.org/wiki/Q1155831","display_name":"DTIME","level":5,"score":0.7904895544052124},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.7676701545715332},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.7032878398895264},{"id":"https://openalex.org/C201958364","wikidata":"https://www.wikidata.org/wiki/Q1756295","display_name":"NSPACE","level":5,"score":0.663007378578186},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6440873742103577},{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.6083323359489441},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6056220531463623},{"id":"https://openalex.org/C131583701","wikidata":"https://www.wikidata.org/wiki/Q7625020","display_name":"Structural complexity theory","level":4,"score":0.6026715040206909},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5744157433509827},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5721025466918945},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5348891615867615},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.5326430797576904},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5307077765464783},{"id":"https://openalex.org/C144271403","wikidata":"https://www.wikidata.org/wiki/Q1191836","display_name":"Probabilistic Turing machine","level":5,"score":0.5288211703300476},{"id":"https://openalex.org/C156382255","wikidata":"https://www.wikidata.org/wiki/Q818895","display_name":"Computable number","level":4,"score":0.512446939945221},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.43278688192367554},{"id":"https://openalex.org/C186861659","wikidata":"https://www.wikidata.org/wiki/Q746242","display_name":"P versus NP problem","level":3,"score":0.43127891421318054},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.42898571491241455},{"id":"https://openalex.org/C31402856","wikidata":"https://www.wikidata.org/wiki/Q5295939","display_name":"Super-recursive algorithm","level":5,"score":0.42856642603874207},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.38567784428596497},{"id":"https://openalex.org/C54271186","wikidata":"https://www.wikidata.org/wiki/Q1148456","display_name":"Computable function","level":2,"score":0.3472740054130554},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17590218782424927},{"id":"https://openalex.org/C27318111","wikidata":"https://www.wikidata.org/wiki/Q5157264","display_name":"Computable analysis","level":3,"score":0.10704022645950317},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0220059","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0220059","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1488487350","https://openalex.org/W1489508883","https://openalex.org/W1965415591","https://openalex.org/W1988127406","https://openalex.org/W2011042573","https://openalex.org/W2017603160","https://openalex.org/W2021084256","https://openalex.org/W2041317738","https://openalex.org/W2041517255","https://openalex.org/W2061746118","https://openalex.org/W2068873365","https://openalex.org/W2073340866","https://openalex.org/W2078472124","https://openalex.org/W2135625884","https://openalex.org/W2154952480","https://openalex.org/W4238893454","https://openalex.org/W4243643814"],"related_works":["https://openalex.org/W3207919203","https://openalex.org/W3205703342","https://openalex.org/W2088158977","https://openalex.org/W2168431435","https://openalex.org/W1556737090","https://openalex.org/W2950005723","https://openalex.org/W3126743327","https://openalex.org/W2086059606","https://openalex.org/W2053392269","https://openalex.org/W1419862891"],"abstract_inverted_index":{"The":[0,106],"following":[1],"problems":[2,96,110,125],"about":[3],"time-bounded":[4],"program-size":[5],"complexity":[6,100,107],"are":[7,97,126,159,165,176],"studied:":[8],"(1)":[9],"for":[10,45,137,168,178],"a":[11,15,20,27,55,60,67],"given":[12,47],"string":[13],"x,":[14],"size":[16,31,56,71],"bound":[17,22,57,62],"s,":[18,58],"and":[19,51,59,83,89,102,115],"time":[21,61,81],"t,":[23,63],"whether":[24,64],"there":[25,65,158],"exists":[26,66],"Turing":[28,68,173],"machine":[29,69],"of":[30,53,70,108,131,140],"less":[32,72],"than":[33,73],"or":[34,74,149],"equal":[35,75],"to":[36,76,121,162],"s":[37,77],"that":[38,78,136],"prints":[39],"x":[40],"in":[41,80,99],"t":[42,82],"moves;":[43],"(2)":[44],"two":[46],"finite":[48],"sets":[49],"Y":[50],"Z":[52],"strings,":[54],"operates":[79],"accepts":[84],"all":[85,91],"$y":[86],"\\in":[87,93],"Y$":[88],"rejects":[90],"$z":[92],"Z$.":[94],"These":[95,124],"fundamental":[98],"theory":[101],"feasible":[103],"learning":[104],"theory.":[105],"these":[109],"is":[111,134],"apparently":[112],"between":[113],"P":[114],"$NP$,":[116],"but":[117,175],"appears":[118],"very":[119],"difficult":[120],"classify":[122],"precisely.":[123],"attacked":[127],"by":[128],"the":[129,141,171,181],"approach":[130],"relativization.":[132],"It":[133],"shown":[135],"certain":[138],"variations":[139],"problems,":[142],"they":[143,164],"could":[144],"be":[145],"either":[146],"polynomial-time":[147,151,172],"computable":[148],"not":[150,166],"computable,":[152],"depending":[153],"on":[154],"different":[155],"oracles.":[156],"Furthermore,":[157],"oracles":[160],"relative":[161],"which":[163],"complete":[167,177],"$NP$":[169,179,183],"under":[170,180],"reductions,":[174],"strong":[182],"reductions.":[184]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}