Notions of semicomputability in topological algebras over the reals Journal Articles uri icon

  •  
  • Overview
  •  
  • Research
  •  
  • Identity
  •  
  • Additional Document Info
  •  
  • View All
  •  

abstract

  • Several results from classical computability theory (computability over discrete structures such as the natural numbers and strings over finite alphabets, due to Turing, Church, Kleene and others) have been shown to hold for a generalisation of computability theory over total abstract algebras, using for instance the model of \While\ computation. We present a number of results relating to computation on topological partial algebras, again using \While\ computation. We consider several results from the classical theory in the context of topological algebra of the reals: closure of semicomputable sets under finite union (Chapter \ref{chap:results1} Theorem \ref{thm:union_While_scomp_not_While_scomp}, p.\pageref{thm:union_While_scomp_not_While_scomp}), the equivalence of semicomputable and projectively (semi)computable sets (Chapter \ref{chap:results2} Theorem \ref{thm:proj_while_equivalents}, p.\pageref{thm:proj_while_equivalents}), and Post's Theorem (i.e.~a set is computable iff both it and its complement are semicomputable) (Appendix \ref{appendix:posts_theorem} Theorem \ref{thm:posts_general}, p.\pageref{thm:posts_general}). This research has significance in the field of scientific computation, which is underpinned by computability on the real numbers. We will consider a ``continuity principle", which states that computability should imply continuity; however, equality, order, and other total boolean-valued functions on the reals are clearly discontinuous. As we want these functions to be basic for the algebras under consideration, we resolve this incompatibility by redefining such functions to be partial, leading us to consider topological partial algebras.

publication date

  • December 19, 2018