Author:
Iacovelli Giovanni,Iacovelli Claudio
Abstract
AbstractTheoretical 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 through a combination of fundamental programming language control structures. This work proposes a mathematical framework that analytically models logic gates employing Heaviside Step Function. The existence of a correspondence between a generic finite-time algorithm and the proposed mathematical formulation is proven. The proposed interpretation is given through a well-defined logical circuit analytical expression. Relevant geometrical applications, related to polygon processing, having wide implications in engineering branches are presented together with a new Penalty Method for constrained optimization problems handling. A detailed simulation campaign is conducted to assess the effectiveness of the applications derived from the proposed mathematical framework.
Publisher
Springer Science and Business Media LLC
Reference28 articles.
1. Moschovakis, Y. N. What is an algorithm? In Mathematics Unlimited-2001 and Beyond 919–936 (Springer, 2001).
2. Bauer-Mengelberg, S. Review: Kurt godel, b. meltzer, on formally undecidable propositions of principia mathematica and related systems i. J. Symb. Logic 30(3), 359–362 (1965).
3. Turing, A. M. On computable numbers, with an application to the entscheidungsproblem. J. Math 58(345–363), 5 (1936).
4. Savage, J. E. Models of computation: Exploring the Power of Computing Vol. 136 (Addison-Wesley Reading, 1998).
5. Böhm, C. & Jacopini, G. Flow diagrams, turing machines and languages with only two formation rules. Commun. ACM 9(5), 366–371 (1966).