Computability, Notation, and <i>de re</i> Knowledge of Numbers
Saul Kripke once noted that there is a tight connection between computation and de re knowledge of whatever the computation acts upon. For example, the Euclidean algorithm can produce knowledge of <i>which number</i> is the greatest common divisor of two numbers. Arguably, algorithms ope...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2022-02-01
|
| Series: | Philosophies |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2409-9287/7/1/20 |