In computability theory, Rice's theorem states that all non-trivial semantic properties of programs are undecidable. A semantic property is one about the...

In computability theory, the Rice–Shapiro theorem is a generalization of Rice's theorem, named after Henry Gordon Rice and Norman Shapiro. It states that...

detection, and spam filtering and filter-breaking are also subject to Rice's theorem. Solomonoff, Ray, "A Preliminary Report on a General Theory of Inductive...

non-computable, aside from two trivial exceptions. This is stated in Rice's theorem: Let C {\displaystyle {\mathcal {C}}} be a class of partial computable...

reducible to E, that is, can be mapped using a many-one reduction to E (see Rice's theorem for more detail). But, many of these index sets are even more complicated...

that would determine whether the original program halts. Rice's theorem generalizes the theorem that the halting problem is unsolvable. It states that for...

undefinability theorem Turing's proof Löb's paradox Roger's fixed-point theorem Rice's theorem Soto-Andrade, Jorge; J. Varela, Francisco (1984). "Self-Reference...

equation Quotient rule Ramsey's theorem Rao–Blackwell theorem Rice's theorem Rolle's theorem Splitting lemma squeeze theorem Sum rule in differentiation Sum...

of Church, Gödel and Turing in the 1930s (see: Halting problem and Rice's theorem). As with many undecidable questions, one can still attempt to give...

mathematics, and in particular the necklace splitting problem, the Hobby–Rice theorem is a result that is useful in establishing the existence of certain solutions...

information is in general not computable within finite time and memory (see Rice's theorem and the halting problem). Abstraction is used to allow for generalized...

Henry Gordon Rice (July 18, 1920 – April 14, 2003) was an American logician and mathematician best known as the author of Rice's theorem, which he proved...

the second sense of the term. This result was later generalized by Rice's theorem. In 1973, Saharon Shelah showed the Whitehead problem in group theory...

Reversed compound agent theorem (probability) Reynolds transport theorem (fluid dynamics) Ribet's theorem (elliptic curves) Rice's theorem (recursion theory...

variation of the proof that the halting problem is undecidable that uses Rice's Theorem. Due to security concerns regarding the Trusting Trust Attack (which...

Undecidable language Rice's theorem Post's theorem Turing degree Effective results in number theory Diophantine set Matiyasevich's theorem Word problem for...

loop Loop (computing) Machine that always halts Rice's theorem smn theorem Structured program theorem Turing tarpit Virtualization Emulation (computing)...

halting Turing machines with the same number of states and symbols). Rice's theorem states that for all nontrivial properties of partial functions, it is...

Undecidable, p. 303)). Rice's theorem: a generalized formulation of Turing's second theorem (cf Hopcroft and Ullman p. 185ff) Greibach's theorem: undecidability...

was shown to be, in general, undecidable in Turing's original paper. Rice's theorem shows that any non-trivial question about the output of a Turing machine...

Machine", The Perl Review. Papers 2 and 3 prove, using respectively Rice's theorem and direct reduction to the halting problem, that the parsing of Perl...

problem result. Another important step in computability theory was Rice's theorem, which states that for all non-trivial properties of partial functions...

Scott–Curry theorem applies equally to sets of terms in combinatory logic with weak equality. It has parallels to Rice's theorem in computability theorem, which...

are most properties of interesting classes of functions decidable, by Rice's theorem, i.e. the set of counting numbers for the subcountable sets may not...

callable has a side effect is difficult – indeed, undecidable by virtue of Rice's theorem. So, while this optimization is safe in a purely functional programming...

his final proof. His first theorem is most relevant to the halting problem, the second is more relevant to Rice's theorem. First proof: that no "computing...

Correctness Hyperproperties Invariants Path explosion Polyvariance Rice's theorem Runtime verification Safety and liveness Undefined behavior Semantics...

non-trivial properties of computer programs are essentially undecidable (see Rice's theorem). As a consequence, automatic methods for deriving information on the...

Correctness Hyperproperties Invariants Path explosion Polyvariance Rice's theorem Runtime verification Safety and liveness Undefined behavior Semantics...

for developing drivers for Windows. Abstract interpretation Automated theorem proving Binary decision diagram Büchi automaton Computation tree logic...