Abstract

Clark & Thornton are too hasty in their dismissal of uninformed learning; nonmonotonic processing units show considerable promise on type-2 tasks. I describe a simulation which succeeds on a “pure” type-2 problem. Another simulation challenges Clark & Thornton 's claims about the serendipitous nature of solutions to type-2 problems