Turing Algorithms in Art

Symposion: Theoretical and Applied Inquiries in Philosophy and Social Sciences 10 (1):31-80 (2023)
  Copy   BIBTEX

Abstract

Exemplifying with sculptures the author created, the article shows that ontological algorithms can yield aesthetic content, while epistemological algorithms can capture it. Bridging the gap between art and logic creates new and exciting aesthetic opportunities, allaying Henry Moore’s fears of ‘paralysis by analysis.’ On the flip side, appreciating all that algorithmic art has to offer poses intellectual challenges that run counter to subjectivist approaches to art and its education.

Categories

Add categories

Keywords

Reprint years

DOI

10.5840/symposion20231012

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Measuring power of algorithms, computer programs and information automata.Mark Semenovich Burgin (ed.) - 2010 - New York: Nova Science Publishers.
Algorithms from THE BOOK.Kenneth Lange - 2020 - Philadelphia, PA: The Society for Industrial and Applied Mathematics.
The constitution of algorithms: ground-truthing, programming, formulating.Florian Jaton - 2020 - Cambridge, Massachusetts: The MIT Press. Edited by Geoffrey C. Bowker.
Algorithms for big data.Moran Feldman - 2020 - New Jersey: World Scientific.
The age of algorithms.S. Abiteboul - 2018 - New York, NY: Cambridge University Press. Edited by Gilles Dowek.
Infinite time Turing machines.Joel David Hamkins - 2002 - Minds and Machines 12 (4):567-604.
Quantum algorithms: Philosophical lessons.Amit Hagar - 2007 - Minds and Machines 17 (2):233-247.
Infinite time Turing machines.Joel David Hamkins & Andy Lewis - 2000 - Journal of Symbolic Logic 65 (2):567-604.
Track 2-Languages and Algorithms-Session 4-Algorithms-Parallelization Algorithms for Three-Body Interactions in Molecular Dynamics Simulation. [REVIEW]Jianhui Zhou Li & Richard J. Sadus - 2006 - In O. Stock & M. Schaerf (eds.), Lecture Notes in Computer Science. Springer Verlag. pp. 374-382.
Algorithms: design and analysis.Harsh Bhasin - 2015 - New Delhi, India: Oxford University Press.
Journal of music algorithms.Mark J. Carlotto (ed.) - 2013 - Gloucester, MA: Mark J. Carlotto.
Classes of Markov-like k-ALGORITHMS.Zdzislaw Grodzki & Jerzy Mycka - 1996 - Reports on Mathematical Logic:83-99.
Algorithms: a top-down approach.Rodney R. Howell - 2023 - New Jersey: World Scientific.
Basic concepts in algorithms.Shmuel T. Klein - 2021 - Hoboken: World Scientific.
S. Barry Cooper and Andrew Hodges , The Once and Future Turing: Computing the World. Cambridge University Press, 2016. xviii + 379 pp.— therein: - Martin Davis. Algorithms, Equations, and Logic. pp. 4–19. - J.M.E. Hyland. The Forgotten Turing. pp. 20–33. - Andrew R. Booker. Turing and the Primes. pp. 34–52. - Ueli Maurer. Cryptography and Computation after Turing. pp. 53–77. - Kanti V. Mardia and S. Barry Cooper. Alan Turing and Enigmatic Statistics. pp. 78–89. - Stephen Wolfram. What Alan Turing Might Have Discovered. pp. 92–105. - Christof Teuscher. Designed versus Intrinsic Computation. pp. 106–116. - Solomon Feferman. Turing’s ‘Oracle’: From Absolute to Relative Computability and Back. pp. 300–334. - P.D. Welch. Turing Transcendent: Beyond the Event Horizon. pp. 335–360. - Roger Penrose. On Attempting to Model the Mathematical Mind. pp. 361–378. [REVIEW]Alasdair Urquhart - 2016 - Bulletin of Symbolic Logic 22 (3):354-356.

Analytics

Added to PP
2023-06-01

Downloads
5 (#1,510,250)

6 months
3 (#992,474)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references