{"id":"https://openalex.org/W2128414357","doi":"https://doi.org/10.1145/1127556.1127558","title":"Array languages and the challenge of modern computer architecture","display_name":"Array languages and the challenge of modern computer architecture","publication_year":2004,"publication_date":"2004-06-01","ids":{"openalex":"https://openalex.org/W2128414357","doi":"https://doi.org/10.1145/1127556.1127558","mag":"2128414357"},"language":"en","primary_location":{"id":"doi:10.1145/1127556.1127558","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1127556.1127558","pdf_url":null,"source":{"id":"https://openalex.org/S4210186172","display_name":"ACM SIGAPL APL Quote Quad","issn_l":"0163-6006","issn":["0163-6006","1558-3392"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGAPL APL Quote Quad","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/A5112081322","display_name":"Paul Cockshott","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Paul Cockshott","raw_affiliation_strings":[""],"affiliations":[{"raw_affiliation_string":"","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5112081322"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.12594418,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"34","issue":"3","first_page":"13","last_page":"19"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9991999864578247,"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"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9991999864578247,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.998199999332428,"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/turing-machine","display_name":"Turing machine","score":0.7649381160736084},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7302917242050171},{"id":"https://openalex.org/keywords/super-recursive-algorithm","display_name":"Super-recursive algorithm","score":0.6741254925727844},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5680919885635376},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5567048192024231},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.5421172380447388},{"id":"https://openalex.org/keywords/time-hierarchy-theorem","display_name":"Time hierarchy theorem","score":0.530989944934845},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5049427151679993},{"id":"https://openalex.org/keywords/turing","display_name":"Turing","score":0.48870018124580383},{"id":"https://openalex.org/keywords/computable-function","display_name":"Computable function","score":0.478034108877182},{"id":"https://openalex.org/keywords/description-number","display_name":"Description number","score":0.4604618549346924},{"id":"https://openalex.org/keywords/nspace","display_name":"NSPACE","score":0.45387592911720276},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.42349040508270264},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2525350749492645},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.21789366006851196},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19105708599090576}],"concepts":[{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.7649381160736084},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7302917242050171},{"id":"https://openalex.org/C31402856","wikidata":"https://www.wikidata.org/wiki/Q5295939","display_name":"Super-recursive algorithm","level":5,"score":0.6741254925727844},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5680919885635376},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5567048192024231},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.5421172380447388},{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.530989944934845},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5049427151679993},{"id":"https://openalex.org/C9870796","wikidata":"https://www.wikidata.org/wiki/Q490481","display_name":"Turing","level":2,"score":0.48870018124580383},{"id":"https://openalex.org/C54271186","wikidata":"https://www.wikidata.org/wiki/Q1148456","display_name":"Computable function","level":2,"score":0.478034108877182},{"id":"https://openalex.org/C179061269","wikidata":"https://www.wikidata.org/wiki/Q5263786","display_name":"Description number","level":5,"score":0.4604618549346924},{"id":"https://openalex.org/C201958364","wikidata":"https://www.wikidata.org/wiki/Q1756295","display_name":"NSPACE","level":5,"score":0.45387592911720276},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.42349040508270264},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2525350749492645},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.21789366006851196},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19105708599090576}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1127556.1127558","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1127556.1127558","pdf_url":null,"source":{"id":"https://openalex.org/S4210186172","display_name":"ACM SIGAPL APL Quote Quad","issn_l":"0163-6006","issn":["0163-6006","1558-3392"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGAPL APL Quote Quad","raw_type":"journal-article"},{"id":"pmh:oai:eprints.gla.ac.uk:3526","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4210235606","display_name":"ENLIGHTEN (Jurnal Bimbingan dan Konseling Islam)","issn_l":"2622-8912","issn":["2622-8912","2622-8920"],"is_oa":false,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Articles"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.41999998688697815}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W597246669","https://openalex.org/W1495550651","https://openalex.org/W1583210003","https://openalex.org/W1781866519","https://openalex.org/W1986748478","https://openalex.org/W2013993765","https://openalex.org/W2020430347","https://openalex.org/W2022429840","https://openalex.org/W2027166661","https://openalex.org/W2030942926","https://openalex.org/W2035870118","https://openalex.org/W2058978634","https://openalex.org/W2090930896","https://openalex.org/W2093765092","https://openalex.org/W2097389671","https://openalex.org/W2116226675","https://openalex.org/W2126160338","https://openalex.org/W2137505714","https://openalex.org/W2158094629","https://openalex.org/W2158365276","https://openalex.org/W2293623673","https://openalex.org/W2964924953"],"related_works":["https://openalex.org/W3014863312","https://openalex.org/W195780958","https://openalex.org/W1662868588","https://openalex.org/W2156308118","https://openalex.org/W2037124586","https://openalex.org/W2341138125","https://openalex.org/W1526857708","https://openalex.org/W293759077","https://openalex.org/W1838451616","https://openalex.org/W1483817375"],"abstract_inverted_index":{"There":[0],"has":[1,51],"always":[2],"been":[3,52],"a":[4],"close":[5],"relationship":[6],"between":[7],"programming":[8,17],"language":[9],"design":[10],"and":[11,16],"computer":[12],"design.":[13],"Electronic":[14],"computers":[15],"languages":[18],"are":[19,26],"both":[20],"'computers'":[21],"in":[22],"Turing's":[23],"sense.":[24],"They":[25],"systems":[27],"which":[28],"allow":[29],"the":[30,55,67,72],"performance":[31],"of":[32,66],"bounded":[33],"universal":[34],"computation.":[35],"Each":[36],"allows":[37],"any":[38],"computable":[39],"function":[40],"to":[41,45,64],"be":[42,65],"evaluated,":[43],"up":[44],"some":[46],"memory":[47],"limit.":[48],"This":[49],"equivalence":[50],"understood":[53],"since":[54],"30s'":[56],"when":[57],"Turing":[58],"machines":[59],"(Turing":[60],"1937)":[61],"were":[62],"shown":[63],"same":[68],"computational":[69],"power":[70],"as":[71],"\u03bb":[73],"calculus.":[74]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}