Algorithms and Geometric Constructions

DOI10.1007/978-3-319-94418-0_41MaRDI QIDQ6302378arXivDBLPWikidataFDO

Authors V. A. Uspenskiĭ, A. Shen

Publication date 31 May 2018

Published in arXiv

Full work available at URL https://doi.org/10.1007/978-3-319-94418-0_41

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Geometric constructions in real or complex geometry (51M15) Applications of game theory (91A80)

arXiv classification

math.HO

Abstract: It is well known that several classical geometry problems (e.g., angle trisection) are unsolvable by compass and straightedge constructions. But what kind of object is proven to be non-existing by usual arguments? These arguments refer to an intuitive idea of a geometric construction as a special kind of an `algorithm' using restricted means (straightedge and/or compass). However, the formalization is not obvious, and different descriptions existing in the literature are far from being complete and clear. We discuss the history of this notion and a possible definition in terms of a simple game

This page was built for publication: Algorithms and Geometric Constructions

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