Simulation of Turing machine with uEAC-computable functions (Q1665037)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6925822
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simulation of Turing machine with uEAC-computable functions |
scientific article; zbMATH DE number 6925822 |
Statements
Simulation of Turing machine with uEAC-computable functions (English)
0 references
27 August 2018
0 references
Summary: The micro-Extended Analog Computer (uEAC) is an electronic implementation inspired by Rubel's EAC model. In this study, a fully connected uEACs array is proposed to overcome the limitations of a single uEAC, within which each uEAC unit is connected to all the other units by some weights. Then its computational capabilities are investigated by proving that a Turing machine \(\mathcal{M}\) can be simulated with uEAC-computable functions, even in the presence of bounded noise.
0 references
0.7377499938011169
0 references
0.7303335666656494
0 references
0.7203083038330078
0 references
