If the set of all interesting stories is a productive set, and if humans are able to decide, swiftly and routinely, which stories are interesting and which are not, then Church’s famous and almost universally affirmed thesis--that what can be effectively computed is co-extensive with what can be algorithmically computed -- must be false. We adumbrate and defend this reasoning herein.

This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.