{"id":"https://openalex.org/W2158555299","doi":"https://doi.org/10.2307/2695101","title":"Computational randomness and lowness","display_name":"Computational randomness and lowness","publication_year":2001,"publication_date":"2001-09-01","ids":{"openalex":"https://openalex.org/W2158555299","doi":"https://doi.org/10.2307/2695101","mag":"2158555299"},"language":"en","primary_location":{"id":"doi:10.2307/2695101","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2695101","pdf_url":null,"source":{"id":"https://openalex.org/S177675236","display_name":"Journal of Symbolic Logic","issn_l":"0022-4812","issn":["0022-4812","1943-5886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Symbolic Logic","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/A5076144323","display_name":"Sebastiaan A. Terwijn","orcid":"https://orcid.org/0000-0002-1464-6908"},"institutions":[{"id":"https://openalex.org/I55106644","display_name":"Amsterdam University of Applied Sciences","ror":"https://ror.org/00y2z2s03","country_code":"NL","type":"education","lineage":["https://openalex.org/I55106644"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Sebastiaan A. Terwijn","raw_affiliation_strings":["Department of Mathematics and Computer Science, Free University of Amsterdam, de Boelelaan 1081 a, 1081 HV Amsterdam, The Netherlands, E-mail:"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Free University of Amsterdam, de Boelelaan 1081 a, 1081 HV Amsterdam, The Netherlands, E-mail:","institution_ids":["https://openalex.org/I55106644"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027169167","display_name":"Domenico Zambella","orcid":"https://orcid.org/0000-0003-1141-2898"},"institutions":[{"id":"https://openalex.org/I1330701686","display_name":"Collegio Carlo Alberto","ror":"https://ror.org/0397knh37","country_code":"IT","type":"education","lineage":["https://openalex.org/I1330701686"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Domenico Zambella","raw_affiliation_strings":["Department of Mathematics, University of Torino, VIA Carlo Alberto 10, 10123 Torino, Italy, E-mail:"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Torino, VIA Carlo Alberto 10, 10123 Torino, Italy, E-mail:","institution_ids":["https://openalex.org/I1330701686"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5076144323"],"corresponding_institution_ids":["https://openalex.org/I55106644"],"apc_list":null,"apc_paid":null,"fwci":5.0223,"has_fulltext":false,"cited_by_count":96,"citation_normalized_percentile":{"value":0.95507927,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"66","issue":"3","first_page":"1199","last_page":"1205"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T11151","display_name":"Advanced Topology and Set Theory","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9876000285148621,"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/randomness","display_name":"Randomness","score":0.8321119546890259},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.7040198445320129},{"id":"https://openalex.org/keywords/turing","display_name":"Turing","score":0.5816013216972351},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.5641946196556091},{"id":"https://openalex.org/keywords/characterization","display_name":"Characterization (materials science)","score":0.5067358613014221},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4954942464828491},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4621470868587494},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.4309813976287842},{"id":"https://openalex.org/keywords/computability-theory","display_name":"Computability theory","score":0.4166452884674072},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40056112408638},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1623879373073578},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.08627074956893921},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.05556413531303406},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.04731863737106323}],"concepts":[{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.8321119546890259},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.7040198445320129},{"id":"https://openalex.org/C9870796","wikidata":"https://www.wikidata.org/wiki/Q490481","display_name":"Turing","level":2,"score":0.5816013216972351},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.5641946196556091},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.5067358613014221},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4954942464828491},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4621470868587494},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.4309813976287842},{"id":"https://openalex.org/C111142201","wikidata":"https://www.wikidata.org/wiki/Q818930","display_name":"Computability theory","level":2,"score":0.4166452884674072},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40056112408638},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1623879373073578},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.08627074956893921},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.05556413531303406},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.04731863737106323},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.2307/2695101","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2695101","pdf_url":null,"source":{"id":"https://openalex.org/S177675236","display_name":"Journal of Symbolic Logic","issn_l":"0022-4812","issn":["0022-4812","1943-5886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Symbolic Logic","raw_type":"journal-article"},{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/55018060-97ba-4e07-a545-ea39e3a1ce04","is_oa":false,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/computational-randomness-and-lowness(55018060-97ba-4e07-a545-ea39e3a1ce04).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Zambella, D 2001, 'Computational randomness and lowness', Journal of Symbolic Logic, vol. 66, no. 3, pp. 1199-1205. https://doi.org/10.2307/2695101","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:uvapub:oai:dare.uva.nl:publications/55018060-97ba-4e07-a545-ea39e3a1ce04","is_oa":false,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/computational-randomness-and-lowness(55018060-97ba-4e07-a545-ea39e3a1ce04).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Symbolic Logic, 66(3), 1199 - 1205. Cambridge University Press","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W10794601","https://openalex.org/W352853685","https://openalex.org/W623765668","https://openalex.org/W1510115324","https://openalex.org/W2005432166","https://openalex.org/W2032484393","https://openalex.org/W2067580807","https://openalex.org/W2082772546","https://openalex.org/W2493479077","https://openalex.org/W2499081645","https://openalex.org/W4248851369"],"related_works":["https://openalex.org/W4388310202","https://openalex.org/W2310420552","https://openalex.org/W2133902039","https://openalex.org/W1589207578","https://openalex.org/W2076016706","https://openalex.org/W2936847277","https://openalex.org/W167110062","https://openalex.org/W4247035339","https://openalex.org/W1161578261","https://openalex.org/W4597164"],"abstract_inverted_index":{"Abstract":[0],"We":[1,19],"prove":[2],"that":[3,9,31,52],"there":[4],"are":[5,10,53],"uncountably":[6],"many":[7],"sets":[8,28,51],"low":[11,54],"for":[12,55],"the":[13,56],"class":[14,57],"of":[15,26,45,58],"Schnorr":[16],"random":[17,60],"reals.":[18,61],"give":[20],"a":[21,43],"purely":[22],"recursion":[23],"theoretic":[24],"characterization":[25],"these":[27],"and":[29,47],"show":[30],"they":[32],"all":[33],"have":[34],"Turing":[35],"degree":[36],"incomparable":[37],"to":[38],"0\u2032.":[39],"This":[40],"contrasts":[41],"with":[42],"result":[44],"Ku\u010dera":[46],"Terwijn":[48],"[5]":[49],"on":[50],"Martin-L\u00f6f":[59]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}