{"id":"https://openalex.org/W1967410785","doi":"https://doi.org/10.1016/s1571-0661(04)80019-7","title":"Computability and Complexity from a Programming Perspective (MFPS Draft preview)","display_name":"Computability and Complexity from a Programming Perspective (MFPS Draft preview)","publication_year":1995,"publication_date":"1995-01-01","ids":{"openalex":"https://openalex.org/W1967410785","doi":"https://doi.org/10.1016/s1571-0661(04)80019-7","mag":"1967410785"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(04)80019-7","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80019-7","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/s1571-0661(04)80019-7","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103363705","display_name":"Neil D. Jones","orcid":null},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Neil D. Jones","raw_affiliation_strings":["DIKU, University of Copenhagen, Universitetsparken 1, 2100 Copenhagen East, Denmark"],"affiliations":[{"raw_affiliation_string":"DIKU, University of Copenhagen, Universitetsparken 1, 2100 Copenhagen East, Denmark","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5103363705"],"corresponding_institution_ids":["https://openalex.org/I124055696"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08981314,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1","issue":null,"first_page":"313","last_page":"333"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9997000098228455,"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.9997000098228455,"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/T11567","display_name":"semigroups and automata theory","score":0.9994999766349792,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9994000196456909,"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/computability","display_name":"Computability","score":0.7303168773651123},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7048821449279785},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.6621392369270325},{"id":"https://openalex.org/keywords/lisp","display_name":"Lisp","score":0.6029472947120667},{"id":"https://openalex.org/keywords/p","display_name":"P","score":0.5613225698471069},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.5578572750091553},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5055277347564697},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.4970567524433136},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.49527326226234436},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.4703044295310974},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.43718069791793823},{"id":"https://openalex.org/keywords/model-of-computation","display_name":"Model of computation","score":0.4365490972995758},{"id":"https://openalex.org/keywords/time-hierarchy-theorem","display_name":"Time hierarchy theorem","score":0.43068790435791016},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.421234667301178},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.4122248888015747},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3666105568408966},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3178667724132538},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3069683611392975},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22516179084777832},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14657685160636902},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.14078372716903687}],"concepts":[{"id":"https://openalex.org/C152062344","wikidata":"https://www.wikidata.org/wiki/Q818888","display_name":"Computability","level":2,"score":0.7303168773651123},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7048821449279785},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.6621392369270325},{"id":"https://openalex.org/C190883126","wikidata":"https://www.wikidata.org/wiki/Q132874","display_name":"Lisp","level":2,"score":0.6029472947120667},{"id":"https://openalex.org/C134026603","wikidata":"https://www.wikidata.org/wiki/Q846354","display_name":"P","level":3,"score":0.5613225698471069},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.5578572750091553},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5055277347564697},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.4970567524433136},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49527326226234436},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.4703044295310974},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.43718069791793823},{"id":"https://openalex.org/C184596265","wikidata":"https://www.wikidata.org/wiki/Q2651576","display_name":"Model of computation","level":3,"score":0.4365490972995758},{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.43068790435791016},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.421234667301178},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.4122248888015747},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3666105568408966},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3178667724132538},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3069683611392975},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22516179084777832},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14657685160636902},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.14078372716903687},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s1571-0661(04)80019-7","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80019-7","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(04)80019-7","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80019-7","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.7799999713897705}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1556604985","https://openalex.org/W1573534320","https://openalex.org/W2007844943","https://openalex.org/W2073812497","https://openalex.org/W2079275582","https://openalex.org/W4248695203"],"related_works":["https://openalex.org/W2026191634","https://openalex.org/W2099724134","https://openalex.org/W2970311880","https://openalex.org/W2804982345","https://openalex.org/W4388215614","https://openalex.org/W1556623397","https://openalex.org/W2134140745","https://openalex.org/W2013091420","https://openalex.org/W3033897917","https://openalex.org/W1494177512"],"abstract_inverted_index":{"The":[0],"author's":[1],"forthcoming":[2],"book":[3],"proves":[4],"central":[5],"results":[6,36],"in":[7,118,129],"computability":[8],"and":[9,24,109,142],"complexity":[10,94],"theory":[11],"from":[12,39],"a":[13,45,122,137],"programmer-oriented":[14],"perspective.":[15],"In":[16],"addition":[17],"to":[18],"giving":[19],"more":[20,48],"natural":[21,49],"definitions,":[22],"proofs":[23],"perspectives":[25],"on":[26,86],"classical":[27],"theorems":[28],"by":[29,77,83,132],"Cook,":[30],"Hartmanis,":[31],"Savitch,":[32],"etc.,":[33],"some":[34],"new":[35],"have":[37],"come":[38],"the":[40,51,55,71,92],"alternative":[41],"approach.":[42],"One:":[43],"for":[44,67],"computation":[46],"model":[47],"than":[50],"Turing":[52,68],"machine,":[53],"multiplying":[54],"available":[56],"problem-solving":[57,61],"time":[58,120,131,141],"provably":[59],"increases":[60],"power":[62],"(in":[63],"general":[64],"not":[65],"true":[66],"machines).":[69],"Another:":[70],"class":[72,95],"of":[73],"decision":[74],"problems":[75],"solvable":[76],"Wadler's":[78],"\u201ctreeless\u201d":[79],"programs":[80,85,102,115],"[8],":[81],"or":[82],"cons-free":[84,101],"Lisp-like":[87],"lists,":[88],"are":[89],"identical":[90],"with":[91,104],"well-studied":[93],"LOGSPACE.":[96],"A":[97],"third":[98],"is":[99],"that":[100],"augmented":[103],"recursion":[105],"can":[106,126],"solve":[107],"all":[108],"only":[110],"PTIME":[111],"problems.":[112],"Paradoxically,":[113],"these":[114],"often":[116],"run":[117],"exponential":[119],"(not":[121],"contradiction,":[123],"since":[124],"they":[125],"be":[127],"simulated":[128],"polynomial":[130],"memoization.)":[133],"This":[134],"tradeoff":[135],"indicates":[136],"tension":[138],"between":[139],"running":[140],"memory":[143],"space":[144],"which":[145],"seems":[146],"worth":[147],"further":[148],"investigation.":[149]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}