Technical Report No. 2015-625 ON COMPUTABLE NUMBERS, NONUNIVERSALITY, AND THE GENUINE POWER OF PARALLELISM

We present a simple example that disproves the universality principle. Unlike previous counter-examples to computational universality, it does not rely on extraneous phenomena, such as the availability of input variables that are time varying, computational complexity that changes with time or order of execution, physical variables that interact with each other, uncertain deadlines, or mathematical conditions among the variables that must be obeyed throughout the computation. In the most basic case of the new example, all that is used is a single pre-existing global variable whose value is modified by the computation itself. In addition, our example offers a new dimension for separating the computable from the uncomputable, while illustrating the power of parallelism in computation.

[1]  Selim G. Akl,et al.  Parallel Computation and Measurement Uncertainty in Nonlinear Dynamical Systems , 2005, J. Math. Model. Algorithms.

[2]  Dino Mandrioli,et al.  Theoretical foundations of computer science , 1987 .

[3]  Hava T. Siegelmann,et al.  Neural networks and analog computation - beyond the Turing limit , 1999, Progress in theoretical computer science.

[4]  Christos H. Papadimitriou,et al.  Elements of the Theory of Computation , 1997, SIGA.

[5]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[6]  Lydia Kronsjö.  Computational complexity of sequential and parallel algorithms , 1986, Wiley series in computing.

[7]  Peter Wegner,et al.  The Church-Turing Thesis: Breaking the Myth , 2005, CiE.

[8]  Christof Teuscher,et al.  From Utopian to Genuine Unconventional Computers , 2006 .

[9]  Roland Wismüller,et al.  Parallel and distributed computing , 2001, Softw. Focus.

[10]  Selim G. Akl,et al.  Parallelism in Quantum Information Processing Defeats the Universal Computer , 2007, Parallel Process. Lett..

[11]  Satish K. Tripathi,et al.  Parallel and Distributed Computing Handbook , 1995 .

[12]  Marcin Paprzycki,et al.  Handbook on Parallel and Distributed Processing , 2001 .

[13]  Peter Zinterhof,et al.  Parallel Computing: Numerics, Applications, and Trends , 2009 .

[14]  Mark Burgin,et al.  Super-Recursive Algorithms , 2004, Monographs in Computer Science.

[15]  E. B. Davies.  Building Infinite Machines , 2001, The British Journal for the Philosophy of Science.

[16]  D. Deutsch.  The fabric of reality , 1997, The Art of Political Storytelling.

[17]  Selim G. Akl,et al.  The Future of Parallel Computation , 2009 .

[18]  D. S. SzyId,et al.  Parallel Computation: Models And Methods , 1998, IEEE Concurrency.

[19]  Ursula Dresdner,et al.  Computation Finite And Infinite Machines , 2016 .

[20]  Selim G. Akl,et al.  On the Importance of Parallelism for Quantum Computation and the Concept of a Universal Computer , 2005, UC.

[21]  Selim G. Akl,et al.  Computations with Uncertain Time Constraints: Effects on Parallelism and Universality , 2011, UC.

[22]  Selim G. Akl,et al.  Quantum Measurements and Universal Computation , 2006, Int. J. Unconv. Comput..

[23]  Cristian S. Calude,et al.  Bio-steps beyond Turing. , 2004, Bio Systems.

[24]  James B. Morris.  Formal Languages and their Relation to Automata , 1970 .

[25]  Roberto Bruni,et al.  Models of Computation , 2017, Texts in Theoretical Computer Science. An EATCS Series.

[26]  Klaus H. Ecker,et al.  Handbook on Parallel and Distributed Processing , 2000, International Handbooks on Information Systems.

[27]  Martin D. Davis,et al.  Computability and Unsolvability , 1959, McGraw-Hill Series in Information Processing and Computers.

[28]  C. D. Walter.  Algorithmics–The spirit of computing , 1988 .

