Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 2 of 2 for “"Turing Decidability"”.
-
Turing Decidability and Computational Complexity of MorseHomology
… data is computable in the classical sense of Turing decidability, bound the complexity of finding the Morse homology of a given simplicial complex, and provide a measure for when this is more efficient than simplicial homology.
-
Fast numerical algorithms for optimal robot motion planning
Optimization of high-level autonomous tasks requires solving the optimal motion planning problem for a mobile robot. For example, to reach the desired destination on time, a self-driving car must quickly navigate streets and avoid hazardous obstacles such as buildings or other cars, as well as …