Abstract
This paper treats fundamental properties of real computers. Unsolvable problems (the halting problem is a well-known example) are known to exist on theoretical computers such as Turing machines, random access machines, etc. This leads to a corresponding question regarding real computers: are there problems concerning computations performed on a real computer and important from viewpoint of its user which are at the same time unsolvable by the computer? We give affirmative answer here showing e.g., that the halting problem concerning a real computer and a collection of real programs satisfying a weak closure property is unsolvable by the computer. Unsolvability of another problem dealing with approximation of results of computations performed by programs from given collection is proved as well.
Any unsolvable problem is relativized with respect to a concrete. It is shown moreover that for every computer some more powerful computer can solve the problems which are unsolvable on the first computer. On the other hand there are problems concerning the capabilities of this more powerful computer that are unsolvable by it.
Thus, a hierarchy of computers is shown to exist. Each computer is more powerful then computers preceding it in the hierarchy. At the same time there are problems unsolvable by a computer from the hierarchy but solvable by computers lying in the hierarchy above it.
Consequences to computer construction as well as possible applications to computer science, analog computers, heuristic reasoning and intelligent systems are mentioned.
Key words
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aström, K.J. and B. Wittenmark (1989). Adaptive Control. Addison-Wesley, Reading, MA.
Calude, C. (1988). Theories of computational complexity. North-Holland, New York - Oxford - Tokyo.
Hoperoft, J. E. and J. D. Ullmann (1979). Introduction to automata theory, languages, and computation. Addison-Wesley, Reading, MA.
Kfoury, A. J., R. N. Moll and M. A. Arbib (1982). A Programming Approach to Computability. Springer-Verlag, New York - Heidelberg - Berlin.
Kwakernaak, H. and R. Sivan (1972). Linear Optimal Control systems. Wiley - Interscience, New York - London - Sydney - Toronto.
Ljung, L. (1987).Heidelberg - New York - Lon system Identification. Prentice-Hall, Englewood Cliffs, New Jersey.
Weihrauch, K. (1987) Computability. Springer-Verlag, Berlin - Heidelberg - New York - London - Paris - Tokyo.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer Science+Business Media New York
About this chapter
Cite this chapter
Šindelář, J. (1993). Fundamental Properties of Real Computers. In: Kárný, M., Warwick, K. (eds) Mutual Impact of Computing Power and Control Theory. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-2968-2_9
Download citation
DOI: https://doi.org/10.1007/978-1-4615-2968-2_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6291-3
Online ISBN: 978-1-4615-2968-2
eBook Packages: Springer Book Archive