A decision procedure using the geometry of convex sets

DOI10.1112/S0025579300008585zbMATH Open0295.02018OpenAlexW2023640797MaRDI QIDQ4047533FDOQ4047533

Authors: P. W. Aitchison, Gabor T. Herman 

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

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

Cites Work

• Title not available (Why is that?)
• Strong Computability and Variants of the Uniform Halting Problem
• A decision procedure using discrete geometry
• The uniform halting problem for generalized one-state turing machines

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4047533)