DOCSLIB.ORG

Topics in Programming Languages, a Philosophical Analysis Through the Case of Prolog

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Topics in Programming Languages, a Philosophical Analysis Through the Case of Prolog i Topics in Programming Languages, a Philosophical Analysis through the case of Prolog Luís Homem Universidad de Salamanca Facultad de Filosofia A thesis submitted for the degree of Doctor en Lógica y Filosofía de la Ciencia Salamanca 2018 ii This thesis is dedicated to family and friends iii Acknowledgements I am very grateful for having had the opportunity to attend classes with all the Epimenides Program Professors: Dr.o Alejandro Sobrino, Dr.o Alfredo Burrieza, Dr.o Ángel Nepomuceno, Dr.a Concepción Martínez, Dr.o Enrique Alonso, Dr.o Huberto Marraud, Dr.a María Manzano, Dr.o José Miguel Sagüillo, and Dr.o Juan Luis Barba. I would like to extend my sincere thanks and congratulations to the Academic Com- mission of the Program. A very special gratitude goes to Dr.a María Manzano-Arjona for her patience with the troubles of a candidate with- out a scholarship, or any funding for the work, and also to Dr.o Fer- nando Soler-Toscano, for his quick and sharp amendments, corrections and suggestions. Lastly, I cannot but offer my heartfelt thanks to all the members and collaborators of the Center for Philosophy of Sciences of the University of Lisbon (CFCUL), specially Dr.a Olga Pombo, who invited me to be an integrated member in 2011. iv Abstract Programming Languages seldom find proper anchorage in philosophy of logic, language and science. What is more, philosophy of language seems to be restricted to natural languages and linguistics, and even philosophy of logic is rarely framed into programming language topics. Natural languages history is intrinsically acoustics-to-visual, phonetics- to-writing, whereas computing programming languages, under man– machine interaction, aspire to visual-to-acoustics, writing-to-phonetics instead, namely through natural language processing. One such pro- gramming language as Prolog has the peculiar attribute of having been unfolded in the passage from grammar studies, linguistics and formal symbolic grammar studies to the very specific and incipient compu- tational enterprises of natural language processing and logic program- ming. Recounting Prolog’s philosophical, mechanical and algorithmic harbingers endorse us to the mechanical-computational background explored by Pascal, Leibniz, Boole, Jacquard, Babbage, Zuse, until reaching to the ACE (Alan Turing) and the EDVAC (von Neumann). Recursion theory and computability (Turing, Church, Gödel, Kleene), cryptography and information theory (Shannon), permit us to inter- pret ahead the evolving realm of programming languages. The line from λ-Calculus to Lisp, and from Lisp to the Algol-family program- ming languages, the procedural and declarative split with the C lan- guage and Prolog, and the ensuing syntax and semantic branching explosion are here investigated in relation with the original élan of both C and Prolog. Philosophy of mathematics different approaches – structuralist, formalist, logicist, intuitionist – are confronted with com- putability, and furthermore, logic programming and Prolog, studying v closely such authors as Frege, Gödel, and Wittgenstein. The logicist, first-order complete and atomist nature of logic programming, settled on Horn clauses with SLD-resolution, is subsequently examined. Like- wise, the path from linguistic semiotics and the linguistics turn from the Saussurian Course Générale to the Chomsky-Schützenberger hierarchy, with a clear glance towards automata and complexity theories, all in all with a common background on the ancient P¯an. ini grammar, drives the research far wider than the use of the Backus-Naur form in Saussurian semiotics and programming languages, yet forgotten about. It permits to describe Prolog as a typical by-pass product of computational logi- cism and linguistics structuralism, with the philosophical design of the Chomsky-Schützenberger hierarchy, specially apt to (strong) AI illu- sion, as seen by its input into the Fifth Generation Computer Systems (FGCS) in Japan. It also brings about how the syntax-structuralism and the phonological destitution in natural language processing his- tory (firsthand in automated theorem-proving, but also in statistical machine learning), and in logic programming and Prolog alike (through Q-Systems), are sign of a most general destitution of philosophy of mu- sic in western philosophy of language, reason enough to convoke the Medievalist Boethius, and the Contemporary provenience of the gen- erative theory of tonal music. The separate and individual treads of the different artificers of Prolog – Alain Colmeraueur’s work in the ma- chine translation prototype, Philippe Roussel’s work in SL-Resolution and in the Prolog manual, and Robert Kowalski’s work on the de- velopment of the Turing-complete logic programming paradigm – are framed in the investigation, inasmuch as, more broadly, Kantian critic philosophy, with the aim of endowing a classical thoughtfulness to arti- ficiality, computing and informational philosophy, technology studies, and programming languages, with Prolog highlighted. Kant’s anti- nomies are forethought under the light of these premises, and infor- matic anew antinomies are interacted with the concept of virtuality in the computus era, by contrast with that of calculus. More narrowly, vi the Kantian doctrine of schemata is faced up against the core of pro- gramming languages theory through a topic that the author has, con- ventionally, named S-Mentalism, meaning the possibility of equaling computable functions with computer vision hierarchy and, inasmuch as the inversion of Kant’s account of schemata, the proper inversion of the von Neumann or Princeton computer architecture (image philosophy and ontological concepts, such as Bergson’s "La Pensée et le Mou- vant", "Matière et mémoire" and Deleuze’s "L’Image-Mouvement" and "L’Image-Temps" reveal themselves very fit to one such cogita- tion). With this is also brought in the encounter with the Euclidean parallel geometry, a long lasting tradition until Bolyai-Lobachevsky, mainly under the relaxation of the fifth parallel postulate, having had a determining fate in philosophy of physics (from Riemannn to Ein- stein). In like manner, diagonalization proofs from Cantor to Gödel (and the diagonalization process contained in computability and cryp- tography in informational communication) is shown to have enrolled the proper history of computation, with flagrant topological dimen- sions included. Logic programming and Prolog are, along this line, explored by calling upon the subject of the least possible constraint limits to logic and its inherent paradoxes, inevitably constituted also in programming languages topics and theory. vii Contents I Prolog, The Language of Mathematical and Dynamic Antinomies in Artificial Intelligence 1 1 Prolog and Logic Programming, a Declarative Language in Phi- losophy of Science, Essential Decomposed Fundamentals 2 1.1 Preliminary Historical & Philosophical Remarks . .6 1.1.1 The von Neumann Architecture, Artificial Neurons, and In- formation Theory . 19 1.1.2 Informatic Anew Antinomies . 77 1.1.3 Appendix on Virtuality . 105 2 Natural Language Processing in Prolog 113 2.1 W-grammars and Q-systems in Natural Language Processing . 113 2.1.1 The Chomsky-Schützenberger Hierarchy . 116 2.1.1.1 From Saussure’s Linguistics to the Algebraic The- ory of Context-Free Languages . 123 2.1.1.2 Musical Interlude . 129 2.1.1.3 The Chomsky Hierarchy in Boethius’ Triptych . 136 II Core Prolog 142 2.2 Essentials . 143 2.3 Past Convergent Fragments of λ-Calculus, Lisp, and Algol 60-68, and ahead divergent fragments of C/C++, Java, and Python . 202 Bibliography 224 viii List of Figures 1.1 Interpretation of multiplication. (Shannon’s "Figure 3") . 29 1.2 The Parallells Vth Euclidean Postulate (and Paradox). 72 1.3 Computational Complexity Classes . 76 2.1 The Chomsky Hierarchy . 116 2.2 The Chomsky hierarchy contained in Boethius’ triptych . 137 ix Part I Prolog, The Language of Mathematical and Dynamic Antinomies in Artificial Intelligence 1 Chapter 1 Prolog and Logic Programming, a Declarative Language in Philosophy of Science, Essential Decomposed Fundamentals Prolog is a computational and logical programming language created in the Fall of 1972 (after a first preliminary version in late 1971), the name stands for Programming in Logic (in French Programmation en Logique) [78, 276, 223, 224, 125, 120]. A definitive version of Prolog was finally completed in 1973, and although the syn- tax retained the form of the preliminary version, it can be correctly said that its constitution has been the harbinger and prior direct (logical and computational) correspondent of all current Prolog(s). In this statement we are portraying, thus, the Prolog version of 1973 as having been the first in a direct line to the first ISO standardized Prolog (1995) and all its due natural corrigenda, considered in the time span the Warren Abstract Machine (WAM) (1983) as the de facto standard for all Prolog compilers/interpreters [78, 79, 321, 65]. The names involved in the core conception of the programming language Prolog are, above all, those of Alain Colmerauer, Philippe Roussel and Robert Kowalski, even if the foundational and philosophical articulation of a "Machine-Oriented Logic Based on the Resolution Principle" [316] (1965) belonged to J.L. Robinson. We can not neglect the various subsumed and hidden intellectual achievements without which Prolog could not have ever taken its form, such as the DPLL Algo- 2 rithm by Martin Davis, Hilary Putnam, George Logemann and Donald Loveland (1962), the (Alfred) Horn clauses
Load more

