The Homogenous Capture of Random Strings
Loading...
No Access Until
Permanent Link(s)
Collections
Other Titles
Author(s)
Abstract
It is well known that a set of strings that are random in the Kolmogorov sense is immune to all computable enumerations. In this paper, we discuss the generalization of this property to the computational resource hierarchies. We then introduce the notion of homogeneous capture of sets and show that sets of random strings are not homogeneously captured by any computable enumeration. Again, we discuss the extension of this property to the resource hierarchies. Finally, we discuss the relationship between the notion of homogeneous capture and the traditional concept of randomness.
Journal / Series
Volume & Issue
Description
Sponsorship
Date Issued
1985-04
Publisher
Cornell University
Keywords
computer science; technical report
Location
Effective Date
Expiration Date
Sector
Employer
Union
Union Local
NAICS
Number of Workers
Committee Chair
Committee Co-Chair
Committee Member
Degree Discipline
Degree Name
Degree Level
Related Version
Related DOI
Related To
Related Part
Based on Related Item
Has Other Format(s)
Part of Related Item
Related To
Related Publication(s)
Link(s) to Related Publication(s)
References
Link(s) to Reference(s)
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR85-672
Government Document
ISBN
ISMN
ISSN
Other Identifiers
Rights
Rights URI
Types
technical report