What is the theoretical minimum number of "switches" requried to implement a Turing-complete CPU?
The Rule 110 cellular automaton is apparently Turing-complete.  If you're not counting the cost of memory, I imagine a circuit that applies the Rule 110 evolution rules could be implemented with very few switches.
See also https://softwareengineering.stackexchange.com/q/230538/34181.