[29]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[30]  Selim G. Akl.  Unconventional Computational Problems with Consequences to Universality , 2008, Int. J. Unconv. Comput..

[31]  Lance Fortnow,et al.  The Enduring Legacy of the Turing Machine , 2012, Comput. J..

[32]  E T. Leighton,et al.  Introduction to parallel algorithms and architectures , 1991 .

[33]  Selim G. Akl,et al.  Computing with uncertainty and its implications to universality , 2012, Int. J. Parallel Emergent Distributed Syst..

[34]  B. Jack Copeland,et al.  Super Turing-machines , 1998, Complex..

[35]  John D. Norton,et al.  Infinite pains: the trouble with supertasks , 1996 .

[36]  Selim G. Akl.  Three Counterexamples to Dispel the Myth of the Universal Computer , 2006, Parallel Process. Lett..

[37]  S. Sitharama Iyengar,et al.  Introduction to parallel algorithms , 1998, Wiley series on parallel and distributed computing.

[38]  Selim G. Akl.  Even Accelerating Machines are Not Universal , 2007, Int. J. Unconv. Comput..

[39]  Samson Abramsky,et al.  Handbook of logic in computer science. , 1992 .

[40]  Eitan M. Gurari,et al.  Introduction to the theory of computation , 1989 .

[41]  Esslli Site,et al.  Models of Computation , 2012 .

[42]  Selim G. Akl,et al.  Nonuniversality in Computation: Fifteen Misconceptions Rectified , 2017 .

[43]  B. Jack Copeland,et al.  Hypercomputation , 2004, Minds and Machines.

[44]  Peter Wegner,et al.  Why interaction is more powerful than algorithms , 1997, CACM.

[45]  Eric Steinhart,et al.  Infinitely Complex Machines , 2007 .

[46]  H. Stowell.  The emperor's new mind R. Penrose, Oxford University Press, New York (1989) 466 pp. $24.95 , 1990, Neuroscience.

[47]  Susan Stepney,et al.  Non-Classical Hypercomputation , 2009, Int. J. Unconv. Comput..

[48]  Zbigniew J. Czech,et al.  Introduction to Parallel Computing , 2017 .

[49]  H. James Hoover,et al.  Limits to parallel computation , 1995 .

[50]  Selim G. Akl.  Superlinear Performance in Real-Time Parallel Computation , 2004, The Journal of Supercomputing.

[51]  István Németi,et al.  Non-Turing Computations Via Malament–Hogarth Space-Times , 2001 .

[52]  Selim G. Akl,et al.  Introduction to Parallel Computation , 2009 .

[53]  Selim G. Akl,et al.  What is computation? , 2014, Int. J. Parallel Emergent Distributed Syst..

[54]  Mike Stannett,et al.  X-machines and the halting problem: Building a super-turing machine , 1990, Formal Aspects of Computing.

[55]  Selim G. Akl,et al.  Accelerating machines: a review , 2008, Int. J. Parallel Emergent Distributed Syst..

[56]  Joseph JáJá,et al.  An Introduction to Parallel Algorithms , 1992 .

[57]  Selim G. Akl,et al.  Nonuniversality explained , 2016, Int. J. Parallel Emergent Distributed Syst..

[58]  Selim G. Akl.  Time Travel: A New Hypercomputational Paradigm , 2010, Int. J. Unconv. Comput..

[59]  Selim G. Akl,et al.  Design and analysis of parallel algorithms , 1985 .

[60]  Peter J. Denning.  Reflections on a Symposium on Computation , 2012, Comput. J..

[61]  Klaus Iglberger,et al.  Parallel Computing. Numerics, Applications, and Trends , 2009 .

[62]  Danny Hillis,et al.  The Pattern on the Stone , 1998 .

[63]  Selim G. Akl,et al.  Quantum computing: beyond the limits of conventional computation , 2007, Int. J. Parallel Emergent Distributed Syst..

[64]  Jan van Leeuwen,et al.  The Turing machine paradigm in contemporary computing , 2001 .