References needed

[A Buggy AI Program]

I would appreciate pointers to papers or tech. reports describing

1. Prof. Hinton's (or any other) work on the effect of number of hidden 
units on generalization properties of networks.

2. Prof. Rumelhart's work on incorporating cost/complexity term in the 
criterion function minimized by the back propagation algorithm with the
objective of minimizing the network complexity.

Both were discussed by the respective researchers in the talks they gave
at the CMU summer school on connectionist models.

Thanks in advance.

Vasant Honavar
honavar at ai.cs.wisc.edu