Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015, Article ID 236806, 8 pages
Research Article

Simulation of Turing Machine with uEAC-Computable Functions

1School of Automation, Beijing Institute of Technology, Beijing 100081, China
2Department of Electrical and Computer Engineering, Indiana University-Purdue University Indianapolis, Indianapolis, IN 46202, USA

Received 10 June 2015; Accepted 3 November 2015

Academic Editor: Jean J. Loiseau

Copyright © 2015 Yilin Zhu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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 can be simulated with uEAC-computable functions, even in the presence of bounded noise.