The Intensional Content of Rice’s Theorem (Pearl) Andrea Asperti Department of Computer Science, University of Bologna Mura Anteo Zamboni 7, 40127, Bologna, ITALY [removed]

Source URL: www.cs.unibo.it

• Mathematics
• Theory of computation
• Blum axioms
• Computable function
• ELEMENTARY
• Recursively enumerable set
• Smn theorem
• Computational complexity theory
• Lambda calculus
• Theoretical computer science
• Computability theory
• Applied mathematics