We give an introduction to the problem of computable algebras. Specifically, the algebras of loops and groups. We start by defining a loop and group, then give some of their properties. We then give an overview of comptability theory, and apply it to loops and groups. We conclude by showing that a finitely presented residually finite algebra has a solvable word problem.
","abstract_html":"<p>We give an introduction to the problem of computable algebras. Specifically, the algebras of loops and groups. We start by defining a loop and group, then give some of their properties. We then give an overview of comptability theory, and apply it to loops and groups. We conclude by showing that a finitely presented residually finite algebra has a solvable word problem.</p>","abstract_has_math":false,"creators":["Schmidt, Josiah"],"institution":null,"degree_name":"Master of Science","degree_level":"Thesis","degree_discipline":"Math and Computer Science","degree_department":null,"school":null,"contributors":["Joshua Thompson"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2021,"date_issued":"2021-07-01T07:00:00Z","date_published":"2021-07-01T07:00:00Z","updated_at":"2026-07-24T03:24:17Z","subjects":["Loop Theory","Computability Theory","Group Theory","Algebra","Other Mathematics"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://commons.nmu.edu/theses/682","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Joshua Thompson"]},{"key":"dc:creator","label":"Author","values":["Schmidt, Josiah"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2021-07-09T07:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Math and Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Loop Theory","Computability Theory","Group Theory","Algebra","Other Mathematics"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://commons.nmu.edu/theses/682"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["We give an introduction to the problem of computable algebras. Specifically, the algebras of loops and groups. We start by defining a loop and group, then give some of their properties. We then give an overview of comptability theory, and apply it to loops and groups. We conclude by showing that a finitely presented residually finite algebra has a solvable word problem.
"]},{"key":"dc:title","label":"Title","values":["Computable Model Theory on Loops"]}]}],"canonical_facts":{"dc:contributor":["Joshua Thompson"],"dc:creator":["Schmidt, Josiah"],"dc:date.available":["2021-07-09T07:00:00Z"],"dc:description.abstract":["We give an introduction to the problem of computable algebras. Specifically, the algebras of loops and groups. We start by defining a loop and group, then give some of their properties. We then give an overview of comptability theory, and apply it to loops and groups. We conclude by showing that a finitely presented residually finite algebra has a solvable word problem.
"],"dc:identifier":["https://commons.nmu.edu/theses/682"],"dc:subject":["Loop Theory","Computability Theory","Group Theory","Algebra","Other Mathematics"],"dc:title":["Computable Model Theory on Loops"],"thesis:degree_discipline":["Math and Computer Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Science"]},"updated_at":"2026-07-24T03:24:17Z"}