Shane Legg wrote:
Thus I think that the analogue of Gödel's theorem here would be something more like: For any formal definition of intelligence there will exist a form of intelligence that cannot be proven to be intelligent even though it is intelligent.
With unlimited computing power this is obvious. Take a computation that halts if it finds an even number that is not the sum of two primes. Append AIXItl. QED.
-- Eliezer S. Yudkowsky http://singinst.org/ Research Fellow, Singularity Institute for Artificial Intelligence ----- This list is sponsored by AGIRI: http://www.agiri.org/email To unsubscribe or change your options, please go to: http://v2.listbox.com/member/?member_id=231415&user_secret=fabd7936
