The Road to Quantum Computational Supremacy

We present an idiosyncratic view of the race for quantum computational supremacy. Google's approach and IBM challenge are examined. An unexpected side-effect of the race is the significant progress in designing fast classical algorithms. Quantum supremacy, if achieved, won't make classical computing obsolete.Comment: 15 pages, 1 figur

Computability and analysis: the legacy of Alan Turing

We discuss the legacy of Alan Turing and his impact on computability and analysis.Comment: 49 page

A personal account of Turing’s imprint on the development of computer science

The rst part of the XX century saw the development of the digital computer and the eld of computer science. In the present paper, we sketch our vision of that period and of the role that Alan Turing and some of his contemporary peers played in that development.Preprin

UvA-DARE (Digital Academic Repository) From Universal to Programming Languages

Abstract. In the history of computation, the reflection over language plays an important role in its foundational days, still to be fully investigated. In particular, the effort to find a perfect, universal language apt to sustain transnational communication among scientists was often directed towards the reduction of semantic ambiguity and cultural neutrality. The result is a class of non-natural languages created in the same period and sometimes by the same scientists involved in logic, mathematics, and computability, such as Descartes, Leibniz and Peano. Finally, as a special case, we will analyse the use of the metaphor of Esperanto within the history of Computer Science

Parikh and Wittgenstein

A survey of Parikh’s philosophical appropriations of Wittgensteinian themes, placed into historical context against the backdrop of Turing’s famous paper, “On computable numbers, with an application to the Entscheidungsproblem” (Turing in Proc Lond Math Soc 2(42): 230–265, 1936/1937) and its connections with Wittgenstein and the foundations of mathematics. Characterizing Parikh’s contributions to the interaction between logic and philosophy at its foundations, we argue that his work gives the lie to recent presentations of Wittgenstein’s so-called metaphilosophy (e.g., Horwich in Wittgenstein’s metaphilosophy. Oxford University Press, Oxford, 2012) as a kind of “dead end” quietism. From early work on the idea of a feasibility in arithmetic (Parikh in J Symb Log 36(3):494–508, 1971) and vagueness (Parikh in Logic, language and method. Reidel, Boston, pp 241–261, 1983) to his more recent program in social software (Parikh in Advances in modal logic, vol 2. CSLI Publications, Stanford, pp 381–400, 2001a), Parikh’s work encompasses and touches upon many foundational issues in epistemology, philosophy of logic, philosophy of language, and value theory. But it expresses a unified philosophical point of view. In his most recent work, questions about public and private languages, opportunity spaces, strategic voting, non-monotonic inference and knowledge in literature provide a remarkable series of suggestions about how to present issues of fundamental importance in theoretical computer science as serious philosophical issues

Problems

I. Definition of the Subject and Its Importanc