By adding some technologically motivated postulates to the definition of finite automata, we gain a mathematical model which permits interesting insights into the network structure of computing machines. In particular we show that the design of a strongly wired part (CPU) and a weakly wired part (storage) is advisable from the viewpoint of cost minimisation. We can also deduce some results about the interdependence of wiring density and computation time.