Related

Contents
3 found
Order:
  1. Arithmetic logical Irreversibility and the Halting Problem (Revised and Fixed version).Yair Lapin - manuscript
    The Turing machine halting problem can be explained by several factors, including arithmetic logic irreversibility and memory erasure, which contribute to computational uncertainty due to information loss during computation. Essentially, this means that an algorithm can only preserve information about an input, rather than generate new information. This uncertainty arises from characteristics such as arithmetic logical irreversibility, Landauer's principle, and memory erasure, which ultimately lead to a loss of information and an increase in entropy. To measure this uncertainty and loss (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  2. Predicativity and constructive mathematics.Laura Crosilla - 2022 - In Gianluigi Oliveri, Claudio Ternullo & Stefano Boscolo (eds.), Objects, Structures, and Logics. Cham (Switzerland): Springer.
    In this article I present a disagreement between classical and constructive approaches to predicativity regarding the predicative status of so-called generalised inductive definitions. I begin by offering some motivation for an enquiry in the predicative foundations of constructive mathematics, by looking at contemporary work at the intersection between mathematics and computer science. I then review the background notions and spell out the above-mentioned disagreement between classical and constructive approaches to predicativity. Finally, I look at possible ways of defending the constructive (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   4 citations  
  3. Proofs are Programs: 19th Century Logic and 21st Century Computing.Philip Wadler - manuscript
    As the 19th century drew to a close, logicians formalized an ideal notion of proof. They were driven by nothing other than an abiding interest in truth, and their proofs were as ethereal as the mind of God. Yet within decades these mathematical abstractions were realized by the hand of man, in the digital stored-program computer. How it came to be recognized that proofs and programs are the same thing is a story that spans a century, a chase with as (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation