Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Akl, S.G.: Universality in computation: Some quotes of interest. Technical Report No. 2006-511, School of Computing, Queen’s University, Kingston, Ontario (2006)
Akl, S.G.: Three counterexamples to dispel the myth of the universal computer. Parallel Processing Letters 16, 381–403 (2006)
Akl, S.G.: Even accelerating machines are not universal. International Journal of Unconventional Computing 3, 105–121 (2007)
Akl, S.G.: Evolving Computational Systems. In: Rajasekaran, S., Reif, J.H. (eds.) Handbook of Parallel Computing: Models, Algorithms, and Applications, pp. 1–22. Taylor and Francis, CRC Press, Boca Raton (2008)
Akl, S.G.: Unconventional Computational Problems with Consequences to Universality. International Journal of Unconventional Computing 4, 89–98 (2008)
Akl, S.G.: Ubiquity and Simultaneity: The Science and Philosophy of Space and Time in Unconventional Computation. Invited talk, Conference on the Science and Philosophy of Unconventional Computing. The University of Cambridge, Cambridge (2009)
Akl, S.G.: Time travel: A New Hypercomputational Paradigm. International Journal of Unconventional Computing 6, 329–351 (2011)
Bruda, S.D., Akl, S.G.: The Characterization of Data-Accumulating Algorithms. Theory of Computing Systems 33, 85–96 (2000)
Buttazzo, G.C.: Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications. Kluwer Academic Publishers, Boston (1997)
Buttazzo, G.C.: Soft Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications. Springer, New York (2005)
Calude, C.S., Păun, G.: Bio-Steps Beyond Turing. BioSystems 77, 175–194 (2004)
Deutsch, D.: The Fabric of Reality. Penguin Books, London (1997)
Etesi, G., Németi, I.: Non-Turing Computations via Malament-Hogarth Space-Times. International Journal of Theoretical Physics 41, 341–370 (2002)
Nagy, M., Akl, S.G.: Quantum Measurements and Universal Computation. International Journal of Unconventional Computing 2, 73–88 (2006)
Siegelmann, H.T.: Neural Networks and Analog Computation: Beyond the Turing limit. Birkhäuser, Boston (1999)
Stannet, M.: X-machines and the Halting Problem: Building a Super-Turing Machine. Formal Aspects of Computing 2, 331–341 (1990)
Wegner, P., Goldin, D.: Computation Beyond Turing Machines. Communications of the ACM 46, 100–102 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nagy, N., Akl, S.G. (2011). Computations with Uncertain Time Constraints: Effects on Parallelism and Universality. In: Calude, C.S., Kari, J., Petre, I., Rozenberg, G. (eds) Unconventional Computation. UC 2011. Lecture Notes in Computer Science, vol 6714. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21341-0_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-21341-0_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21340-3
Online ISBN: 978-3-642-21341-0
eBook Packages: Computer ScienceComputer Science (R0)