Cargando…
Representing logic gates over Euclidean space via heaviside step function
Theoretical concepts asserted by Alan Turing are the basis of the computation and hence of machine intelligence. Turing Machine, the fundamental computational model, has been proven to be reducible to a logic circuit and, at the same time, portable into a computer program that can be expressed throu...
Autores principales: | Iacovelli, Giovanni, Iacovelli, Claudio |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group UK
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9107489/ https://www.ncbi.nlm.nih.gov/pubmed/35568712 http://dx.doi.org/10.1038/s41598-022-11941-y |
Ejemplares similares
-
Decomposition of multivariate function using the Heaviside step function
por: Chikayama, Eisuke
Publicado: (2014) -
Heaviside's electric circuit theory
por: Josephs, H J
Publicado: (1950) -
Hardy spaces on the Euclidean space
por: Uchiyama, Akihito
Publicado: (2001) -
A derivation of Maxwell's equations using the Heaviside notation
por: Hampshire, Damian P.
Publicado: (2018) -
Single image super-resolution based on approximated Heaviside functions and iterative refinement
por: Wang, Xin-Yu, et al.
Publicado: (2018)