Of Sigbovik, Emcee M. C, Tux Rat et al. · 2008
The Association for Computational Heresy Special Interest Group (ACH SIGBOVIK) on Harry Q. Bovik is particularly excited to be presenting this, the Second Annual Intercalary Workshop about Symposium on Robot Dance Party of Conference in Celebration of Harry Q. Bovik’s (2 6) th Birthday. The previous “Binarennial Scheduling ” of the SIGBOVIK conferences has been seen as a game-changing development in the storied history of conference presentation ever since George P. Burdell’s historic keynote talk at the first SIGBOVIK in 1944 on the occasion of Harry’s (2 0) st birthday. However, the response to what was is generally accepted as the seventh SIGBOVIK Conference 1 in 2007 was so overwhelming that the ACH SIGBOVIK Governing Board was forced to recognize that it would be simply negligent to allow the crucial work that finds unique expression at SIGBOVIK to lie dormant until 2071. Therefore, the Intercalary Workshops were announced, and this, this Second Intercalary Workshop in Celebration of Harry’s (2 6) th Birthday, is the first of such intercalary workshops that will help to advance the progress of science until 2039, when the Thirty-Second Intercalary Workshop in Celebration of Harry’s (2 6) th Birthday will be held concurrently with the First Intercalary Workshop in Expectation of Harry’s (2 7) th Birthday. We hope that you will find yourself edified and enlightened by this, the proceedings of SIGBOVIK 2008. We, the pseudonymous SIGBOVIK 2008 Organizing Committee, are proud to present it, and we thank QVT Financial LP, who boldly went where no corporation has gone before: to sponsorship of SIGBOVIK. Sincerely,
Cited by 0
Javier Insa-cabrera, David L. Dowe · 2015
Comparative tests work by finding the difference (or the absence of difference) between a reference subject and an evaluee. The Turing Test, in its standard interpretation, takes (a subset of) the human species as a reference. Motivated by recent findings and developments in the area of machine intelligence evaluation, we discuss what it would be like to have a Turing Test where the reference and the interrogator subjects are replaced by Turing Machines. This question sets the focus on several issues that are usually disregarded when dealing with the Turing Test, such as the degree of intelligence of reference and interrogator, the role of imitation (and not only prediction) in intelligence, its view from the perspective of game theory and others. Around these issues, this paper finally brings the Turing Test to the realm of Turing machines.
Cited by 0
Of Sigbovik, The Second Annual Intercalary, Emcee M. C et al. · 2008
Q. Bovik s 2 6 th Birthday. The previous Binarennial Scheduling of the SIGBOVIK confer ences has been seen as a game changing development in the storied history of conference presentation ever since George P. Burdell s historic keynote talk at the rst SIGBOVIK in 1944 on the occasion of Harry s 2 0 st birthday. However, the response to what was is generally accepted as the seventh SIGBOVIK Con ference 1 in 2007 was so overwhelming that the ACH SIGBOVIK Governing Board was forced to recognize that it would be simply negligent to allow the crucial work that nds unique expression at SIGBOVIK to lie dormant until 2071. Therefore, the Intercalary Workshops were announced, and this, this Second Intercalary Workshop in Celebration of Harry s 2 6 th Birthday, is the rst of such intercalary workshops that will help to advance the progress of science until 2039, when the Thirty Second Intercalary Workshop in Celebra tion of Harry s 2 6 th Birthday will be held concurrently with the First Intercalary Workshop in Expectation of Harry s 2 7 th Birthday. We hope that you will nd yourself edi ed and enlightened by this, the proceedings of SIGBOVIK 2008. We, the pseudonymous SIGBOVIK 2008 Organizing Committee, are proud to present it, and we thank QVT Financial LP, who boldly went where no corporation has gone before: to sponsorship of SIGBOVIK. Sincerely,
Cited by 0
Vladimir Dotsenko · Irish Mathematical Society Bulletin · 2012
When one tries to describe the impact of the legacy of a single mathematician, that of Alan Turing is hard to overestimate.Even if one ignores his work in cryptanalysis during the World War II that resulted in breaking the Enigma code, it is obvious that his contributions shaped both a whole new area of fundamental research, now known as theoretical computer science, and the applicable "practical computer science", the art of using computer programs to effectively solve problems that can be in principle solved by mathematical methods.In his foundational papers, Turing came up with a rigorous notion of computability, proved that some computational problems cannot be successfully solved in finite time, and also proved that those problems that can be solved, can actually be solved altogether by a "universal computer program".This elaborate study of computability and its limits has had the most profound impact on both blue-sky research and applications of science in the past decades.With the year 2012 marking the centenary of the birth of Alan Turing, there is no surprise that there has been an increase in interest in his persona, and in the clear intent scientific publishers have demonstrated to satisfy that interest.The book under review is a very unusual instance of a biography.It consists of three parts.The main part was written by Turing's mother Sara a few years after his death.It is based both on her very elaborate personal recollections and on letters she received from various people whom she had asked to comment on their encounters with Turing.Martin Davis, one of Turing's biographers, has written a very detailed and helpful foreword which covers some intentional gaps in Sara Turing's narrative and which adds a contemporary perspective which she would not 1991
Cited by 0Open access
MARSONET, MICHELE · CINECA IRIS Institutial Research Information System (University of Genoa) · 1996
Cited by 0
Sievers, Oliver · Zenodo (CERN European Organization for Nuclear Research) · 2025
Mapping between the equivalence classes of classical and σ-TMs.
Cited by 0Open access
Deutsch, Robert 1981-, avant-verlag · 2022
Cited by 0
Lassègue, Jean · SPIRE - Sciences Po Institutional REpository · 2017
Cited by 0
Rob Collins, Queen Mary, Peter Pearson et al. · 2014
The techniques described in this paper have been developed and applied on a series of major systems engineering projects, most recently including the BOWMAN programme. BOWMAN will encompass the design, development, manufacture, conversion (rollout) and support of the new communications systems for the British Army. The BOWMAN contract will be valued in excess of £1.5 Billion and be delivered and installed over a period of 6 years. Thread Analysis is a technique that enables systems design to be systematically inspected with respect to a number of desirable properties. Threads analysis finds application in domains including safety critical systems; security critical systems; concurrent,
Cited by 0
Jean Lassègue · SPIRE - Sciences Po Institutional REpository · 2017
International audience
Cited by 0
Andrew Hodges · 1990
Abstract By marking its fiftieth anniversary, this volume recognizes the long-lasting influence of the Turing machine concept. By collecting together new contributions from so many fields, it signals the exceptionally wide scope of that influence. This brief essay, intended to recall and honor the person of Alan M. Turing himself, will likewise mark not only the historical moment of Turing’s publication, but will seek to convey the breadth of thought that underlay his introduction and development of the machine concept. Alan Turing was born on 23 June 1912, and after submitting to a traditional British upper-middle-class schooling, won a scholarship to King’s College, Cambridge University. He graduated with distinction in mathematics in 1934. Within less than a year he was elected to a Fellowship of King’s College, his dissertation being a proof of the Central Limit Theorem, and it might have appeared that his interests would focus on the theory of probability.
Cited by 3
Hava T. Siegelmann · Progress in Biophysics and Molecular Biology · 2013
Cited by 21
Andrew Hodges · 2007
Cited by 27
P. Borckmans, Ole Jensen, V. O. Pannbacker et al. · Springer series in synergetics · 1995
Cited by 3
Andrew Hodges · Computerkultur · 1995
Cited by 12
Biological and medical physics series · 2005
Cited by 0
Luciano Floridi · PhilPapers (PhilPapers Foundation) · 2002
Cited by 0
Mark Hogarth · PSA Proceedings of the Biennial Meeting of the Philosophy of Science Association · 1994
Building on an idea by Pitowsky (1990), David Malament (private communications), Hogarth (1992) and Earman and Norton (1993) have shown how it is possible to perform computational supertasks—that is, an infinite number of computational steps in a finite span of time—in a kind of relativistic spacetime that Earman and Norton (1993) have dubbed a Malament-Hogarth spacetime. Definition 1 A spacetime (M,g) is Malament-Hogarth just when there is a future endless curve with past endpoint and a point q∊M such that . (Hereafter, the symbols “q” and “λ” are assumed to have the properties they have in Definition 1.1 shall also speak of a “λ-curve”.) Various examples of Malament-Hogarth (hereafter, M-H) spacetimes are given in Hogarth (1992), but the following artificial example from Earman and Norton (1993) is perhaps the simplest.
Cited by 183
Edward H. Flach, Santiago Schnell, John Norbury · Applied Mathematics Letters · 2007
Cited by 7Open access
Cited by 0