{"id":"https://openalex.org/W2059442002","doi":"https://doi.org/10.1137/0206049","title":"Computational Complexity of Probabilistic Turing Machines","display_name":"Computational Complexity of Probabilistic Turing Machines","publication_year":1977,"publication_date":"1977-12-01","ids":{"openalex":"https://openalex.org/W2059442002","doi":"https://doi.org/10.1137/0206049","mag":"2059442002"},"language":"en","primary_location":{"id":"doi:10.1137/0206049","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0206049","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/A5029972716","display_name":"John Gill","orcid":"https://orcid.org/0000-0001-6200-0872"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"John Gill","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5029972716"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.3886,"has_fulltext":false,"cited_by_count":694,"citation_normalized_percentile":{"value":0.97275076,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":100},"biblio":{"volume":"6","issue":"4","first_page":"675","last_page":"695"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998000264167786,"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.9998000264167786,"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/T12029","display_name":"DNA and Biological Computing","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9972000122070312,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/time-hierarchy-theorem","display_name":"Time hierarchy theorem","score":0.886380672454834},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.839311957359314},{"id":"https://openalex.org/keywords/probabilistic-turing-machine","display_name":"Probabilistic Turing machine","score":0.7915979623794556},{"id":"https://openalex.org/keywords/non-deterministic-turing-machine","display_name":"Non-deterministic Turing machine","score":0.7762466669082642},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.7517739534378052},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.7401890754699707},{"id":"https://openalex.org/keywords/nspace","display_name":"NSPACE","score":0.6574576497077942},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.5997756719589233},{"id":"https://openalex.org/keywords/turing-machine-examples","display_name":"Turing machine examples","score":0.592957079410553},{"id":"https://openalex.org/keywords/dtime","display_name":"DTIME","score":0.5833510160446167},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5624609589576721},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.5467925071716309},{"id":"https://openalex.org/keywords/description-number","display_name":"Description number","score":0.5194903612136841},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.49241507053375244},{"id":"https://openalex.org/keywords/super-recursive-algorithm","display_name":"Super-recursive algorithm","score":0.48768866062164307},{"id":"https://openalex.org/keywords/computable-function","display_name":"Computable function","score":0.4464058578014374},{"id":"https://openalex.org/keywords/probabilistic-analysis-of-algorithms","display_name":"Probabilistic analysis of algorithms","score":0.4451196491718292},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4121689796447754},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3873284161090851},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3772227168083191},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.22122368216514587},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.06931129097938538}],"concepts":[{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.886380672454834},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.839311957359314},{"id":"https://openalex.org/C144271403","wikidata":"https://www.wikidata.org/wiki/Q1191836","display_name":"Probabilistic Turing machine","level":5,"score":0.7915979623794556},{"id":"https://openalex.org/C15190523","wikidata":"https://www.wikidata.org/wiki/Q1190223","display_name":"Non-deterministic Turing machine","level":5,"score":0.7762466669082642},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7517739534378052},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.7401890754699707},{"id":"https://openalex.org/C201958364","wikidata":"https://www.wikidata.org/wiki/Q1756295","display_name":"NSPACE","level":5,"score":0.6574576497077942},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.5997756719589233},{"id":"https://openalex.org/C21176728","wikidata":"https://www.wikidata.org/wiki/Q7854963","display_name":"Turing machine examples","level":5,"score":0.592957079410553},{"id":"https://openalex.org/C15547884","wikidata":"https://www.wikidata.org/wiki/Q1155831","display_name":"DTIME","level":5,"score":0.5833510160446167},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5624609589576721},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.5467925071716309},{"id":"https://openalex.org/C179061269","wikidata":"https://www.wikidata.org/wiki/Q5263786","display_name":"Description number","level":5,"score":0.5194903612136841},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49241507053375244},{"id":"https://openalex.org/C31402856","wikidata":"https://www.wikidata.org/wiki/Q5295939","display_name":"Super-recursive algorithm","level":5,"score":0.48768866062164307},{"id":"https://openalex.org/C54271186","wikidata":"https://www.wikidata.org/wiki/Q1148456","display_name":"Computable function","level":2,"score":0.4464058578014374},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.4451196491718292},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4121689796447754},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3873284161090851},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3772227168083191},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22122368216514587},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.06931129097938538}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0206049","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0206049","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":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.5799999833106995}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W379370086","https://openalex.org/W1507092174","https://openalex.org/W1963780006","https://openalex.org/W1964053266","https://openalex.org/W1989008275","https://openalex.org/W2012140001","https://openalex.org/W2029872977","https://openalex.org/W2042587503","https://openalex.org/W2043646456","https://openalex.org/W2047370658","https://openalex.org/W2065251436","https://openalex.org/W2069413150","https://openalex.org/W2089442854","https://openalex.org/W2090627896","https://openalex.org/W2182112064","https://openalex.org/W2592184324","https://openalex.org/W2905135108","https://openalex.org/W4212875940","https://openalex.org/W4213269876","https://openalex.org/W4234891673"],"related_works":["https://openalex.org/W1662868588","https://openalex.org/W2547364878","https://openalex.org/W2348596562","https://openalex.org/W4313546668","https://openalex.org/W2070488416","https://openalex.org/W2059442002","https://openalex.org/W3211509423","https://openalex.org/W3205703342","https://openalex.org/W1598776769","https://openalex.org/W3207919203"],"abstract_inverted_index":{"A":[0,66],"probabilistic":[1,28,62,78,103],"Turing":[2,6,79,85],"machine":[3,7,29,93,104],"is":[4,30,69,88],"a":[5,27,102],"with":[8,41,105,122],"the":[9,16,37,98],"ability":[10],"to":[11,34],"make":[12],"decisions":[13],"based":[14],"on":[15],"outcomes":[17],"of":[18,61,111],"unbiased":[19],"coin":[20],"tosses.":[21],"The":[22,56],"partial":[23,50],"function":[24],"computed":[25],"by":[26,32,76,82,101],"defined":[31,119],"assigning":[33],"each":[35],"input":[36],"output":[38],"which":[39],"occurs":[40],"probability":[42],"greater":[43],"than":[44,81],"$\\frac{1}{2}$.":[45],"With":[46],"this":[47],"definition,":[48],"only":[49],"recursive":[51],"functions":[52],"are":[53,64,118],"probabilistically":[54,114],"computable.":[55],"run":[57],"time":[58,117],"and":[59,120],"tape":[60],"machines":[63,80],"defined.":[65],"palindrome-like":[67],"language":[68],"described":[70],"that":[71,90],"can":[72,94],"be":[73,95],"recognized":[74,113],"faster":[75],"one-tape":[77,83],"deterministic":[84],"machines.":[86],"It":[87],"shown":[89],"every":[91],"nondeterministic":[92],"simulated":[96],"in":[97,115],"same":[99],"space":[100],"small":[106],"error":[107],"probability.":[108],"Several":[109],"classes":[110],"languages":[112],"polynomial":[116],"compared":[121],"$NP$.":[123]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":14},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":13},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":13},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":20},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":7}],"updated_date":"2026-03-09T08:58:05.943551","created_date":"2025-10-10T00:00:00"}