Computational Individuation

Download Edit this record How to cite View on PhilPapers
I show that the indeterminacy problem for computational structuralists is in fact far more problematic than even the harshest critic of structuralism has realised; it is not a bullet which can be bitten by structuralists as previously thought. Roughly, this is because the structural indeterminacy of logic-gates such as AND/OR is caused by the structural identity of the binary computational digits 0/1 themselves. I provide a proof that pure computational structuralism is untenable because structural indeterminacy entails absurd consequences - namely, that there is only one binary computational digit. I conclude that accounting for individuation is a more important desiderata for a theory of computation than even that of triviality.
No keywords specified (fix it)
(categorize this paper)
PhilPapers/Archive ID
Upload history
First archival date: 2021-03-31
Latest version: 3 (2021-05-20)
View other versions
Added to PP index

Total views
65 ( #51,676 of 2,448,753 )

Recent downloads (6 months)
25 ( #26,401 of 2,448,753 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.