Build your own clarithmetic I: Setup and completeness

Clarithmetics are number theories based on computability logic (see http://www.csc.villanova.edu/~japaridz/CL/ ). Formulas of these theories represent interactive computational problems, and their "truth" is understood as existence of an algorithmic solution. Various complexity constraints on such solutions induce various versions of clarithmetic. The present paper introduces a parameterized/schematic version CLA11(P1,P2,P3,P4). By tuning the three parameters P1,P2,P3 in an essentially mechanical manner, one automatically obtains sound and complete theories with respect to a wide range of target tricomplexity classes, i.e. combinations of time (set by P3), space (set by P2) and so called amplitude (set by P1) complexities. Sound in the sense that every theorem T of the system represents an interactive number-theoretic computational problem with a solution from the given tricomplexity class and, furthermore, such a solution can be automatically extracted from a proof of T. And complete in the sense that every interactive number-theoretic problem with a solution from the given tricomplexity class is represented by some theorem of the system. Furthermore, through tuning the 4th parameter P4, at the cost of sacrificing recursive axiomatizability but not simplicity or elegance, the above extensional completeness can be strengthened to intensional completeness, according to which every formula representing a problem with a solution from the given tricomplexity class is a theorem of the system. This article is published in two parts. The present Part I introduces the system and proves its completeness, while Part II is devoted to proving soundness

Formal Verification of Security Protocol Implementations: A Survey

Automated formal verification of security protocols has been mostly focused on analyzing high-level abstract models which, however, are significantly different from real protocol implementations written in programming languages. Recently, some researchers have started investigating techniques that bring automated formal proofs closer to real implementations. This paper surveys these attempts, focusing on approaches that target the application code that implements protocol logic, rather than the libraries that implement cryptography. According to these approaches, libraries are assumed to correctly implement some models. The aim is to derive formal proofs that, under this assumption, give assurance about the application code that implements the protocol logic. The two main approaches of model extraction and code generation are presented, along with the main techniques adopted for each approac

The Dynamics of Knowledge Accumulation, Regulation and Appropriability in the Pharma-Biotech Sector: Policy Issues

Discussion of reasons for regulation in the pharmaceutical industr

Physical law and the quest for mathematical understanding

The theoretical physics of the first quarter of the twentieth century -centering around relativity theory and nonrelativistic quantum mechanics-has had a broad influence mathematically. The main achievement of theoretical physics in the following half-century was the development of quantum field theory or QFT. Yet the mathematical influence of QFT still belongs largely to the 21st century, because its mathematical foundations are still not well-understood

Open educational resources : conversations in cyberspace

172 p. : ill. ; 25 cm.Libro ElectrónicoEducation systems today face two major challenges: expanding the reach of education and improving its quality. Traditional solutions will not suffice, especially in the context of today's knowledge-intensive societies. The Open Educational Resources movement offers one solution for extending the reach of education and expanding learning opportunities. The goal of the movement is to equalize access to knowledge worldwide through openly and freely available online high-quality content. Over the course of two years, the international community came together in a series of online discussion forums to discuss the concept of Open Educational Resources and its potential. This publication makes the background papers and reports from those discussions available in print.--Publisher's description.A first forum : presenting the open educational resources (OER) movement. Open educational resources : an introductory note / Sally Johnstone -- Providing OER and related issues : an introductory note / Anne Margulies, ... [et al.] -- Using OER and related issues : in introductory note / Mohammed-Nabil Sabry, ... [et al.] -- Discussion highlights / Paul Albright -- Ongoing discussion. A research agenda for OER : discussion highlights / Kim Tucker and Peter Bateman -- A 'do-it-yourself' resource for OER : discussion highlights / Boris Vukovic -- Free and open source software (FOSS) and OER -- A second forum : discussing the OECD study of OER. Mapping procedures and users / Jan Hylén -- Why individuals and institutions share and use OER / Jan Hylén -- Discussion highlights / Alexa Joyce -- Priorities for action. Open educational resources : the way forward / Susan D'Antoni

Tree-Independent Dual-Tree Algorithms

Dual-tree algorithms are a widely used class of branch-and-bound algorithms. Unfortunately, developing dual-tree algorithms for use with different trees and problems is often complex and burdensome. We introduce a four-part logical split: the tree, the traversal, the point-to-point base case, and the pruning rule. We provide a meta-algorithm which allows development of dual-tree algorithms in a tree-independent manner and easy extension to entirely new types of trees. Representations are provided for five common algorithms; for k-nearest neighbor search, this leads to a novel, tighter pruning bound. The meta-algorithm also allows straightforward extensions to massively parallel settings.Comment: accepted in ICML 201