{"id":{"repo_id":"mcmaster","oai_identifier":"oai:macsphere.mcmaster.ca:11375/18334"},"canonical_url":"https://search.ndltd.org/etd/mcmaster/oai:macsphere.mcmaster.ca:11375/18334","repository":{"repo_id":"mcmaster","name":"McMaster University","base_url":"https://macsphere.mcmaster.ca/server/oai/request"},"display":{"title":"Notions of Semicomputability in Topological Algebras over the Reals","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.","abstract_html":"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&#x27;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&quot;, 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.","abstract_has_math":false,"creators":["Armstrong, Mark"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Computing and Software","school":null,"contributors":[],"advisors":["Zucker, Jeffery"],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-11","date_published":"2015-11","updated_at":"2026-11-19T05:55:01Z","subjects":["Generalised computability theory","Computability theory","Computability on the reals"],"languages":["en"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://doi.org/10.71548/15440"],"render_values":[{"text":"https://doi.org/10.71548/15440","href":"https://doi.org/10.71548/15440","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/11375/18334","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"http://hdl.handle.net/11375/18334","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://macsphere.mcmaster.ca/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Amacsphere.mcmaster.ca%3A11375%2F18334","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Zucker, Jeffery"]},{"key":"dc:contributor.department","label":"Department","values":["Computing and Software"]},{"key":"dc:creator","label":"Author","values":["Armstrong, Mark"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2015-10-02T15:43:25Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2015-10-02T15:43:25Z"]},{"key":"dc:date.issued","label":"Date","values":["2015-11"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Generalised computability theory","Computability theory","Computability on the reals"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/11375/18334","https://doi.org/10.71548/15440"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:description.abstractgeneral","label":"General Abstract","values":["We investigate to what extent certain well-known results of classical computability theory on the natural numbers hold in the context of generalised computability theories on the real numbers."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Master of Computer Science (MCS)"]},{"key":"dc:title","label":"Title","values":["Notions of Semicomputability in Topological Algebras over the Reals"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"dc:contributor.advisor":["Zucker, Jeffery"],"dc:contributor.department":["Computing and Software"],"dc:creator":["Armstrong, Mark"],"dc:date.accessioned":["2015-10-02T15:43:25Z"],"dc:date.available":["2015-10-02T15:43:25Z"],"dc:date.issued":["2015-11"],"dc:description.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."],"dc:description.abstractgeneral":["We investigate to what extent certain well-known results of classical computability theory on the natural numbers hold in the context of generalised computability theories on the real numbers."],"dc:description.degree":["Master of Computer Science (MCS)"],"dc:identifier.uri":["http://hdl.handle.net/11375/18334","https://doi.org/10.71548/15440"],"dc:language.iso":["en"],"dc:subject":["Generalised computability theory","Computability theory","Computability on the reals"],"dc:title":["Notions of Semicomputability in Topological Algebras over the Reals"],"dc:type":["Thesis"],"others:access_status":["open.access"]},"updated_at":"2026-11-19T05:55:01Z"}