A Truth-Matrix View into Unary Computing

Published: June 22, 2019

Author(s)

Advait Madhavan, Georgios Tzimpragos, Mark D. Stiles, Timothy Sherwood

Abstract

Our community has been exploring Time-of-arrival based codes as a candidate for very low energy information processing. A ``space-time'' algebra has been recently proposed that captures the essential features of such a paradigm. In order to gain some insight into the behaviour of such a new representation, we propose using temporal equivalents of conventional Boolean truth tables. We use the basics of ``space-time algebra'' as a launching point, and re- examine key ideas such as normalization, invariance, non-prescience and causality, as well as the behaviour of operators from the perspective of these temporal truth matrices. We stress on the importance of coincidence and use these tables to provide a visual understanding of why coincidence ends up being an essential feature of universality in this new paradigm. We end with a simple example of how co-incidence can be used to perform edge detection on images and compare it with classical edge detectors.
Pub Type: Talks

Download Paper

Created June 22, 2019, Updated August 08, 2019