at first, please excuse my bad knowledge in english. I\'ve got the following Problem: I must find the shortest way between more then 2 Points in a fix order (e.g. A -> D -> F).
After reading the page \"Laws of Computer Science and Programming\" and not finding this law, can anyone tell me what this law is?
This is one of the tasks of my assignment. I have a Turing machine simu开发者_StackOverflow中文版lation which can simulate a busy beaver function. I have done some research about proving this problem,
加载中,请稍侯......