{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:03:55Z","timestamp":1742922235621,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031164149"},{"type":"electronic","value":"9783031164156"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-16415-6_1","type":"book-chapter","created":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T07:03:51Z","timestamp":1672729431000},"page":"3-9","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Baudelaire\u2019s Ideas of Vagueness and Uniqueness in Art: Algorithm-Based Explanations"],"prefix":"10.1007","author":[{"given":"Luc","family":"Longpr\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olga","family":"Kosheleva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladik","family":"Kreinovich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,4]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-68952-9","volume-title":"Foundations of Constructive Mathematics","author":"MJ Beeson","year":"1985","unstructured":"Beeson, M.J.: Foundations of Constructive Mathematics. Springer, N.Y. (1985)"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"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\u2013208 (1998)","DOI":"10.1145\/276698.276737"},{"key":"1_CR3","unstructured":"Birkhoff, G.D.: A mathematical approach to aesthetics. Scientia 50, 133\u2013146 (reprinted in Ref.\u00a0[8], vol. 3, pp. 320\u2013333)"},{"key":"1_CR4","unstructured":"Birkhoff, G.D.: A mathematical theory of aesthetics. Rice Institute Pamphlet, vol. 19, pp. 189\u2013342 (1932) (reprinted in Ref.\u00a0[8], vol. 3, pp. 382\u2013535)"},{"key":"1_CR5","doi-asserted-by":"publisher","DOI":"10.4159\/harvard.9780674734470","volume-title":"Aesthetic Measure","author":"GD Birkhoff","year":"1933","unstructured":"Birkhoff, G.D.: Aesthetic Measure. Harvard University Press, Cambridge, Massachisetts (1933)"},{"key":"1_CR6","unstructured":"Birkhoff, G.D.: Three public lectures on scientific subjects. Rice Institute Pamphlet, vol. 28, pp. 1\u201376 (1941) (reprinted in Ref.\u00a0[8], vol. 3, pp. 755\u2013777)"},{"key":"1_CR7","unstructured":"Birkhoff, G.D.: Mathematics of aesthetics. In: Newman, J.R. (ed.) The World of Mathematics, vol. 4, pp. 2185\u20132208. Simon and Schuster, New York (1956)"},{"key":"1_CR8","volume-title":"Collected Mathematical Papers","author":"GB Birkhoff","year":"1960","unstructured":"Birkhoff, G.B.: Collected Mathematical Papers. Dover, New York (1960)"},{"issue":"4","key":"1_CR9","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1137\/1011085","volume":"11","author":"G Birkhoff","year":"1969","unstructured":"Birkhoff, G.: Mathematics and psychology. SIAM Rev. 11(4), 429\u2013467 (1969)","journal-title":"SIAM Rev."},{"key":"1_CR10","unstructured":"Bishop, E.: Foundations of Constructive Analysis. McGraw-Hill (1967)"},{"key":"1_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61667-9","volume-title":"Constructive Analysis","author":"E Bishop","year":"1985","unstructured":"Bishop, E., Bridges, D.S.: Constructive Analysis. Springer, N.Y. (1985)"},{"key":"1_CR12","volume-title":"Constructive Functional Analysis","author":"DS Bridges","year":"1979","unstructured":"Bridges, D.S.: Constructive Functional Analysis. Pitman, London (1979)"},{"key":"1_CR13","volume-title":"Techniques of Constructive Analysis","author":"DS Bridges","year":"2006","unstructured":"Bridges, D.S., Vita, S.L.: Techniques of Constructive Analysis. Springer, New York (2006)"},{"key":"1_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511790423","volume-title":"Probability Theory: The Logic of Science","author":"ET Jaynes","year":"2003","unstructured":"Jaynes, E.T., Bretthorst, G.L.: Probability Theory: The Logic of Science. Cambridge University Press, Cambridge, UK (2003)"},{"key":"1_CR15","unstructured":"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)"},{"issue":"1","key":"1_CR16","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0168-0072(93)90213-W","volume":"64","author":"U Kohlenbach","year":"1993","unstructured":"Kohlenbach, U.: Effective moduli from ineffective uniqueness proofs. An unwinding of de La Vall\u00e9e Poussin\u2019s proof for Chebycheff approximation. Annals Pure Appl. Logic 64(1), 27\u201394 (1993)","journal-title":"Annals Pure Appl. Logic"},{"key":"1_CR17","volume-title":"Applied Proof Theory: proof Interpretations and their Use in Mathematics","author":"U Kohlenbach","year":"2008","unstructured":"Kohlenbach, U.: Applied Proof Theory: proof Interpretations and their Use in Mathematics. Springer, Berlin-Heidelberg (2008)"},{"key":"1_CR18","unstructured":"Kreinovich, V.: Uniqueness implies algorithmic computability. In: Proceedings of the 4th Student Mathematical Conference, pp. 19\u201321. Leningrad University, Leningrad (1975) (in Russian)"},{"key":"#cr-split#-1_CR19.1","unstructured":"Kreinovich, V.: Reviewer's remarks in a review of D.S. Bridges. In: Constrictive Functional Analysis, Pitman, London (1979)"},{"key":"#cr-split#-1_CR19.2","unstructured":"Zentralblatt f\u00fcr Mathematik, vol. 401, pp. 22-24 (1979)"},{"key":"1_CR20","unstructured":"Kreinovich, V.: Categories of space-time models, Ph.D. dissertation, Novosibirsk, Soviet Academy of Sciences, Siberian Branch, Institute of Mathematics (1979) (in Russian)"},{"key":"1_CR21","unstructured":"Kreinovich, V.: Philosophy of Optimism: notes on the Possibility of using algorithm theory when describing historical processes, Leningrad Center for New Information Technology \u201cInformatika\u201d. Technical Report, Leningrad (1989) (in Russian)"},{"key":"1_CR22","unstructured":"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\u00fcr Mathematik, Bonn, Germany (2007)"},{"key":"1_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2793-7","volume-title":"Computational Complexity and Feasibility of Data Processing and Interval Computations","author":"V Kreinovich","year":"1998","unstructured":"Kreinovich, V., Lakeyev, A., Rohn, J., Kahl, P.: Computational Complexity and Feasibility of Data Processing and Interval Computations. Kluwer, Dordrecht (1998)"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Kreinovich, V., Longpr\u00e9, L., Koshelev, M.: Kolmogorov complexity, statistical regularization of inverse problems, and Birkhoff\u2019s 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\u2013170, San Diego, CA (1998)","DOI":"10.1117\/12.323795"},{"issue":"2","key":"1_CR25","first-page":"99","volume":"12","author":"V Kreinovich","year":"2019","unstructured":"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\u2013134 (2019)","journal-title":"Int. J. Intell. Technol. Appl. Stat. (IJITAS)"},{"key":"1_CR26","unstructured":"Kushner, B.A.: Lectures on constructive mathematical analysis. American Mathematical Society Providence, Rhode Island (1984)"},{"issue":"13","key":"1_CR27","first-page":"1040","volume":"245","author":"D Lacombe","year":"1957","unstructured":"Lacombe, D.: Les ensembles r\u00e9cursivement ouvert ou ferm\u00e9s, et leurs applications \u00e0 l\u2019analyse r\u00e9curslve. Comptes Rendus de l\u2019Acad\u00e9mie des Sci. 245(13), 1040\u20131043 (1957)","journal-title":"Comptes Rendus de l\u2019Acad\u00e9mie des Sci."},{"key":"1_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-49820-1","volume-title":"An Introduction to Kolmogorov Complexity and Its Applications","author":"M Li","year":"2008","unstructured":"Li, M., Vit\u00e1nyi, P.: An Introduction to Kolmogorov Complexity and Its Applications. Springer, Berlin, Heidelberg, New York (2008)"},{"key":"1_CR29","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF01117468","volume":"1","author":"VA Lifschitz","year":"1973","unstructured":"Lifschitz, V.A.: Investigation of constructive functions by the method of fillings. J. Sov. Math. 1, 41\u201347 (1973)","journal-title":"J. Sov. Math."},{"issue":"5","key":"1_CR30","first-page":"223","volume":"2","author":"L Longpr\u00e9","year":"2008","unstructured":"Longpr\u00e9, L., Kreinovich, V., Gasarch, W., Walster, G.W.: $$m$$ solutions good, $$m-1$$ solutions better. Appl. Math. Sci. 2(5), 223\u2013239 (2008)","journal-title":"Appl. Math. Sci."},{"key":"1_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-21717-7","volume-title":"Computability in Analysis and Physics","author":"M Pour-El","year":"1989","unstructured":"Pour-El, M., Richards, J.: Computability in Analysis and Physics. Springer, New York (1989)"},{"key":"1_CR32","volume-title":"Baudelaire","author":"J-P Sartre","year":"1967","unstructured":"Sartre, J.-P.: Baudelaire. New Direction Publ, New York (1967)"},{"key":"1_CR33","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(86)90135-0","volume":"47","author":"LG Valiant","year":"1986","unstructured":"Valiant, L.G., Vazirani, V.V.: NP is as easy as detecting unique solutions. Theor. Comput. Sci. 47, 85\u201393 (1986)","journal-title":"Theor. Comput. Sci."}],"container-title":["Studies in Systems, Decision and Control","Decision Making Under Uncertainty and Constraints"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-16415-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T09:04:29Z","timestamp":1672736669000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-16415-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031164149","9783031164156"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-16415-6_1","relation":{},"ISSN":["2198-4182","2198-4190"],"issn-type":[{"type":"print","value":"2198-4182"},{"type":"electronic","value":"2198-4190"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"4 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}