Introduction
We have earlier considered the foundations of recruitment learning, an approach grounded in the understanding of neural organisation and psychological function which emerged during the second half of the twentieth century. While the revolutionary findings in respect of adult neurogenesis explored in section 1.5 have deep implications for recruitment learning, we focus initially on Arbib’s earlier contention that “... a certain critical degree of structural complexity is required of a network before it can become self-modifying ... in a way that we could consider intelligent”. This chapter begins a computational exploration of these ideas, adopting the strategy of converging constraints as pioneered by Feldman and Valiant to help delineate the tasks which might be realised through the recruitment of general purpose circuits.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Diederich, J., Günay, C., Hogan, J.M. (2010). Connectivity and Candidate Structures. In: Recruitment Learning. Studies in Computational Intelligence, vol 303. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14028-0_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-14028-0_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14027-3
Online ISBN: 978-3-642-14028-0
eBook Packages: EngineeringEngineering (R0)