Elementary topology and universal computation

Petrus H. Potgieter · Suid-Afrikaanse Tydskrif vir Natuurwetenskap en Tegnologie · 2008

This paper attempts to define a general framework for computability on an arbitrary topological space X . The elements of X are taken as primitives in this approach—also for the coding of functions — and, except when X = N, the natural numbers are not used directly.

Read the paper · More papers on PaperTik