On the computability of the set of automorphisms of the unit square

DOI10.1016/j.tcs.2021.12.019OpenAlexW4200480481MaRDI QIDQ2072068

Eike Neumann

Publication date: 1 February 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.12.019

zbMATH Keywords

automorphismscomputational geometryFréchet distancecomputable analysisreal computation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items

COMPUTABLY COMPACT METRIC SPACES

Uses Software

• iRRAM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Book review of: M. Rao et al., Complex analysis. An invitation. 2nd ed.
• Can we compute the similarity between surfaces?
• The wave equation with computable initial data such that its unique solution is not computable
• Computability on subsets of metric spaces.
• Extended admissibility.
• On the Computational Content of the Brouwer Fixed Point Theorem
• On Computing the Fréchet Distance Between Surfaces.
• IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE?
• Is the Mandelbrot set computable?
• The Brouwer Fixed Point Theorem Revisited
• Introduction to Interval Analysis
• The Computational Geometry of Comparing Shapes
• A computable ordinary differential equation which possesses no computable solution
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• Computability and Representations of the Zero Set
• Handbook of Computability and Complexity in Analysis
• Computable analysis with applications to dynamic systems
• Connected choice and the Brouwer fixed point theorem
• On the topological aspects of the theory of represented spaces
• On Computable Numbers, with an Application to the Entscheidungsproblem