This paper presents an examination of channel based time delays and their application as units which perform storage and computation. We describe the implementation of compound arithmetic operations, and show that by recirculating the impulses along a channel, both memory and computation can be achieved on the same general channel unit. In addition, this approach has the further advantage of performing arithmetic simplification eagerly, so that the resultant use of memory is optimised by the intermediate processing during memory circulation phases.
Awarded best poster; 15th International Conference on Unconventional Computation and Natural Computation, UCNC 2016, Manchester, UK, 11-15 July 2016
Paper publication; IEEE Symposium Series on Computational Intelligence, SSCI 2016, Athens, Greece, 6-9 December 2016
The focus of this paper is the examination of the temporal pattern recognition capacities of a simplified action potential model similar to the one proposed by Hopfield et al. The features of a simplified model that differ from the Hopfield model are the lack of logarithmic scaling, addition of speed to set the pattern, and a more thorough specification of what is meant, by synchronicity, by explicitly identifying an activation window where approximate alignment causes output activation. The simplified model is shown to work with the Analogue Match problem. Two further extensions of the Analogue Match problem are proposed. The first incorporates noise into the signal intensity (noisy inputs) and the second introduces noise into the recognition vector (noisy patterns). The simplified action potential model is shown to function in the short-term using a fixed window so long as the noise is in proportion to the signal intensity.
ACM International Conference on Computing Frontiers 2015, Ischia, Italy, 18-21 May 2015
This paper examines a scheme to perform arithmetic and logic computation using time delays inspired by neuronal Action Potentials. The method is reliant on a simple abstraction which utilises very little logical infrastructure, in fact, the only requirements necessary to carry out computation are a binary channel, a clock, and a rudimentary instruction look-up table. The conclusions are that the method is viable for all forms of arithmetic and logical computation including comparison, however one practical aspect that hinders a full move to a time delay based architecture is the inability to perform random memory access without waiting for the data to recirculate.
13th International Conference on Unconventional Computation and Natural Computation, London, Ontario, Canada, 14-18 July 2014, pp. 155-163