Skip to main content
Log in

Irreversibility, uncertainty, relativity and computer limitations

Необратимость, неопределенность, относительность и ограничения вычислений

  • Published:
Il Nuovo Cimento B (1971-1996)

Summary

Any computerM is subject to such laws as irreversibility and uncertainty of time-energy and maximality of the speed of light. This imposes fundamental limitations on the performance ofM and, more generally, on the power of algorithmic methods for several important logic operations; this also has an impact on the problem of what is knowable in mathematics.

Riassunto

Ogni computerM è sottoposto a leggi quali l’irreversibilità e l’incertezza del tempoenergia, nonchè la massimalità della velocità della luce. Tutto ciò impone delle limitazioni di carattere fondamentale sulle prestazioni diM e più in generale sulle possibilità dei metodi algoritmici di certe operazioni logiche connaturate col metodo matematico deduttivo.

Резюме

Любое вычислительное устройствоM подчиняется таким законам, как необратимость и неопределенность времени и знергии и максимальность скорости света. Эти законы налагают фундаментальные ограничения на вьшолнение вычисленийM и, более того, на возможности алгоритмических методов для некоторых важных логических операций.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. A. M. Turing:Proc. London Math. Soc.,42, 230 (1936); erratum,43, 544 (1936).

    MathSciNet  Google Scholar 

  2. A. Church:Am. J. Math.,58, 345 (1936).

    Article  MathSciNet  Google Scholar 

  3. L. Landau andE. Lifchitz:Mécanique quantique, théorie non relativiste, second edition (Moscow, 1967).

  4. L. Landau andE. Lifchitz:Physique statistique (Moscow, 1967).

  5. A. Messiah:Quantum Mechanics, I (Amsterdam, 1965).

  6. H. Friedman:Adv. Math.,16, 18 (1976).

    Article  Google Scholar 

  7. D. Mundici:Natural limitations of algorithmic procedures in logic, inAtti Accademia Nazionale dei Lincei, Roma, 1980, in publication.

  8. D. Mundici:Complexity of Craig’s interpolation, J. Symb. Logic, in publication.

  9. D. Mundici:Natural limitations of decision processes for arithmetic with bounded quantifiers, submitted for publication.

  10. M. J. Fischer andM. O. Rabin:SIAM-AMS Proc.,7, 27 (1974).

    MathSciNet  Google Scholar 

  11. R. Landauer andJ. W. F. Woo: inSynergetics, edited byH. Haken (Stuttgart, 1973), p. 97.

  12. A. V. Aho, J. E. Hopcroft andJ. D. Ullman:The Design and Analysis of Computer Algorithms (Reading, Mass. 1974).

  13. C. H. Bennet:IBM J. Res. Dev.,17, 525 (1973).

    Article  Google Scholar 

  14. D. Mundici:Compactness=JEP in any logic, Fundam. Math.,116 (1982) in publication.

  15. D. Mundici:Robinson’s consistency theorem in soft model theory, Trans. Am. Math. Soc. (February issue, 1981), in publication.

  16. D. Mundici:Ergodic undefinability in set theory and recursion theory, Proc. Am. Math. Soc. (April issue, 1981), in publication.

Download references

Author information

Authors and Affiliations

Authors

Additional information

Переведено редакцией.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mundici, D. Irreversibility, uncertainty, relativity and computer limitations. Nuov Cim B 61, 297–305 (1981). https://doi.org/10.1007/BF02721331

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02721331

Navigation