A critical comparison between the traditional algorithmic approach and the semantic-like one is made. The comparison include topics such as causality, correlations, halting problem, shortest algorithm, intuition, Zipf`s law, and absolute information. The purpose of making this comparison is to delineate neatly the fundamental difference between both approaches and to make clear that, although they are different, they still are counterparts which coexist peacefully. One of the major differences between them turns out to be that whilst the semantic-like approach permits autonomous discrimination between “true” and “false” statement by an intelligent complex system, the traditional algorithmic theory does not allow any autonomous discrimination between a “true” and a “false” statement. On the other hand, their common property turns out to be that it is impossible to acquire absolute knowledge: for example, even the famous “super-minded” Maxwell demon can be deceived.