SLOG Post 6 - Halt

Halt.

Now here is a topic that required a bit of thinking. This class we talked about halt and computability. After the necessary thinking we just come up with the conclusion that halt cannot exist as its proof show it is just a mere contradiction.

When a program halts it doesn't and we it doesn't it does.

Just thinking about it makes me question the origin of the universe. But back to the topic, thing is that we can use the uncomputability of halt to proof that other functions are not computable using reduction. If function F reduces to G, then F being not computable implies that G is not computable. It is just a thing of reducing the function you want to proof and implementing it into halt.