Imitation programming unorganised machines

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In 1948 Alan Turing presented a general representation scheme by which to achieve artificial intelligence-his unorganised machines. Further, at the same time as also suggesting that natural evolution may provide inspiration for search, he noted that mechanisms inspired by the cultural aspects of learning may prove useful. This chapter presents results from an investigation into using Turing's dynamical network representation designed by a new imitation-based, i.e., cultural, approach. Moreover, the original synchronous and an asynchronous form of unorganised machines are considered, along with their implementation in memristive hardware.

Cite

CITATION STYLE

APA

Bull, L. (2013). Imitation programming unorganised machines. Studies in Computational Intelligence, 427, 63–81. https://doi.org/10.1007/978-3-642-29694-9_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free