Previously, it has been suggested that the Gödel-type non-algorithmic process may be associated with consciousness. This paper discusses the halting problem and the non-computability of self-referential consciousness. Specifically, this discussion outlines the distinguishability between the halting and looping of computation, or the semantic understanding between true and false, that may be associated with the noncomputability of consciousness. The nonlocality intrinsically possessed in quantum theory is one of the striking features of nature that has received a lot of attention. In particular, Bell-type inequalities have been not only extremely powerful but practical tools in quantum information technology. A numerical approach is used to describe different cases of Bell-CHSH inequalities, particularly with different numbers of the choices of measurement bases. It is shown that there are variations of inequalities that are relatively stable against measurement errors.

Algorithms, Consciousness, Nonlocality, Numerical Methods