It takes the average reader 3 hours and 24 minutes to read Games Iteration Numbers: A Philosophical Introduction to Computability Theory by Luca M. Possati
Assuming a reading speed of 250 words per minute. Learn more
Is it possible to conceive two perfectly identical objects? Is identity even possible without individuality? How would a perfectly symmetrical universe be? The current philosophical debate on identity, and in particular on the necessity of the Leibniz's principle of the identity of indiscernibles, is complex and multi-faceted. Recent works have indicated that the problem becomes increasingly complex if we apply it to mathematical objects. Is it possible to speak of 'identity' for numbers? How can we identify numbers? Drawing on philosophical accounts on identity and individuality in contemporary metaphysics (analytic and continental), this book explores a new path. The author argues that an identity without individuality is possible. By means of a critique of the idea of the identity of indiscernibles, the book formulates the concept of 'manifold identity', through the concept of 'iteration'. Iteration is a specific transgression of the identity of indiscernibles arising from the collision of two forms of identity: qualitative identity and numerical identity. Nonetheless, a pair of perfectly identical objects is still a paradox, a contradiction. The first thesis of the book is that iteration is a paraconsistent and dialethetical logical structure, which allows for true contradiction. The author applies recent works in non-standard logic and dialetheism (Priest, Routley, Berto) to illustrate how we can make sense of the idea that objects can be perfectly identical but discernible. The second thesis of the book is that iteration is the basis of enumerability and computability. A 'computable object' is an object constructed on the basis of an iterative logic. It is possible to re- interpret all the primary concepts of computability theory through the logic of iteration.
Games Iteration Numbers: A Philosophical Introduction to Computability Theory by Luca M. Possati is 198 pages long, and a total of 51,084 words.
This makes it 67% the length of the average book. It also has 62% more words than the average book.
The average oral reading speed is 183 words per minute. This means it takes 4 hours and 39 minutes to read Games Iteration Numbers: A Philosophical Introduction to Computability Theory aloud.
Games Iteration Numbers: A Philosophical Introduction to Computability Theory is suitable for students ages 12 and up.
Note that there may be other factors that effect this rating besides length that are not factored in on this page. This may include things like complex language or sensitive topics not suitable for students of certain ages.
When deciding what to show young students always use your best judgement and consult a professional.
Games Iteration Numbers: A Philosophical Introduction to Computability Theory by Luca M. Possati is sold by several retailers and bookshops. However, Read Time works with Amazon to provide an easier way to purchase books.
To buy Games Iteration Numbers: A Philosophical Introduction to Computability Theory by Luca M. Possati on Amazon click the button below.
Buy Games Iteration Numbers: A Philosophical Introduction to Computability Theory on Amazon