Skip to main content
Springer Nature Link
Log in

Baudelaire’s Ideas of Vagueness and Uniqueness in Art: Algorithm-Based Explanations

  • Chapter
  • First Online:
Decision Making Under Uncertainty and Constraints

Part of the book series: Studies in Systems, Decision and Control ((SSDC,volume 217))

Abstract

According to the analysis by the French philosopher Jean-Paul Sartre, the famous French poet and essayist Charles Baudelaire described (and followed) two main—somewhat unusual—ideas about art: that art should be vague, and that to create an object of art, one needs to aim for uniqueness. In this paper, we provide an algorithm-based explanation for these seemingly counter-intuitive ideas, explanation related to Kolmogorov complexity-based formalization of Garrett Birkhoff’s theory of beauty.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Beeson, M.J.: Foundations of Constructive Mathematics. Springer, N.Y. (1985)

    Book  MATH  Google Scholar 

  2. Beigel, R., Buhrman, H., Fortnow, L.: NP might not be as easy as detecting unique solutions. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing (STOC), pp. 203–208 (1998)

    Google Scholar 

  3. Birkhoff, G.D.: A mathematical approach to aesthetics. Scientia 50, 133–146 (reprinted in Ref. [8], vol. 3, pp. 320–333)

    Google Scholar 

  4. Birkhoff, G.D.: A mathematical theory of aesthetics. Rice Institute Pamphlet, vol. 19, pp. 189–342 (1932) (reprinted in Ref. [8], vol. 3, pp. 382–535)

    Google Scholar 

  5. Birkhoff, G.D.: Aesthetic Measure. Harvard University Press, Cambridge, Massachisetts (1933)

    Book  MATH  Google Scholar 

  6. Birkhoff, G.D.: Three public lectures on scientific subjects. Rice Institute Pamphlet, vol. 28, pp. 1–76 (1941) (reprinted in Ref. [8], vol. 3, pp. 755–777)

    Google Scholar 

  7. Birkhoff, G.D.: Mathematics of aesthetics. In: Newman, J.R. (ed.) The World of Mathematics, vol. 4, pp. 2185–2208. Simon and Schuster, New York (1956)

    Google Scholar 

  8. Birkhoff, G.B.: Collected Mathematical Papers. Dover, New York (1960)

    Google Scholar 

  9. Birkhoff, G.: Mathematics and psychology. SIAM Rev. 11(4), 429–467 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  10. Bishop, E.: Foundations of Constructive Analysis. McGraw-Hill (1967)

    Google Scholar 

  11. Bishop, E., Bridges, D.S.: Constructive Analysis. Springer, N.Y. (1985)

    Book  MATH  Google Scholar 

  12. Bridges, D.S.: Constructive Functional Analysis. Pitman, London (1979)

    MATH  Google Scholar 

  13. Bridges, D.S., Vita, S.L.: Techniques of Constructive Analysis. Springer, New York (2006)

    MATH  Google Scholar 

  14. Jaynes, E.T., Bretthorst, G.L.: Probability Theory: The Logic of Science. Cambridge University Press, Cambridge, UK (2003)

    Book  Google Scholar 

  15. Kohlenbach, U.: Theorie der majorisierbaren und stetigen Funktionale und ihre Anwendung bei der Extraktion von Schranken aus inkonstruktiven Beweisen: Effektive Eindeutigkeitsmodule bei besten Approximationen aus ineffektiven Eindeutigkeitsbeweisen, Ph.D. dissertation, Frankfurt am Main (1990)

    Google Scholar 

  16. Kohlenbach, U.: Effective moduli from ineffective uniqueness proofs. An unwinding of de La Vallée Poussin’s proof for Chebycheff approximation. Annals Pure Appl. Logic 64(1), 27–94 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  17. Kohlenbach, U.: Applied Proof Theory: proof Interpretations and their Use in Mathematics. Springer, Berlin-Heidelberg (2008)

    MATH  Google Scholar 

  18. Kreinovich, V.: Uniqueness implies algorithmic computability. In: Proceedings of the 4th Student Mathematical Conference, pp. 19–21. Leningrad University, Leningrad (1975) (in Russian)

    Google Scholar 

  19. Kreinovich, V.: Reviewer’s remarks in a review of D.S. Bridges. In: Constrictive Functional Analysis, Pitman, London (1979); Zentralblatt für Mathematik, vol. 401, pp. 22–24 (1979)

    Google Scholar 

  20. Kreinovich, V.: Categories of space-time models, Ph.D. dissertation, Novosibirsk, Soviet Academy of Sciences, Siberian Branch, Institute of Mathematics (1979) (in Russian)

    Google Scholar 

  21. Kreinovich, V.: Philosophy of Optimism: notes on the Possibility of using algorithm theory when describing historical processes, Leningrad Center for New Information Technology “Informatika”. Technical Report, Leningrad (1989) (in Russian)

    Google Scholar 

  22. Kreinovich, V.: Physics-motivated ideas for extracting efficient bounds (and algorithms) from classical proofs: beyond local compactness, beyond uniqueness. In: Abstracts of the Conference on the Methods of Proof Theory in Mathematics, p. 8. Max-Planck Institut für Mathematik, Bonn, Germany (2007)

    Google Scholar 

  23. Kreinovich, V., Lakeyev, A., Rohn, J., Kahl, P.: Computational Complexity and Feasibility of Data Processing and Interval Computations. Kluwer, Dordrecht (1998)

    Book  MATH  Google Scholar 

  24. Kreinovich, V., Longpré, L., Koshelev, M.: Kolmogorov complexity, statistical regularization of inverse problems, and Birkhoff’s formalization of beauty. In: Mohamad-Djafari, A. (ed.) Bayesian Inference for Inverse Problems, Proceedings of the SPIE/International Society for Optical Engineering, vol. 3459, pp. 159–170, San Diego, CA (1998)

    Google Scholar 

  25. Kreinovich, V., Villaverde, K.: Extracting computable bounds (and algorithms) from classical existence proofs: Girard domains enable us to go beyond local compactness. Int. J. Intell. Technol. Appl. Stat. (IJITAS) 12(2), 99–134 (2019)

    Google Scholar 

  26. Kushner, B.A.: Lectures on constructive mathematical analysis. American Mathematical Society Providence, Rhode Island (1984)

    Google Scholar 

  27. Lacombe, D.: Les ensembles récursivement ouvert ou fermés, et leurs applications à l’analyse récurslve. Comptes Rendus de l’Académie des Sci. 245(13), 1040–1043 (1957)

    MathSciNet  MATH  Google Scholar 

  28. Li, M., Vitányi, P.: An Introduction to Kolmogorov Complexity and Its Applications. Springer, Berlin, Heidelberg, New York (2008)

    Book  MATH  Google Scholar 

  29. Lifschitz, V.A.: Investigation of constructive functions by the method of fillings. J. Sov. Math. 1, 41–47 (1973)

    Article  Google Scholar 

  30. Longpré, L., Kreinovich, V., Gasarch, W., Walster, G.W.: \(m\) solutions good, \(m-1\) solutions better. Appl. Math. Sci. 2(5), 223–239 (2008)

    MathSciNet  MATH  Google Scholar 

  31. Pour-El, M., Richards, J.: Computability in Analysis and Physics. Springer, New York (1989)

    Book  MATH  Google Scholar 

  32. Sartre, J.-P.: Baudelaire. New Direction Publ, New York (1967)

    Google Scholar 

  33. Valiant, L.G., Vazirani, V.V.: NP is as easy as detecting unique solutions. Theor. Comput. Sci. 47, 85–93 (1986)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This work was supported in part by the National Science Foundation grants 1623190 (A Model of Change for Preparing a New Generation for Professional Practice in Computer Science), and HRD-1834620 and HRD-2034030 (CAHSI Includes). It was also supported by the program of the development of the Scientific-Educational Mathematical Center of Volga Federal District No. 075-02-2020-1478.

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Texas at El Paso, 500 W. University, El Paso, TX, 79968, USA

    Luc Longpré & Vladik Kreinovich

  2. Department of Teacher Education, University of Texas at El Paso, 500 W. University, El Paso, TX, 79968, USA

    Olga Kosheleva

Authors
  1. Luc Longpré
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Olga Kosheleva
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vladik Kreinovich
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vladik Kreinovich .

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Texas at El Paso, El Paso, TX, USA

    Martine Ceberio

  2. Department of Computer Science, University of Texas at El Paso, El Paso, TX, USA

    Vladik Kreinovich

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Longpré, L., Kosheleva, O., Kreinovich, V. (2023). Baudelaire’s Ideas of Vagueness and Uniqueness in Art: Algorithm-Based Explanations. In: Ceberio, M., Kreinovich, V. (eds) Decision Making Under Uncertainty and Constraints. Studies in Systems, Decision and Control, vol 217. Springer, Cham. https://doi.org/10.1007/978-3-031-16415-6_1

Download citation

Publish with us

Policies and ethics