Skip to main content
SpringerLink
Log in

Book reviews

  • Published:
Formal Aspects of Computing

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Jouannaud, J.-P. (ed.):Rewriting Techniques and Applications, LNCS 202, Springer-Verlag 1985.

  2. Jouannaud, J.-P. (ed.):Rewriting Techniques and Applications. J. Symbolic Computation,3 (1/2) (1987).

References

  1. Calude, C.:Theories of Computational Complexity, Annals of Discrete Mathematics 35, North-Holland, 1988.

  2. Calude, C. and Malitza, M.: The Impact of NITs on Higher Education. In: Calude C. and D. Chitoran and M. Malitza (eds),The Introduction of New Information Technologies in Higher Education, pp. UNESCO, CEPES, Bucharest, 1989.

    Google Scholar 

  3. Chaitin, G. J.: On the Length of Programs for Computing Finite Binary Sequences.J. ACM, 13, 547–569 (1966).

    Google Scholar 

  4. Chaitin, G. J.: Information-Theoretic Limitations of Formal Systems.J. ACM, 21, 403–424 (1974).

    Google Scholar 

  5. Chaitin, G. J.: Incompleteness theorems for random reals.Adv. Appl. Math., 8, 119–146 (1987).

    Google Scholar 

  6. Chaitin, G. J.: Randomness in arithmetic.Scientific American, 2567, 860–862 (1988).

    Google Scholar 

  7. Davis, M.: What is a computation? In: L. A. Stein (ed.),Mathematics Today, Springer-Verlag, New York, 1978.

    Google Scholar 

  8. Delahaye, J. P.: Un problème d'arithmétique élémentaire à jamais insoluble.La Recherche, 200, 860–862 (1988).

    Google Scholar 

  9. Fine, T. L.:Theories of Probability: an Examination of Foundations, Academic Press, New York, London, 1973.

    Google Scholar 

  10. Gacs, P.: Review of [Cha87],Mathematical Reviews 88h: 68038.

  11. Jones, J. P. and Matijasevich, Yu. I.: Register Machine Proof of the Theorem on Exponential Diophantine Representation of Enumerable sets.J. Symbolic Logic, 49, 818–829 (1984).

    Google Scholar 

  12. Kolmogorov, A. N.: Three Approaches for Defining the Concept of “Information Quantity”.Problems of Information Transmission, 1, 3–11 (1965).

    Google Scholar 

  13. Kolmogorov, A. N.: Logical Basic for Information Theory and Probability Theory.IEEE Trans., IT14, 662–664 (1968).

    Google Scholar 

  14. Martin-Löf, P.: The definition of random sequences,Inform and Control, 9, 602–619 (1966).

    Google Scholar 

  15. Schnorr, C. P.:Zufälligküeit und Wahrscheinlichkeit. Eine algorithmische Begrundung der Wahrscheinlichkeitstheorie, Springer-Verlag, Berlin, Heidelberg, New York, 1971.

    Google Scholar 

  16. Stewart, I.: The ultimate in undecidability.Nature, 232, 115–116 (1988).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Loughborough

    John Cooke

  2. Bucharest

    Crustian Calude

  3. Cambridge

    Will Harwood

  4. Brighton

    Dan Simpson

Authors
  1. John Cooke
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Crustian Calude
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Will Harwood
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Dan Simpson
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cooke, J., Calude, C., Harwood, W. et al. Book reviews. Formal Aspects of Computing 1, 293–301 (1989). https://doi.org/10.1007/BF01887210

Download citation

  • Issue Date:

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

Search

Navigation