Randomness and the linear degrees of computability (Q866567): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.apal.2006.08.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2104394421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Computational Paradigms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A c.e. real that cannot be sw-computed by any \(\Omega\) number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random reals and Lipschitz continuity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness and reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779154 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Randomness and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3758821 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to the definition of random sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability Theory and Differential Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: There is no <i>SW</i>-complete c.e. real / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:32, 25 June 2024

scientific article
Language Label Description Also known as
English
Randomness and the linear degrees of computability
scientific article

    Statements