MathDB1 problem
- 0 votes0 replies0 views
Instance Complexity Conjecture for nonrecursive recursively enumerable sets
Instance Complexity Conjecture. Every nonrecursive recursively enumerable set has hard instances.
Instance Complexity Conjecture for nonrecursive recursively enumerable sets
Instance Complexity Conjecture. Every nonrecursive recursively enumerable set has hard instances.