Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

Rice's theorem · Vinony

EntityQ1893717· pop 15· linked from 54 articles

Rice's theorem

Sign in to save

theorem in computability theory

Connections

digital object identifier

Syracuse University

computability theory

reductio ad absurdum

halting problem

Turing completeness

John Edward Hopcroft

Jeffrey David Ullman

programming language semantics

computable function

μ-recursive function

inference typing

dynamic programming language

static program analysis

Categories

Theorems in the foundations of mathematics Theorems in theory of computation Undecidable problems

Sources

wikipedia.externallinksexternallink

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

Gödel's incompleteness theorems

Entitydist 0.49

Tarski's undefinability theorem

Entitydist 0.55

Paris–Harrington theorem

Entitydist 0.58

Entitydist 0.60

complete theory

Entitydist 0.61

Entitydist 0.62

CHSH inequality

Entitydist 0.63

Margolus–Levitin theorem

Entitydist 0.63

Entitydist 0.63

Heyting algebra

Entitydist 0.65

Entitydist 0.65

Entitydist 0.65

What links here54 pages

theory of computation

program analysis

proof of impossibility

static program analysis

computability theory

programming language

Turing completeness

Cantor's diagonal argument

Henry Gordon Rice

universal Turing machine

combinatory logic

undecidable problem

cooperative game

Program slicing

halting problem

abstract interpretation