{"title":"Elementary topology and universal computation","authors":"P. Potgieter","doi":"10.4102/SATNT.V27I4.97","DOIUrl":null,"url":null,"abstract":"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 N, the natural numbers are not used directly.","PeriodicalId":30428,"journal":{"name":"South African Journal of Science and Technology","volume":"27 1","pages":"287-293"},"PeriodicalIF":0.0000,"publicationDate":"2008-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"South African Journal of Science and Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4102/SATNT.V27I4.97","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
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.