Any function that can be computed on a connectionist network, can also be computed on a serial machine. In fact, most current connectionist networks are simulated on serial machines. Conversely, connectionist networks can be used to implement classical serial processing. Thus, arguments directed against the formal character of symbol manipulators apply equally well against connectionist networks.

Supported by "Mathematical insight is Non-Algorhythmic", Map 7, Box 23.

Note: the point the connectionist networks and symbol systems can simulate each other is widely accepted. Searle and Penrose use this point to show that the Chinese Room & Goedel arguments, respectively, apply to connectionist networks as well as to classical AI systems.
 
John Searle, 1990b & Roger Penrose, 1989.