A decision procedure using the geometry of convex sets

DOI10.1112/S0025579300008585zbMath0295.02018OpenAlexW2023640797MaRDI QIDQ4047533

Gabor T. Herman, P. W. Aitchison

Publication date: 1975

Published in: Mathematika (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/s0025579300008585

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Applications of computability and recursion theory (03D80) Turing machines and related notions (03D10) Algorithms in computer science (68W99)

Cites Work

• Unnamed Item
• A decision procedure using discrete geometry
• The uniform halting problem for generalized one-state turing machines
• Strong Computability and Variants of the Uniform Halting Problem

This page was built for publication: A decision procedure using the geometry of convex sets