We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
This paper defines a new notion of bounded computable randomness for certainclasses of sub-computable functions which lack a universal machine. Inparticular, we define such versions of randomness for primitive recursivefunctions and for PSPACE functions. These new notions are robust in that thereare equivalent formulations in terms of (1) Martin-L\"of tests, (2) Kolmogorovcomplexity, and (3) martingales. We show these notions can be equivalentlydefined with prefix-free Kolmogorov complexity. We prove that one direction ofvan Lambalgen's theorem holds for relative computability, but the otherdirection fails. We discuss statistical properties of these notions ofrandomness
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.