Rice's theorem
id:
rice-s-theorem-309-12861116
title:
Rice's theorem
text:
In computability theory, Rice's theorem states that all non-trivial semantic properties of programs are undecidable. A semantic property is one about the program's behavior, unlike a syntactic property. A non-trivial property is one which is neither true for every program, nor false for every program. The theorem generalizes the undecidability of the halting problem. It has far-reaching implications on the feasibility of static analysis of programs. It implies that it is impossible, for example,
brand slug:
wiki
category slug:
encyclopedia
description:
Theorem in computability theory
original url:
https://en.wikipedia.org/wiki/Rice%27s_theorem
date created:
date modified:
2024-03-24T02:51:27Z
main entity:
{"identifier":"Q1893717","url":"https://www.wikidata.org/entity/Q1893717"}
image:
fields total:
13
integrity:
14