Carpenter, Gail2011-11-142011-11-141999-11https://hdl.handle.net/2144/2245In order to benefit from the advantages of localist coding, neural models that feature winner-take-all representations at the top level of a network hierarchy must still solve the computational problems inherent in distributed representations at the lower levels.en-USCopyright 1999 Boston University. Permission to copy without fee all or part of this material is granted provided that: 1. The copies are not made or distributed for direct commercial advantage; 2. the report title, author, document number, and release date appear, and notice is given that copying is by permission of BOSTON UNIVERSITY TRUSTEES. To copy otherwise, or to republish, requires a fee and / or special permission.Combining Distributed and Localist Computations in Real-Time NetworksTechnical ReportBoston University Trustees