Shortest path amidst disc obstacles is computable

Keyphrases

• Transcendental number Theory 100%
• Exact Geometric Computation 50%
• Effective Lower Bound 50%
• Turing Computability 50%
• Obstacle-avoiding Path 50%
• Turing Model 50%
• Numerical Input 50%
• Computability 50%
• RAM Model 50%

Mathematics

• Transcendental Number Theory 100%
• Transcendentals 50%
• Model of Computation 50%
• Exact Geometric Computation 50%
• Turing Computability 50%