Evidence supporting quantum information processing in animals James A. Donald 1068 Fulton Av Sunnyvale, CA 94089-1505 USA I show that quantum systems can rapidly solve some problems for which finite state machines require a non- polynomially large time. This class of problems is closely related to the class of problems that animals can solve rapidly and effortlessly, but are intractable for computers by all known algorithms. 1. Introduction Animals, including very simple animals, can rapidly and effortlessly perceive objects, whereas computers take nonpolynomial time to do this by all known algorithms [1, 2, 3, 4, 5, 6]. Our persistent inability to emulate perception gives reason to doubt the current paradigm and to look for an alternative paradigm. Penrose[7] and many others [8, 9, 10] argue from practical considerations, Godel's theorem, and
Comments
Post a Comment