On the Power of Oracles in the Context of Hierarchical Intelligence
Artificial intelligence (AI) is aimed at the construction of artificial systems with intelligent behavior. At first, AI researchers tried to elaborate a uniform technological (computational) system that had intelligence. However, psychological and neurophysiological studies demonstrated heterogeneous hierarchical organization of the human psyche and intelligence. That is why the contemporary approach to AI is based on heterogeneous hierarchical architecture of computational systems. In this paper, we study the intelligence hierarchy formalized in the framework of the mathematical theory of Oracles.
Cite this Article
Mark Burgin. On the Power of Oracles in the Context of Hierarchical Intelligence. Journal of Artificial Intelligence Research & Advances. 2016; 3(2): 6–17p.
DeArmond SJ, Fusco MM, Dewey M. Structure of the Human Brain: A Photographic Atlas. New York, NY, USA: Oxford University Press; 1989.
Hwu W. Heterogeneous System Architecture, A New Compute Platform Infrastructure. Morgan Kaufmann; 2015.
Myers KL. Strategic Advice for Hierarchical Planners. In Proceedings of the 5th International Conference on Principles of Knowledge Representation and Reasoning, Morgan Kaufmann Publishers Inc.; 1996; 112–123p.
Dietterich TG. Hierarchical Reinforcement Learning with the maxq Value Function Decomposition. J Artif Intell Res. 2000; 13: 227–303p.
Livingstone D. Coevolution in Hierarchical AI for Strategy Games. In IEEE Symposium on Computational Intelligence and Games (CIG05), Essex, UK, IEEE. 2005; 190–194p.
Burgin M. Super-Recursive Algorithms. New York: Springer; 2005.
Burgin M, Eberbach E. On Foundations of Evolutionary Computation: An Evolutionary Automata Approach. In: Hongwei Mo, editor. Handbook of Research on Artificial Immune Systems and Natural Computing: Applying Complex Adaptive Technologies. Hershey, Pennsylvania: IGI Global; 2009; 342–360p.
Soare RI. Turing Oracle Machines, Online Computing, and Three Displacements in Computability Theory. Ann Pure Appl Logic. 2015; 160: 368–399p.
Edmonds J. Minimum Partition of a Matroid into Independent Subsets. J Res Natl Bur Stand. 1965; 69B: 67–72p.
Edmonds J. Matroids and the Greedy Algorithm. Math Prog. 1971; 1: 127–136p.
Vondrak J. Optimal Approximation for the Submodular Welfare Problem in the Value Oracle Model. Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing (STOC'08). 2008; 67–74p.
Burgin M, Mikkilineni R. Semantic Network Organization based on Distributed Intelligent Managed Elements. In Proceeding of the 6th International Conference on Advances in Future Internet, Lisbon, Portugal. 2014; 16–20p.
Burgin M, Mikkilineni M, Morana G. From Personal Computers to Personal Computing Networks: A New Paradigm for Computation. In Proceeding of Future Computing 2015, The Seventh International Conference on Future Computational Technologies and Applications. 2015; 24–30p.
Mikkilineni R, Morana G, Burgin M. Oracles in Software Networks: A New Scientific and Technological Approach to Designing Self-Managing Distributed Computing Processes. Proceedings of the 2015 European Conference on Software Architecture Workshops, Dubrovnik/Cavtat, Croatia, ACM. 2015; 11:1–11:8p.
Basu S. On the Structure of Subrecursive Degrees. J Comp Syst Sci. 1970; 4(5): 452–464p.
Post EL. Degrees of Recursive Unsolvability, Preliminary Report. Bull Amer Math Soc. 1948; 54: 641–642p.
Rogers H. Theory of Recursive Functions and Effective Computability. Cambridge Massachusetts: MIT Press; 1987.
Shoenfield JR. On Degrees of Unsolvability. Ann Math. 1959; 69: 644–653p.
Balcazar JL, Diaz J, Gabarro J. Structural Complexity. Berlin/Heidelberg/New York: Springer-Verlag; 1988.
Turing AM. Systems of Logic Defined by Ordinals. Proc Lond Math Soc. Ser. 2. 1939; 45: 161–228 p.
Post EL. Recursively Enumerable Sets of Positive Integers and Their Decision Problems. Bull Amer Math Soc. 1944; 50: 284–316p.
Schöning U. Complexity Theory and Interaction. In The Universal Turing Machine: A Half-Century Survey, Oxford University Press, Oxford. 1988; 561–
Homer S, Selman AL. Relative Computability. In Computability and Complexity Theory, Series Texts in Computer Science, Springer. 2011; 145–179p.
Kuratowski K, Mostowski A. Set Theory. Amsterdam: North Holland P.C.; 1967.
Burgin M. Measuring Power of Algorithms, Computer Programs, and Information Automata. New York: Nova Science Publishers; 2010.
- There are currently no refbacks.