Could a Computer Feel Pain? :: Technology Feelings Papers

Could a Computer Feel Pain?I define disquiet as a continuously and manipulationly optimizing input to a feedback system. I proceed by clarifying and restricting the defining terms to the given context. I then prove the robustness of this explanation by demonstrating its compatibility with a biologically-acceptable intuitive and philosophical viewpoint. I conclude that if a computational device were to be knowing to meet the definition of the requirements for pain, the computer could be said, then, to feel pain. I further note this definition of pain does not completely integrate with higher-order life forms which argon capable of beliefs and intentions which I label representations. I then conclude with a rough sketch of what the requirements would be to define a representational system for the purpose of understanding how a computer could have a mind akin to our own. FunctionA function maps a baffle of inputs to a single take. To face this, consider the definitions of functio n which follow. 5. Math. a. A variable so related to one another that for each value assumed by one there is a value determined for the other. b. A rule of correspondence between two sets such that there is a unique element in one set assigned to each element in the other. (Morris 1982539) From the above, it becomes apparent that a function simply maps one set of points to another such as in the comparability of line where we consider x to be the input and y to be the output y is a function of x = f(x) = y = m*x + b. Note that we can remap the output to the input if we take x as a function of y = f(y) = x = ( y - b ) / m. If we examine definition b of function, we note that, for each value in the input set x, there is one and only one corresponding value of the output y. Thus, the equation of a circle would not qualify as a function since for many set of x there are two values for y such as a point on the top of the circle and a point directly below on the bottom of the circle. A deterministic, or non-random, function will give the same output y every time a given input x is presented. That is, the input x completely determines the output y.