1,618 research outputs found
A Formalization of Polytime Functions
We present a deep embedding of Bellantoni and Cook's syntactic
characterization of polytime functions. We prove formally that it is correct
and complete with respect to the original characterization by Cobham that
required a bound to be proved manually. Compared to the paper proof by
Bellantoni and Cook, we have been careful in making our proof fully contructive
so that we obtain more precise bounding polynomials and more efficient
translations between the two characterizations. Another difference is that we
consider functions on bitstrings instead of functions on positive integers.
This latter change is motivated by the application of our formalization in the
context of formal security proofs in cryptography. Based on our core
formalization, we have started developing a library of polytime functions that
can be reused to build more complex ones.Comment: 13 page
The structural transformation of embeddedness
The concept of embeddedness plays a central role in the segment of economic sociology and social theory which is inspired by the works of Karl Polanyi. But to the extent that embeddedness is understood in a substantialist manner, implying the existence of a unitary lifeworld, the desire for embeddedness is an impossible aspiration under modern conditions. Throughout the modern era it is however possible to observe the emergence of complex societal stabilization mechanisms, which serve as substitutes to traditional forms of embeddedness. The emergence of function specific cultures, in the form of, for example, legal, political and scientific cultures, establishing a âsecond natureâ in the Hegelian sense, is one example of this. Other examples are (neo-)corporatist institutions which fulfilled a central stabilising role in classical modernity and the kind of network based governance arrangements which fulfil a similar position in todayâs radicalised modernity
Complexity Information Flow in a Multi-threaded Imperative Language
We propose a type system to analyze the time consumed by multi-threaded
imperative programs with a shared global memory, which delineates a class of
safe multi-threaded programs. We demonstrate that a safe multi-threaded program
runs in polynomial time if (i) it is strongly terminating wrt a
non-deterministic scheduling policy or (ii) it terminates wrt a deterministic
and quiet scheduling policy. As a consequence, we also characterize the set of
polynomial time functions. The type system presented is based on the
fundamental notion of data tiering, which is central in implicit computational
complexity. It regulates the information flow in a computation. This aspect is
interesting in that the type system bears a resemblance to typed based
information flow analysis and notions of non-interference. As far as we know,
this is the first characterization by a type system of polynomial time
multi-threaded programs
Implicit complexity for coinductive data: a characterization of corecurrence
We propose a framework for reasoning about programs that manipulate
coinductive data as well as inductive data. Our approach is based on using
equational programs, which support a seamless combination of computation and
reasoning, and using productivity (fairness) as the fundamental assertion,
rather than bi-simulation. The latter is expressible in terms of the former. As
an application to this framework, we give an implicit characterization of
corecurrence: a function is definable using corecurrence iff its productivity
is provable using coinduction for formulas in which data-predicates do not
occur negatively. This is an analog, albeit in weaker form, of a
characterization of recurrence (i.e. primitive recursion) in [Leivant, Unipolar
induction, TCS 318, 2004].Comment: In Proceedings DICE 2011, arXiv:1201.034
On tiered small jump operators
Predicative analysis of recursion schema is a method to characterize
complexity classes like the class FPTIME of polynomial time computable
functions. This analysis comes from the works of Bellantoni and Cook, and
Leivant by data tiering. Here, we refine predicative analysis by using a
ramified Ackermann's construction of a non-primitive recursive function. We
obtain a hierarchy of functions which characterizes exactly functions, which
are computed in O(n^k) time over register machine model of computation. For
this, we introduce a strict ramification principle. Then, we show how to
diagonalize in order to obtain an exponential function and to jump outside
deterministic polynomial time. Lastly, we suggest a dependent typed
lambda-calculus to represent this construction
Kriesel and Wittgenstein
Georg Kreisel (15 September 1923 - 1 March 2015) was a formidable mathematical
logician during a formative period when the subject was becoming
a sophisticated field at the crossing of mathematics and logic. Both with his
technical sophistication for his time and his dialectical engagement with mandates,
aspirations and goals, he inspired wide-ranging investigation in the metamathematics
of constructivity, proof theory and generalized recursion theory.
Kreisel's mathematics and interactions with colleagues and students have been
memorably described in Kreiseliana ([Odifreddi, 1996]). At a different level of
interpersonal conceptual interaction, Kreisel during his life time had extended
engagement with two celebrated logicians, the mathematical Kurt Gödel and
the philosophical Ludwig Wittgenstein. About Gödel, with modern mathematical
logic palpably emanating from his work, Kreisel has reflected and written
over a wide mathematical landscape. About Wittgenstein on the other hand,
with an early personal connection established Kreisel would return as if with
an anxiety of influence to their ways of thinking about logic and mathematics,
ever in a sort of dialectic interplay. In what follows we draw this out through
his published essaysâand one letterâboth to elicit aspects of influence in his
own terms and to set out a picture of Kreisel's evolving thinking about logic
and mathematics in comparative relief.Accepted manuscrip
Safe Recursion on Notation into a Light Logic by Levels
We embed Safe Recursion on Notation (SRN) into Light Affine Logic by Levels
(LALL), derived from the logic L4. LALL is an intuitionistic deductive system,
with a polynomial time cut elimination strategy.
The embedding allows to represent every term t of SRN as a family of proof
nets |t|^l in LALL. Every proof net |t|^l in the family simulates t on
arguments whose bit length is bounded by the integer l. The embedding is based
on two crucial features. One is the recursive type in LALL that encodes Scott
binary numerals, i.e. Scott words, as proof nets. Scott words represent the
arguments of t in place of the more standard Church binary numerals. Also, the
embedding exploits the "fuzzy" borders of paragraph boxes that LALL inherits
from L4 to "freely" duplicate the arguments, especially the safe ones, of t.
Finally, the type of |t|^l depends on the number of composition and recursion
schemes used to define t, namely the structural complexity of t. Moreover, the
size of |t|^l is a polynomial in l, whose degree depends on the structural
complexity of t.
So, this work makes closer both the predicative recursive theoretic
principles SRN relies on, and the proof theoretic one, called /stratification/,
at the base of Light Linear Logic
Polyamory, Gender, and Sexuality
A newsletter style analysis of the contemporary mechanisms of polyamory in the U.S. This project briefly discusses polyamory in relation to gender and sexuality, relates larger systems of power to the functions of polyamory, questions the taboos of polyamory, and briefly addresses some of the limitations of academic research regarding polyamory.https://digitalcommons.tacoma.uw.edu/gender_studies/1090/thumbnail.jp
- âŠ