Timeline for Rice's Theorem: implication of having an undecidable property

12 events

when toggle format	what		by	license	comment
Feb 1, 2016 at 15:34	comment	added	Divyanshu Shende		David - <O> is the encoding of a O, for any object O. It is simply one of the possible representations of O in the form of a string.
Feb 1, 2016 at 15:31	comment	added	Divyanshu Shende		Yes. It's supposed to mean L(M) satisfies P. Is the answer okay now?
Feb 1, 2016 at 15:31	history	edited	Divyanshu Shende	CC BY-SA 3.0	corrected typo
Dec 29, 2015 at 5:07	comment	added	D.W.♦		It still seems problematic to me. What does "Language of M and satisfies P" mean? Do you mean $L(M)$ satisfies $P$?
Dec 28, 2015 at 19:38	comment	added	Divyanshu Shende		The answer was horribly wrong before. Hopefully, it makes more sense now.
Dec 28, 2015 at 19:37	history	edited	Divyanshu Shende	CC BY-SA 3.0	added 198 characters in body
Dec 17, 2015 at 19:28	comment	added	David Richerby		What does $\langle L\rangle$ mean?
Dec 17, 2015 at 19:27	history	edited	David Richerby	CC BY-SA 3.0	copy-edit, formatting
Dec 17, 2015 at 19:25	comment	added	A.Schulz		No. Rice's Theorem says that $\{\langle M \rangle \mid \text{Turing machine }M \text{ accepts a language with property }P\}$ is undecidable.
Dec 17, 2015 at 19:21	review	Late answers
Dec 17, 2015 at 19:28
Dec 17, 2015 at 19:04	review	First posts
Dec 17, 2015 at 22:02
Dec 17, 2015 at 19:00	history	answered	Divyanshu Shende	CC BY-SA 3.0