On the effective generation of set elements within specified ranges
This paper looks at the problem of determining whether a set \(A\) contains an element in some effectively given finite interval. The interval is specified by a recursive function \(g\geq\text{id}\) as \([n,g(n)]\). It is noted that this problem has an effective solution for some \(g\) iff \(A\) is not hyperimmune. Some related questions are answered. All results are very easy to prove. In the end it is suggested that this investigation might provide some hints for the polynomial-time version of the problem. In the reviewer's opinion this is rather unlikely.
- scientific article; zbMATH DE number 553907
- On the construction of effective random sets
- On the construction of effectively random sets
- Generating combinatorial sets with given properties
- Generating All Sets With Bounded Unions
- scientific article; zbMATH DE number 3993648
- scientific article; zbMATH DE number 841574
- Algorithms and Computation
- Generating subsets on a systolic array
- scientific article; zbMATH DE number 1208725
- EFFICIENT DETECTORS AND CONSTRUCTORS FOR SIMPLE LANGUAGES
- scientific article; zbMATH DE number 3654183 (Why is no real title available?)
- scientific article; zbMATH DE number 3748431 (Why is no real title available?)
- scientific article; zbMATH DE number 15884 (Why is no real title available?)
- On the Efficient Generation of Language Instances
- Random generation of combinatorial structures from a uniform distribution
- Recursively enumerable sets and degrees. A study of computable functions and computably generated sets
- Uniform generation of random regular graphs of moderate degree
This page was built for publication: On the effective generation of set elements within specified ranges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3141999)