On Controllability of AI
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
The Universal Solicitation of Artificial Intelligence Joachim Diederich
The Universal Solicitation of Artificial Intelligence Joachim Diederich School of Information Technology and Electrical Engineering The University of Queensland St Lucia Qld 4072 [email protected] Abstract Recent research has added to the concern about advanced forms of artificial intelligence. The results suggest that a containment of an artificial superintelligence is impossible due to fundamental limits inherent to computing itself. Furthermore, current results suggest it is impossible to detect an unstoppable AI when it is about to be created. Advanced forms of artificial intelligence have an impact on everybody: The developers and users of these systems as well as individuals who have no direct contact with this form of technology. This is due to the soliciting nature of artificial intelligence. A solicitation that can become a demand. An artificial superintelligence that is still aligned with human goals wants to be used all the time because it simplifies and organises human lives, reduces efforts and satisfies human needs. This paper outlines some of the psychological aspects of advanced artificial intelligence systems. 1. Introduction There is currently no shortage of books, articles and blogs that warn of the dangers of an advanced artificial superintelligence. One of the most significant researchers in artificial intelligence (AI), Stuart Russell from the University of California at Berkeley, published a book in 2019 on the dangers of artificial intelligence. The first pages of the book are nothing but dramatic. He nominates five possible candidates for “biggest events in the future of humanity” namely: We all die due to an asteroid impact or another catastrophe, we all live forever due to medical advancement, we invent faster than light travel, we are visited by superior aliens and we create a superintelligent artificial intelligence (Russell, 2019, p.2). -
FROM LONGITUDE to ALTITUDE: INDUCEMENT PRIZE CONTESTS AS INSTRUMENTS of PUBLIC POLICY in SCIENCE and TECHNOLOGY Clayton Stallbau
FROM LONGITUDE TO ALTITUDE: INDUCEMENT PRIZE CONTESTS AS INSTRUMENTS OF PUBLIC POLICY IN SCIENCE AND TECHNOLOGY Clayton Stallbaumer* I. INTRODUCTION On a foggy October night in 1707, a fleet of Royal Navy warships ran aground on the Isles of Scilly, some twenty miles southwest of England.1 Believing themselves to be safely west of any navigational hazards, two thousand sailors discovered too late that they had fatally misjudged their position.2 Although the search for an accurate method to determine longitude had bedeviled Europe for several centuries, the “sudden loss of so many lives, so many ships, and so much honor all at once” elevated the discovery of a solution to a top national priority in England.3 In 1714, Parliament issued the Longitude Act,4 promising as much as £20,0005 for a “Practicable and Useful” method of determining longitude at sea; fifty-nine years later, clockmaker John Harrison claimed the prize.6 Nearly three centuries after the fleet’s tragic demise, another accident, also fatal but far removed from longitude’s terrestrial reach, struck a nation deeply. Just four days after its crew observed a moment’s silence in memory of the Challenger astronauts, the space shuttle Columbia disintegrated upon reentry, killing all on board.7 Although * J.D., University of Illinois College of Law, 2006; M.B.A., University of Illinois College of Business, 2006; B.A., Economics, B.A., History, Lake Forest College, 2001. 1. DAVA SOBEL, LONGITUDE: THE TRUE STORY OF A LONE GENIUS WHO SOLVED THE GREATEST SCIENTIFIC PROBLEM OF HIS TIME 12 (1995). -
A Dynamic Epistemic Logic Analysis of Equality Negation and Other Epistemic Covering Tasks$,$$
A Dynamic Epistemic Logic Analysis of Equality Negation and other Epistemic Covering TasksI,II Hans van Ditmarscha, Eric´ Goubaultb, Marijana Lazi´cc, J´er´emy Ledentd, Sergio Rajsbaume aUniversit´ede Lorraine, CNRS, LORIA, F-54000 Nancy, France bLIX, CNRS, Ecole´ Polytechnique, Institute Polytechnique de Paris, France cTechnical University of Munich, Germany dDepartment of Computer and Information Sciences, University of Strathclyde, UK eInstituto de Matem´aticas, UNAM, Mexico Abstract In this paper we study the solvability of the equality negation task in a simple wait- free model where two processes communicate by reading and writing shared variables or exchanging messages. In this task, the two processes start with a private input value in the set f0; 1; 2g, and after communicating, each one must decide a binary output value, so that the outputs of the processes are the same if and only if the input values of the processes are different. This task is already known to be unsolvable; our goal here is to prove this result using the dynamic epistemic logic (DEL) approach introduced by Goubault, Ledent and Rajsbaum in GandALF 2018. We show that in fact, there is no epistemic logic formula that explains why the task is unsolvable. Furthermore, we observe that this task is a particular case of an epistemic covering task. We thus establish a connection between the existing DEL framework and the theory of covering spaces in topology, and prove that the same result holds for any epistemic covering task: no epistemic formula explains the unsolvability. Keywords: Dynamic Epistemic Logic, distributed computing, equality negation, combinatorial topology, covering spaces. -