Online research in philosophy

Most people think computers will never be able to think. That is, really think. Not now or ever. To be sure, most people also agree that computers can do many things that a person would have to be thinking to do. Then how could a machine seem to think but not actually think? Well, setting aside the question of what thinking actually is, I think that most of us would answer that by saying that in these cases, what the computer is doing is merely a superficial imitation of human intelligence. It has been designed to obey certain simple commands, and then it has been provided with programs composed of those commands. Because of this, the computer has to obey those commands, but without any idea of what's happening.

In Section 2, I survey some of the ways that computers are used in mathematics. These raise questions that seem to have a generally epistemological character, although they do not fall squarely under a traditional philosophical purview. The goal of this article is to try to articulate some of these questions more clearly, and assess the philosophical methods that may be brought to bear. In Section 3, I note that most of the issues can be classified under two headings: some deal with the ability of computers to deliver appropriate “evidence” for mathematical assertions, a notion that is explored in Section 4, while others deal with the ability of computers to deliver appropriate mathematical “understanding,” a notion that is considered in Section 5. Final thoughts are provided in Section 6.

How are social relations appearing in computers? How are social relations realised in a different kind of medium, in the hardware and software of computers? How are the organising principles of computer building related to those of the life-worlds in a social system? Following a partly social constructivist and partly hermeneutic line a more general answer will be presented. The basic conclusion of this approach is simple: computers are constructed under the influence of the ideas of modernity and represent its structure, interests and values, in contrast to computer networks, which embody the ideas of postmodernity.

INTRODUCTION: INFORMATION TECHNOLOGY AND COMPUTERS AS THEMES IN THE PHILOSOPHY OF TECHNOLOGY Philosophical interest in computers and information technology ...

There has been much debate whether computers can be responsible. This question is usually discussed in terms of personhood and personal characteristics, which a computer may or may not possess. If a computer fulfils the conditions required for agency or personhood, then it can be responsible; otherwise not. This paper suggests a different approach. An analysis of the concept of responsibility shows that it is a social construct of ascription which is only viable in certain social contexts and which serves particular social aims. If this is the main aspect of responsibility then the question whether computers can be responsible no longer hinges on the difficult problem of agency but on the possibly simpler question whether responsibility ascriptions to computers can fulfil social goals. The suggested solution to the question whether computers can be subjects of responsibility is the introduction of a new concept, called “quasi-responsibility” which will emphasise the social aim of responsibility ascription and which can be applied to computers.

Digital computers play a special role in cognitive science—they may actually be instances of the phenomenon they are being used to model. This paper surveys some of the main issues involved in understanding the relationship between digital computers and cognition. It sketches the role of digital computers within orthodox computational cognitive science, in the light of a recently emerging alternative approach based around dynamical systems.

Presented here is a new result concerning the computational power of so-called SADn computers, a class of Turing-machine-based computers that can perform some non-Turing computable feats by utilising the geometry of a particular kind of general relativistic spacetime. It is shown that SADn can decide n-quantifier arithmetic but not (n+1)-quantifier arithmetic, a result that reveals how neatly the SADn family maps into the Kleene arithmetical hierarchy. Introduction Axiomatising computers The power of SAD computers Remarks regarding the concept of computability.