Carson Reynolds

Abstract

From the standpoint of computational complexity different ethical positions are analyzed, with the eventual idea of implementing them as actual systems. For each of the action evaluation strategies suggested by hedonism, consquentialsm, and deontologism a satisfaction condition is defined. The time complexity involved in meeting these satisfaction conditions is then analyzed. Hedonism is found to be less computationally complex than consequentialism and deontologism (which are of equivilent complexity classes). In support of these analyses, a literature review discussing questions of computability, ethical computability, and computational complexity is provided. In addition, it is argued that computers need not be ethical in the same manner that humans are ethical. Keywords Computer Ethics, Evaluative Complexity, Satisfaction Condition, Computational Complexity, Ethical Computability.