A Simple Explanation of the Halting Problem
The halting problem is a problem in computer science that can be stated as follows: Given a description of an arbitrary computer program, decide whether the program finishes running or continues to run forever. (Wikipedia) Alan Turing proved that there is no program that can solve the halting problem for all possible inputs. Below is […]
Read more from the Logic category. If you would like to leave a comment, click here: Comment. or stay up to date with this post via RSS from your site.
The Principle of Non-Arbitrary Distinction
Absolute principles do not contain arbitrary lines. Here, the word “absolute” means that the principle is based on objective reasoning rather than the personal prejudices of its creator. So we can see why this statement is true because if there was a line being drawn in the argument for an absolute principle, there would have […]
Read more from the Logic category. If you would like to leave a comment, click here: 3 Comments. or stay up to date with this post via RSS from your site.