Computations with Uncertain Time Constraints: Effects on Parallelism and Universality

We introduce the class of problems with uncertain time constraints. The first type of time constraints refers to uncertain time requirements on the input, that is, when and for how long are the input data available. A second type of time constraints refers to uncertain deadlines for tasks. Our main objective is to exhibit computational problems in which it is very difficult to find out (read 'compute') what to do and when to do it. Furthermore, problems with uncertain time constraints, as described here, prove once more that it is impossible to define a 'universal computer', that is, a computer able to compute all computable functions. Finally, one of the contributions of this paper is to promote the study of a topic, conspicuously absent to date from theoretical computer science, namely, the role of physical time and physical space in computation. The focus of our work is to analyze the effect of external natural phenomena on the various components of a computational process, namely, the input phase, the calculation phase (including the algorithm and the computing agents themselves), and the output phase.

[1]  Giorgio C. Buttazzo,et al.  Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications (Real-Time Systems Series) , 2010 .

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

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

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

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

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

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

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

[9]  Selim G. Akl,et al.  The Characterization of Data-Accumulating Algorithms , 2000, Theory of Computing Systems.

[10]  Abha Moitra,et al.  Scheduling of Hard Real-Time Systems , 1986, FSTTCS.

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

[12]  Giorgio Buttazzo,et al.  Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications , 1997 .

[13]  Selim G. Akl Evolving Computational Systems , 2007, Handbook of Parallel Computing.

[14]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

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

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

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

[18]  Giorgio C. Buttazzo,et al.  Resource Reservation in Dynamic Real-Time Systems , 2004, Real-Time Systems.

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

[20]  Peter Wegner,et al.  Computation beyond turing machines , 2003, CACM.

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

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

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

[24]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[25]  Selim G. Akl,et al.  The characterization of data-accumulating algorithms , 1999, Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing. IPPS/SPDP 1999.

[26]  L. Miclea,et al.  Database Globalization in Enterprise Applications , 2006, 2006 IEEE International Conference on Automation, Quality and Testing, Robotics.

[27]  A. Whitaker The Fabric of Reality , 2001 .

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