# Cloud Computing and Cloud Automata as A New Paradigm for Computation

## Keywords:

Turing Machine, Cloud Computing, Edge Cloud, Hierarchical Named Networks, Turing Oracles, Application QoS, AI, Computing Models## Abstract

Cloud computing addresses how to make right resources available to right computation to improve scaling, resiliency and efficiency of the computation. We argue that cloud computing indeed, is a new paradigm for computation with a higher order of artificial intelligence (AI), and put forward cloud automata as a new model for computation. A high-level AI requires infusing features that mimic human functioning into AI systems. One of the central features is that humans learn all the time and the learning is incremental. Consequently, for AI, we need to use computational models, which reflect incremental learning without stopping (sentience). These features are inherent in reflexive, inductive and limit Turing machines. To construct cloud automata, we use the mathematical theory of Oracles, which include Oracles of Turing machines as its special case. We develop a hierarchical approach based on Oracles with different ranks that includes Oracle AI as a special case. Discussing a named-set approach, we describe an implementation of a high-performance edge cloud using hierarchical name-oriented networking and Oracle AI-based orchestration. We demonstrate how cloud automata with a control overlay allows microservice network provisioning, monitoring and reconfiguration to address non-deterministic fluctuations affecting their behavior without interrupting the overall evolution of computation.

### Downloads

## References

Armstrong, S., Sandberg, A. and Bostrom, N. (2012) Thinking Inside the Box: Controlling and Using an Oracle AI, Minds and Machines, v. 22, No. 4, pp. 299-324

Burgin, M. (2005) Super-recursive Algorithms, New York: Springer.

Burgin, M. Grammars with Prohibition and Human-Computer Interaction, in “Proceedings of the Business and Industry Simulation Symposium,” Society for Modeling and Simulation International, San Diego, California, 2005a, pp. 143-147

Burgin, M. Interactive Hypercomputation, in Proceedings of the 2007 International Conference on Foundations of Computer Science (FCS'07), CSREA Press, Las Vegas, Nevada, USA, 2007, pp. 328-333

Burgin, M. (2011) Theory of Named Sets, New York: Nova Science.

Burgin, M. (2014). Periodic Turing Machines, Journal of Computer Technology & Applications, v. 5, No 3, pp. 6 – 18

Burgin, M. (2015) Inductive Cellular Automata, International Journal of Data Structures and Algorithms, v. 1, No 1, pp. 1-9

Burgin, M. (2016) On the power of oracles in the context of hierarchical intelligence, Journal of Artificial Intelligence Research & Advances, v. 3, No. 2, pp. 6 - 17

Burgin, M. (2017) Inaccessible Information and the Mathematical Theory of Oracles, in Information Studies and the Quest for Transdisciplinarity: Unity through Diversity, World Scientific, New York/London/Singapore, pp. 59 - 114

Burgin, M. (2017). Swarm Superintelligence and Actor Systems, International Journal of Swarm Intelligence and Evolutionary Computation, v. 6, No. 3, open access.

Burgin, M. and Eberbach, E. (2009) On foundations of evolutionary computation: an evolutionary automata approach, in Hongwei Mo (Ed.), Handbook of Research on Artificial Immune Systems and Natural Computing: Applying Complex Adaptive Technologies, IGI Global, Hershey, Pennsylvania, pp. 342-360

Burgin, M. and Eberbach, E. (2012) Evolutionary Automata: Expressiveness and Convergence of Evolutionary Computation, Computer Journal, vol. 55, no. 9, 1023-1029 (doi: dx.doi.org/10.1093/comjnl/bxr099).

Burgin, M., Liu, D., and Karplus, W. (2001) The Problem of Time Scales in Computer Visualization, in “Computational Science”, Lecture Notes in Computer Science, v. 2074, part II, pp.728-737

Burgin, M. and Mikkilineni, R. (2018) Cloud computing based on agent technology, super-recursive algorithms and DNA, Int. J. Grid and Utility Computing, v. 9, No. 2, pp.193–204

Burgin, M. and Smith, M.L. (2010) A Theoretical Model for Grid, Cluster and Internet Computing, in Selected Topics in Communication Networks and Distributed Systems, World Scientific, New York/London/Singapore, pp. 485-535

Case, J. and Jain, S. Rice and Rice-Shapiro (2011) Theorems for Transfinite Correction Grammars, Mathematical Logic Quarterly, 28 October 1-13

Case, J. and Royer, J. Program Size Complexity of Correction Grammars in the Ershov Hierarchy. In (A. Beckmann, L. Bienvenu, and N. Jonoska, Eds) (2016) Pursuit of the Universal - Twelfth Conference of Computability in Europe (CiE 2016), Proceedings}, Lecture Notes in Computer Science}, Volume~7921, pp.~240--250, Springer, Heidelberg.

Copeland, B.J. (2002) Accelerating Turing Machines. Minds and Machines 12, pp. 281–301

Curnow, T. (2004) The Oracles of the Ancient World: A Comprehensive Guide, Duckworth, London,

Eberbach, E., (2005) Toward a Theory of Evolutionary Computation, BioSystems, vol.82, no.1, 2005, 1-19.

Eberbach, E., (2007) The $-Calculus Process Algebra for Problem Solving: A Paradigmatic Shift in Handling Hard Computational Problems, Theoretical Computer Science, vol.383, no.2-3, 200-243

Eberbach E. (2015) On Hypercomputation, Universal and Diagonalization Complete Problems, Fundamenta Informaticae, IOS Press, 139 (4), 2015, 329-346, DOI 10.3233/FI-2015-1237.

Eberbach E. (2017) State of the Art of Information Technology Computing Models for Autonomic Cloud Computing, Proc. MDPI 2017, 1(3), 190; doi:10.3390/IS4SI-2017-04028; IS4SI 2017 Summit: Digitalisation for a Sustainable Society, Gothenburg, Sweden, June 12-16, 2017.

Eberbach E., Goldin D. and Wegner P. (2004), Turing’s Ideas and Models of Computation, in: (ed. Ch. Teuscher) Alan Turing: Life and Legacy of a Great Thinker, Springer-Verlag, 2004, 159-194.

Farley J. (1998), Java Distributed Computing, O’Reilly, 1998.

Gödel K. (1931) Über formal unentscheidbare Sätze der Principia Mathematica und verwander Systeme, Monatschefte für Mathematik und Physik, 38:173-198, 1931.

Hamkins, J.D., and Lewis, A. (2000) Infinite time Turing machines, Journal of Symbolic Logic, v. 65, No. 3, pp. 567-604

Leeson, P.T. (2014) Oracles, Rationality and Society, v. 26(2) 141–169

Mikkilineni, R., Morana, G. and 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, September 7-11, 2015, ACM, 2015, pp. 11:1-11:8

Milner, R., A Calculus of Communicating Systems, LNCS 94, Springer-Verlag, 1980

Rogers, H. Theory of Recursive Functions and Effective Computability, MIT Press, Cambridge Massachusetts, 1987

Siegelmann, H.T. (1999) Neural Networks and Analog Computation: Beyond the Turing Limit, Birkhauser, Berlin

Tanenbaum, A. and Bos, H. (2015) Modern Operating Systems, Fourth Ed., Pearson

Tanenbaum, A. and Wetherall, D. (2011) Computer Networks, Fifth Ed., Pearson

Turing, A. M. (1939) Systems of logic defined by ordinals, Proc. Lond. Math. Soc., Ser. 2, v. 45, pp. 161-228

## Published

## How to Cite

*Computer Reviews Journal*,

*4*, 113-134. Retrieved from https://purkh.com/index.php/tocomp/article/view/459