INFORMACIJSKA DRUŽBA IS 2005 INFORMATION SOCIETY IS 2005

Kleene’s (second) recursion theorem provides a positive counterpart to the formal reflection in Gödel’s sentence and theorems. The basic features of Kleene’s theorem and its proof are presented in a fairly nontechnical way. The possibility of applications in computational reflection is discussed, at a very basic level, with an eye on providing models of reflective cognitive processes.