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 _which number_ is the greatest common divisor of two numbers. Arguably, algorithms operate directly on syntactic items, such as strings, and on numbers and the like only via how the numbers are represented. So we broach matters of _notation_. The purpose of this article is to explore the relationship between (...) the notations acceptable for computation, the usual idealizations involved in theories of computability, flowing from Alan Turing’s monumental work, and de re propositional attitudes toward numbers and other mathematical objects. (shrink)

I examine the classical idea of ‘algorithm’ as a sequential, step-by-step, deterministic procedure (i.e., the idea of ‘algorithm’ that was already in use by the 1930s), with respect to three themes, its relation to the notion of an ‘effective procedure’, its different roles and uses in logic, computer science, and mathematics (focused on numerical analysis), and its different formal definitions proposed by practitioners in these areas. I argue that ‘algorithm’ has been conceptualized and used in contrasting ways in the above (...) areas, and discuss challenges and prospects for adopting a final foundational theory of (classical) ‘algorithms’. (shrink)