Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computability theory, the Rice Shapiro theorem is a generalization of Rice''s theorem, and is named after Henry Gordon Rice and Norman Shapiro.The statement can be expressed informally as follows: given that a computable function (viewed as a black-box) is an infinite object, and we cannot hope to develop a general algorithm studying a property of function on infinite input-output pairs; there is in general no truly better way than to apply the function on some inputs and hope to get their outputs.