Rice's Theorem
Concept
Mentioned in relation to CPU complexity and the halting problem, which is relevant to why neural networks can be optimized differently.
Mentioned in 2 videos
Save the 2 videos on Rice's Theorem to your own pod.
Sign up free to keep building your knowledge base on Rice's Theorem as more episodes are added.
Videos Mentioning Rice's Theorem
Ep 18: Petaflops to the People — with George Hotz of tinycorp
Latent Space
Mentioned in relation to CPU complexity and the halting problem, which is relevant to why neural networks can be optimized differently.
Scaling Past Informal AI - Carina Hong, Axiom Math
Latent Space
A theoretical result in computer science stating that any non-trivial property about the language recognized by a Turing machine is undecidable by a general algorithm; discussed in the context of formal verification's limitations.