Recommended publications
  • GNU/Linux AI & Alife HOWTO
    GNU/Linux AI & Alife HOWTO GNU/Linux AI & Alife HOWTO Table of Contents GNU/Linux AI & Alife HOWTO......................................................................................................................1 by John Eikenberry..................................................................................................................................1 1. Introduction..........................................................................................................................................1 2. Symbolic Systems (GOFAI)................................................................................................................1 3. Connectionism.....................................................................................................................................1 4. Evolutionary Computing......................................................................................................................1 5. Alife & Complex Systems...................................................................................................................1 6. Agents & Robotics...............................................................................................................................1 7. Statistical & Machine Learning...........................................................................................................2 8. Missing & Dead...................................................................................................................................2 1. Introduction.........................................................................................................................................2
    [Show full text]
  • A Politico-Social History of Algolt (With a Chronology in the Form of a Log Book)
    A Politico-Social History of Algolt (With a Chronology in the Form of a Log Book) R. w. BEMER Introduction This is an admittedly fragmentary chronicle of events in the develop­ ment of the algorithmic language ALGOL. Nevertheless, it seems perti­ nent, while we await the advent of a technical and conceptual history, to outline the matrix of forces which shaped that history in a political and social sense. Perhaps the author's role is only that of recorder of visible events, rather than the complex interplay of ideas which have made ALGOL the force it is in the computational world. It is true, as Professor Ershov stated in his review of a draft of the present work, that "the reading of this history, rich in curious details, nevertheless does not enable the beginner to understand why ALGOL, with a history that would seem more disappointing than triumphant, changed the face of current programming". I can only state that the time scale and my own lesser competence do not allow the tracing of conceptual development in requisite detail. Books are sure to follow in this area, particularly one by Knuth. A further defect in the present work is the relatively lesser availability of European input to the log, although I could claim better access than many in the U.S.A. This is regrettable in view of the relatively stronger support given to ALGOL in Europe. Perhaps this calmer acceptance had the effect of reducing the number of significant entries for a log such as this. Following a brief view of the pattern of events come the entries of the chronology, or log, numbered for reference in the text.
    [Show full text]
  • X-Machines for Agent-Based Modeling FLAME Perspectives CHAPMAN & HALL/CRC COMPUTER and INFORMATION SCIENCE SERIES
    X-Machines for Agent-Based Modeling FLAME Perspectives CHAPMAN & HALL/CRC COMPUTER and INFORMATION SCIENCE SERIES Series Editor: Sartaj Sahni PUBLISHED TITLES ADVERSARIAL REASONING: COMPUTATIONAL APPROACHES TO READING THE OPPONENT’S MIND Alexander Kott and William M. McEneaney COMPUTER-AIDED GRAPHING AND SIMULATION TOOLS FOR AUTOCAD USERS P. A. Simionescu DELAUNAY MESH GENERATION Siu-Wing Cheng, Tamal Krishna Dey, and Jonathan Richard Shewchuk DISTRIBUTED SENSOR NETWORKS, SECOND EDITION S. Sitharama Iyengar and Richard R. Brooks DISTRIBUTED SYSTEMS: AN ALGORITHMIC APPROACH, SECOND EDITION Sukumar Ghosh ENERGY-AWARE MEMORY MANAGEMENT FOR EMBEDDED MULTIMEDIA SYSTEMS: A COMPUTER-AIDED DESIGN APPROACH Florin Balasa and Dhiraj K. Pradhan ENERGY EFFICIENT HARDWARE-SOFTWARE CO-SYNTHESIS USING RECONFIGURABLE HARDWARE Jingzhao Ou and Viktor K. Prasanna FROM ACTION SYSTEMS TO DISTRIBUTED SYSTEMS: THE REFINEMENT APPROACH Luigia Petre and Emil Sekerinski FUNDAMENTALS OF NATURAL COMPUTING: BASIC CONCEPTS, ALGORITHMS, AND APPLICATIONS Leandro Nunes de Castro HANDBOOK OF ALGORITHMS FOR WIRELESS NETWORKING AND MOBILE COMPUTING Azzedine Boukerche HANDBOOK OF APPROXIMATION ALGORITHMS AND METAHEURISTICS Teofilo F. Gonzalez HANDBOOK OF BIOINSPIRED ALGORITHMS AND APPLICATIONS Stephan Olariu and Albert Y. Zomaya HANDBOOK OF COMPUTATIONAL MOLECULAR BIOLOGY Srinivas Aluru HANDBOOK OF DATA STRUCTURES AND APPLICATIONS Dinesh P. Mehta and Sartaj Sahni PUBLISHED TITLES CONTINUED HANDBOOK OF DYNAMIC SYSTEM MODELING Paul A. Fishwick HANDBOOK OF ENERGY-AWARE AND GREEN COMPUTING Ishfaq Ahmad and Sanjay Ranka HANDBOOK OF GRAPH THEORY, COMBINATORIAL OPTIMIZATION, AND ALGORITHMS Krishnaiyan “KT” Thulasiraman, Subramanian Arumugam, Andreas Brandstädt, and Takao Nishizeki HANDBOOK OF PARALLEL COMPUTING: MODELS, ALGORITHMS AND APPLICATIONS Sanguthevar Rajasekaran and John Reif HANDBOOK OF REAL-TIME AND EMBEDDED SYSTEMS Insup Lee, Joseph Y-T.
    [Show full text]
  • Compiler Error Messages Considered Unhelpful: the Landscape of Text-Based Programming Error Message Research
    Working Group Report ITiCSE-WGR ’19, July 15–17, 2019, Aberdeen, Scotland Uk Compiler Error Messages Considered Unhelpful: The Landscape of Text-Based Programming Error Message Research Brett A. Becker∗ Paul Denny∗ Raymond Pettit∗ University College Dublin University of Auckland University of Virginia Dublin, Ireland Auckland, New Zealand Charlottesville, Virginia, USA [email protected] [email protected] [email protected] Durell Bouchard Dennis J. Bouvier Brian Harrington Roanoke College Southern Illinois University Edwardsville University of Toronto Scarborough Roanoke, Virgina, USA Edwardsville, Illinois, USA Scarborough, Ontario, Canada [email protected] [email protected] [email protected] Amir Kamil Amey Karkare Chris McDonald University of Michigan Indian Institute of Technology Kanpur University of Western Australia Ann Arbor, Michigan, USA Kanpur, India Perth, Australia [email protected] [email protected] [email protected] Peter-Michael Osera Janice L. Pearce James Prather Grinnell College Berea College Abilene Christian University Grinnell, Iowa, USA Berea, Kentucky, USA Abilene, Texas, USA [email protected] [email protected] [email protected] ABSTRACT of evidence supporting each one (historical, anecdotal, and empiri- Diagnostic messages generated by compilers and interpreters such cal). This work can serve as a starting point for those who wish to as syntax error messages have been researched for over half of a conduct research on compiler error messages, runtime errors, and century. Unfortunately, these messages which include error, warn- warnings. We also make the bibtex file of our 300+ reference corpus ing, and run-time messages, present substantial difficulty and could publicly available.
    [Show full text]
  • Panel: NSF-Sponsored Innovative Approaches to Undergraduate Computer Science
    Panel: NSF-Sponsored Innovative Approaches to Undergraduate Computer Science Stephen Bloch (Adelphi University) Amruth Kumar (Ramapo College) Stanislav Kurkovsky (Central CT State University) Clif Kussmaul (Muhlenberg College) Matt Dickerson (Middlebury College), moderator Project Web site(s) Intervention Delivery Supervision Program http://programbydesign.org curriculum with supporting in class; software normally active, but can be by Design http://picturingprograms.org IDE, libraries, & texts and textbook are done other ways Stephen Bloch http://www.ccs.neu.edu/home/ free downloads matthias/HtDP2e/ or web-based NSF awards 0010064 http://racket-lang.org & 0618543 http://wescheme.org Problets http://www.problets.org in- or after-class problem- applet in none - teacher not needed, Amruth Kumar solving exercises on a browser although some adopters use programming concepts it in active mode too NSF award 0817187 Mobile Game http://www.mgdcs.com/ in-class or take-home PC passive - teacher as Development programming projects facilitator to answer Qs Stan Kurkovsky NSF award DUE-0941348 POGIL http://pogil.org in-class activity paper or web passive - teacher as Clif Kussmaul http://cspogil.org facilitator to answer Qs NSF award TUES 1044679 Project Course(s) Language(s) Focus Program Middle school, Usually Scheme-like teaching problem-solving process, by pre-AP CS in HS, languages leading into Java; particularly test-driven DesignStephen CS0, CS1, CS2 has also been done in Python, development and use of data Bloch in college ML, Java, Scala, ... types to guide coding & testing Problets AP-CS, CS I, CS 2. C, C++, Java, C# code tracing, debugging, Amruth Kumar also as refresher or expression evaluation, to switch languages predicting program state in other courses Mobile Game AP-CS, CS1, CS2 Java core OO programming; DevelopmentSt intro to advanced subjects an Kurkovsky such as AI, networks, security POGILClif CS1, CS2, SE, etc.
    [Show full text]
  • Internet Engineering Jan Nikodem, Ph.D. Software Engineering
    Internet Engineering Jan Nikodem, Ph.D. Software Engineering Theengineering paradigm Software Engineering Lecture 3 The term "software crisis" was coined at the first NATO Software Engineering Conference in 1968 by: Friedrich. L. Bauer Nationality;German, mathematician, theoretical physicist, Technical University of Munich Friedrich L. Bauer 1924 3/24 The term "software crisis" was coined at the first NATO Software Engineering Conference in 1968 by: Peter Naur Nationality;Dutch, astronomer, Regnecentralen, Niels Bohr Institute, Technical University of Denmark, University of Copenhagen. Peter Naur 1928 4/24 Whatshouldbe ourresponse to software crisis which provided with too little quality, too late deliver and over budget? Nationality;Dutch, astronomer, Regnecentralen, Niels Bohr Institute, Technical University of Denmark, University of Copenhagen. Peter Naur 1928 5/24 Software should following an engineering paradigm NATO conference in Garmisch-Partenkirchen, 1968 Peter Naur 1928 6/24 The hope is that the progress in hardware will cure all software ills. The Oberon System User Guide and Programmer's Manual. ACM Press Nationality;Swiss, electrical engineer, computer scientist ETH Zürich, IBM Zürich Research Laboratory, Institute for Media Communications Martin Reiser 7/24 However, a critical observer may notethat software manages to outgrow hardware in size and sluggishness. The Oberon System User Guide and Programmer's Manual. ACM Press Nationality;Swiss, electrical engineer, computer scientist ETH Zürich, IBM Zürich Research Laboratory, Institute for Media Communications Martin Reiser 8/24 Wirth's computing adage Software is getting slower more rapidly than hardware becomes faster. Nationality;Swiss, electronic engineer, computer scientist ETH Zürich, University of California, Berkeley, Stanford University University of Zurich. Xerox PARC.
    [Show full text]
  • Fermat, Leibniz, Euler, and the Gang: the True History of the Concepts Of
    FERMAT, LEIBNIZ, EULER, AND THE GANG: THE TRUE HISTORY OF THE CONCEPTS OF LIMIT AND SHADOW TIZIANA BASCELLI, EMANUELE BOTTAZZI, FREDERIK HERZBERG, VLADIMIR KANOVEI, KARIN U. KATZ, MIKHAIL G. KATZ, TAHL NOWIK, DAVID SHERRY, AND STEVEN SHNIDER Abstract. Fermat, Leibniz, Euler, and Cauchy all used one or another form of approximate equality, or the idea of discarding “negligible” terms, so as to obtain a correct analytic answer. Their inferential moves find suitable proxies in the context of modern the- ories of infinitesimals, and specifically the concept of shadow. We give an application to decreasing rearrangements of real functions. Contents 1. Introduction 2 2. Methodological remarks 4 2.1. A-track and B-track 5 2.2. Formal epistemology: Easwaran on hyperreals 6 2.3. Zermelo–Fraenkel axioms and the Feferman–Levy model 8 2.4. Skolem integers and Robinson integers 9 2.5. Williamson, complexity, and other arguments 10 2.6. Infinity and infinitesimal: let both pretty severely alone 13 3. Fermat’s adequality 13 3.1. Summary of Fermat’s algorithm 14 arXiv:1407.0233v1 [math.HO] 1 Jul 2014 3.2. Tangent line and convexity of parabola 15 3.3. Fermat, Galileo, and Wallis 17 4. Leibniz’s Transcendental law of homogeneity 18 4.1. When are quantities equal? 19 4.2. Product rule 20 5. Euler’s Principle of Cancellation 20 6. What did Cauchy mean by “limit”? 22 6.1. Cauchy on Leibniz 23 6.2. Cauchy on continuity 23 7. Modern formalisations: a case study 25 8. A combinatorial approach to decreasing rearrangements 26 9.
    [Show full text]
  • History of Computer Science from Wikipedia, the Free Encyclopedia
    History of computer science From Wikipedia, the free encyclopedia The history of computer science began long before the modern discipline of computer science that emerged in the 20th century, and hinted at in the centuries prior. The progression, from mechanical inventions and mathematical theories towards the modern concepts and machines, formed a major academic field and the basis of a massive worldwide industry.[1] Contents 1 Early history 1.1 Binary logic 1.2 Birth of computer 2 Emergence of a discipline 2.1 Charles Babbage and Ada Lovelace 2.2 Alan Turing and the Turing Machine 2.3 Shannon and information theory 2.4 Wiener and cybernetics 2.5 John von Neumann and the von Neumann architecture 3 See also 4 Notes 5 Sources 6 Further reading 7 External links Early history The earliest known as tool for use in computation was the abacus, developed in period 2700–2300 BCE in Sumer . The Sumerians' abacus consisted of a table of successive columns which delimited the successive orders of magnitude of their sexagesimal number system.[2] Its original style of usage was by lines drawn in sand with pebbles . Abaci of a more modern design are still used as calculation tools today.[3] The Antikythera mechanism is believed to be the earliest known mechanical analog computer.[4] It was designed to calculate astronomical positions. It was discovered in 1901 in the Antikythera wreck off the Greek island of Antikythera, between Kythera and Crete, and has been dated to c. 100 BCE. Technological artifacts of similar complexity did not reappear until the 14th century, when mechanical astronomical clocks appeared in Europe.[5] Mechanical analog computing devices appeared a thousand years later in the medieval Islamic world.
    [Show full text]
  • All That Math Portraits of Mathematicians As Young Researchers
    Downloaded from orbit.dtu.dk on: Oct 06, 2021 All that Math Portraits of mathematicians as young researchers Hansen, Vagn Lundsgaard Published in: EMS Newsletter Publication date: 2012 Document Version Publisher's PDF, also known as Version of record Link back to DTU Orbit Citation (APA): Hansen, V. L. (2012). All that Math: Portraits of mathematicians as young researchers. EMS Newsletter, (85), 61-62. General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. Users may download and print one copy of any publication from the public portal for the purpose of private study or research. You may not further distribute the material or use it for any profit-making activity or commercial gain You may freely distribute the URL identifying the publication in the public portal If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim. NEWSLETTER OF THE EUROPEAN MATHEMATICAL SOCIETY Editorial Obituary Feature Interview 6ecm Marco Brunella Alan Turing’s Centenary Endre Szemerédi p. 4 p. 29 p. 32 p. 39 September 2012 Issue 85 ISSN 1027-488X S E European M M Mathematical E S Society Applied Mathematics Journals from Cambridge journals.cambridge.org/pem journals.cambridge.org/ejm journals.cambridge.org/psp journals.cambridge.org/flm journals.cambridge.org/anz journals.cambridge.org/pes journals.cambridge.org/prm journals.cambridge.org/anu journals.cambridge.org/mtk Receive a free trial to the latest issue of each of our mathematics journals at journals.cambridge.org/maths Cambridge Press Applied Maths Advert_AW.indd 1 30/07/2012 12:11 Contents Editorial Team Editors-in-Chief Jorge Buescu (2009–2012) European (Book Reviews) Vicente Muñoz (2005–2012) Dep.
    [Show full text]
  • The Legacy of Victor R. Basili
    University of Tennessee, Knoxville TRACE: Tennessee Research and Creative Exchange About Harlan D. Mills Science Alliance 2005 Foundations of Empirical Software Engineering: The Legacy of Victor R. Basili Barry Boehm Hans Dieter Rombach Marvin V. Zelkowitz Follow this and additional works at: https://trace.tennessee.edu/utk_harlanabout Part of the Physical Sciences and Mathematics Commons Recommended Citation Boehm, Barry; Rombach, Hans Dieter; and Zelkowitz, Marvin V., "Foundations of Empirical Software Engineering: The Legacy of Victor R. Basili" (2005). About Harlan D. Mills. https://trace.tennessee.edu/utk_harlanabout/3 This Book is brought to you for free and open access by the Science Alliance at TRACE: Tennessee Research and Creative Exchange. It has been accepted for inclusion in About Harlan D. Mills by an authorized administrator of TRACE: Tennessee Research and Creative Exchange. For more information, please contact [email protected]. University of Tennessee, Knoxville Trace: Tennessee Research and Creative Exchange The Harlan D. Mills Collection Science Alliance 1-1-2005 Foundations of Empirical Software Engineering: The Legacy of Victor R.Basili Barry Boehm Hans Dieter Rombach Marvin V. Zelkowitz Recommended Citation Boehm, Barry; Rombach, Hans Dieter; and Zelkowitz, Marvin V., "Foundations of Empirical Software Engineering: The Legacy of Victor R.Basili" (2005). The Harlan D. Mills Collection. http://trace.tennessee.edu/utk_harlan/36 This Book is brought to you for free and open access by the Science Alliance at Trace: Tennessee Research and Creative Exchange. It has been accepted for inclusion in The Harlan D. Mills Collection by an authorized administrator of Trace: Tennessee Research and Creative Exchange. For more information, please contact [email protected].
    [Show full text]
  • Connes on the Role of Hyperreals in Mathematics
    Found Sci DOI 10.1007/s10699-012-9316-5 Tools, Objects, and Chimeras: Connes on the Role of Hyperreals in Mathematics Vladimir Kanovei · Mikhail G. Katz · Thomas Mormann © Springer Science+Business Media Dordrecht 2012 Abstract We examine some of Connes’ criticisms of Robinson’s infinitesimals starting in 1995. Connes sought to exploit the Solovay model S as ammunition against non-standard analysis, but the model tends to boomerang, undercutting Connes’ own earlier work in func- tional analysis. Connes described the hyperreals as both a “virtual theory” and a “chimera”, yet acknowledged that his argument relies on the transfer principle. We analyze Connes’ “dart-throwing” thought experiment, but reach an opposite conclusion. In S, all definable sets of reals are Lebesgue measurable, suggesting that Connes views a theory as being “vir- tual” if it is not definable in a suitable model of ZFC. If so, Connes’ claim that a theory of the hyperreals is “virtual” is refuted by the existence of a definable model of the hyperreal field due to Kanovei and Shelah. Free ultrafilters aren’t definable, yet Connes exploited such ultrafilters both in his own earlier work on the classification of factors in the 1970s and 80s, and in Noncommutative Geometry, raising the question whether the latter may not be vulnera- ble to Connes’ criticism of virtuality. We analyze the philosophical underpinnings of Connes’ argument based on Gödel’s incompleteness theorem, and detect an apparent circularity in Connes’ logic. We document the reliance on non-constructive foundational material, and specifically on the Dixmier trace − (featured on the front cover of Connes’ magnum opus) V.
    [Show full text]
  • Editors/Translators Foreword
    J Comput Virol (2009) 5:1–3 DOI 10.1007/s11416-008-0116-y EDITORIAL Editors/translators Foreword Daniel Bilar · Eric Filiol © Springer-Verlag France 2009 Bereishit In the beginning, there was bureaucracy. I had tried a feeling of nostalgia (and gratitude for Donald Knuth). I set to get major AV companies to give me malware samples to it aside till Christmas break. study in an academic setting, but to no avail: Liability rea- As I worked my way through the thesis over Christmas sons, and their suggestion—trekking back and forth to their break 2006, my cursory curiosity gave way to wonderment, corporate ‘clean’ room—was unpalatable to me. I like flat then awe, then electricity. I felt as if I had stumbled upon hierarchies, so I turned to herm1t. Herm1t runs (singlehand- a 10th century manuscript in an Scottish convent, delineat- edly, with minimal equipment and funds) the labour of love ing the calculus seven hundred years before Leibnitz and known as vxheavens (http://vx.netlux.org), a full-spectrum Newton. Aspects of the history of computer virology had to site dedicated to computer viruses. As quid pro quo, I sent be rewritten and proper due given- what a fortuitous find! him historical papers he sought for his collection. One title, I sent a printed snail mail copy off to herm1t in the Ukraine though, seemed out of reach: A German 1980 MSc thesis by and pondered my next steps. some fellow named Juergen Kraus. In early February, Eric Filiol, after having discovered an A hefty Dortmund package arrived late October 2006.
    [Show full text]