Functions that preserve p-randomness (Q393087): Difference between revisions

From MaRDI portal
Merged Item from Q3088296
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4348122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-state dimension and real arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calibrating Randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Randomness and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functions that preserve p-randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Category and Measure in Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost everywhere high nonuniform complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4359463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dimensions of Points in Self-Similar Fractals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity properties of dimension level sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The definition of random sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource bounded randomness and computational complexity / rank
 
Normal rank

Revision as of 10:27, 4 July 2024

scientific article; zbMATH DE number 5940787
  • Functions That Preserve p-Randomness
Language Label Description Also known as
English
Functions that preserve p-randomness
scientific article; zbMATH DE number 5940787
  • Functions That Preserve p-Randomness

Statements

Functions that preserve p-randomness (English)
0 references
Functions That Preserve p-Randomness (English)
0 references
0 references
0 references
0 references
16 January 2014
0 references
19 August 2011
0 references
0 references
0 references
0 references
0 references
0 references
randomness
0 references
p-randomness
0 references
complexity
0 references
polynomial-time randomness
0 references
measure
0 references
martingale
0 references
computational complexity
0 references
0 references
0 references
0 references