Madhavan, A.
, Tzimpragos, G.
, Stiles, M.
and Sherwood, T.
(2019),
A Truth-Matrix View into Unary Computing, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=927947
(Accessed January 24, 2025)
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
A Truth-Matrix View into Unary Computing
Published
Author(s)
, Georgios Tzimpragos, , 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
Citation
Issues
If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.
Created June 22, 2019, Updated January 27, 2020