More intensional versions of Rice's theorem

DOI10.1007/978-3-030-22996-2_19zbMath1434.03110OpenAlexW2954200410MaRDI QIDQ2179364

Jakob Grue Simonsen, Jean-Yves Moyen

Publication date: 12 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-22996-2_19

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Undecidability and degrees of sets of sentences (03D35) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Classical models of computation (Turing machines, etc.) (68Q04)

Related Items (2)

Intensional Kleene and Rice theorems for abstract program semantics ⋮ Subrecursive equivalence relations and (non-)closure under lattice operations

This page was built for publication: More intensional versions of Rice's theorem