Nowadays, computational processes tend to be more **parallelizable**, especially those that are **polynomially bounded**, enabling the budgeting of computer architectures and networks capable of meeting non-functional requirements. This allows for posing a vast array of **efficient problems** that, leveraging a robust computer network, can be resolved almost **instantaneously**. This very function is that of consciousness which, trapped in a kind of idealism, perceives itself as the sole possessor of general dominance. This article aims to provide an exceptionally clear understanding of these concepts and the applicability of various **transformations**. These transformations will not only allow us to map a **P-complete problem into CC (Comparator Circuit Class)**, given the demonstrated equivalence of CC and P, but will also be capable of **estimating** the number of solutions computed by a **nondeterministic Turing machine** in logarithmic time, provided the role of the verb 'to estimate' is accepted.