The Concept of Computer Consciousness

The extent to which something can learn, the complexity of the problems that can be solved, and the nature of the creativity are all dependent on something's level of intelligence. However, the ability to exude all of these characteristics is the key to being considered conscious. .
             The Turing Test is illustrated as an experiment in which a human has text conversations with another human and a computer programmed to imitate human communication, without knowing which is the computer and which is the other human. The first human is given the task of distinguishing between which of the conversations was with a human, and which was with a computer. The theory by which the Turing Test operates is that if a computer can convince a human that it is a human through conversation, then such computers should be considered "thinking." The logic behind this theory is that if a person is considered conscious because they can hold a conversation, which require someone to think to be able to respond appropriately, then why should a computer not be considered conscious if it too can hold a logical conversation of the same "thoughtfulness" as human conversations. .
             One of the common objections to the Turing Test is that regardless of the ability to simulate human speech, computers will never be able to do certain conscious-requiring activities (e.g. feel empathy, appreciate the beauty of a sunset, have a sense of humor, etc.). The immediate response to the argument is to negate its merit, saying that the people who argue this lack imagination. However, this is actually a legitimate argument, at least to a certain extent. Using the same logic by which advocators for computer consciousness argue that a machine could someday be self-aware and considered conscious, someone could argue that just because a machine is programmed to react in an appreciative manner to a sunset, it is only because it was told to do so, not out of the machine's own true appreciation for the scene.