552 research outputs found
Inteligencia artificial: una reevaluaciĂłn
This article begins with a brief reference to the history of the Artificial Intelligence (A.I.) highlighting the great figures of George Boole, Kurt Gödel and Alan Turing. The algebra of the first, the undecidability theorem of the second and the advanced machine of the third marked the fundamental milestones of this evolution. The use of the binary system and the introduction of quantum mechanics is explained, which is a great step forward by being able to count on the advantages of quantum computer and algorithms, along with quantum statistics and other new complementary technologies. Regarding the controversy over whether A.I. can outperform Human Intelligence (H.I.) we conclude at the end of the work that enormous effort made on the way to the present allows us to affirm that Artificial Intelligence constitutes, in a certain sense, an asymptote of the Human Intelligence.El artĂculo comienza con una breve referencia a la historia de la Inteligencia Artificial, (I.A.) en la que destacamos en sus respectivos apartados las eminentes figuras de George Boole, Kurt Gödel y Alan Turing. El álgebra del primero, el teorema de la indecidibilidad del segundo y la avanzada y determinante máquina del tercero marcan los hitos fundamentales de dicha evoluciĂłn. Se explica el empleo del sistema binario, asĂ como la introducciĂłn de la mecánica cuántica, lo que supone un gran paso hacia adelante, al poder contar con las ventajas de las computadoras y los algoritmos cuánticos, junto a la estadĂstica cuántica y otras nuevas tecnologĂas complementarias. Respecto a la controversia sobre si la I.A. puede superar a la Inteligencia humana, tras un Ăşltimo epĂgrafe dedicado a este tema, concluimos afirmando que el enorme esfuerzo realizado en el camino recorrido hasta la actualidad permite afirmar que la Inteligencia Artificial constituye una especie de “asĂntota” de la Inteligencia Humana.DecanatoFac. de Ciencias EconĂłmicas y EmpresarialesTRUEpu
Playing Smart - Artificial Intelligence in Computer Games
Abstract: With this document we will present an overview of artificial intelligence in general and artificial intelligence in the context of its use in modern computer games in particular. To this end we will firstly provide an introduction to the terminology of artificial intelligence, followed by a brief history of this field of computer science and finally we will discuss the impact which this science has had on the development of computer games. This will be further illustrated by a number of case studies, looking at how artificially intelligent behaviour has been achieved in selected games
A Computable Economist’s Perspective on Computational Complexity
A computable economist's view of the world of computational complexity theory is described. This means the model of computation underpinning theories of computational complexity plays a central role. The emergence of computational complexity theories from diverse traditions is emphasised. The unifications that emerged in the modern era was codified by means of the notions of efficiency of computations, non-deterministic computations, completeness, reducibility and verifiability - all three of the latter concepts had their origins on what may be called 'Post's Program of Research for Higher Recursion Theory'. Approximations, computations and constructions are also emphasised. The recent real model of computation as a basis for studying computational complexity in the domain of the reals is also presented and discussed, albeit critically. A brief sceptical section on algorithmic complexity theory is included in an appendix
Thinking Things Through
A Photcopy of Thinking Things Through, Princeton Univeresity Press, 198
- …