A Second Step Towards Complexity-Theoretic Analogs of Rice's Theorem

What this record says

Rice's Theorem states that every nontrivial language property of the recursively enumerable sets is undecidable. Borchert and Stephan initiated the

CATALOG · The abstract is indexed.