"Neuromorphic Computing is Turing-Complete."

Prasanna Date et al. (2022)

Details and statistics

DOI: 10.1145/3546790.3546806

access: closed

type: Conference or Workshop Paper

metadata version: 2022-12-06

a service of  Schloss Dagstuhl - Leibniz Center for Informatics