μ-Recursion and infinite limits
نویسندگان
چکیده
منابع مشابه
Infinite Terms and Recursion in Higher Types
Systems of infinite terms defining functionals of finite type were first considered by Tait [10] and further developed by Feferman [3] initially in a proof-theoretic context. Later in unpublished notes Feferman introduced the system T of infinite o terms inductively generated from variables of all finite types and constants for the ordinary primitive recursive functions by application, abstract...
متن کاملAvoiding Infinite Recursion with Stratified Aspects
Infinite recursion is a known problem of aspect-oriented programming with AspectJ: if no special precautions are taken, aspects advising aspects can easily and unintentionally advise themselves. We present a compiler for an extension of the AspectJ programming language that avoids self reference by associating aspects with levels, and by automatically restricting the scope of pointcuts used by ...
متن کاملRecursion and Topology on 2≤ω for Possibly Infinite Computations
In the context of possibly infinite computations yielding finite or infinite (binary) outputs, the space 2≤ω = 2∗∪2ω appears to be one of the most fundamental spaces in Computer Science. Though underconsidered, next to 2, this space can be viewed (§3.5.2) as the simplest compact space native to computer science. In this paper we study some of its properties involving topology and computability....
متن کاملThe concept of free will as an infinite metatheoretic recursion
It is argued that the concept of free will, like the concept of truth in formal languages, requires a separation between an object level and a meta-level for being consistently defined. The Jamesian two-stage model, which deconstructs free will into the causally open “free” stage with its closure in the “will” stage, is implicitly a move in this direction. However, to avoid the dilemma of deter...
متن کاملInfinite Limits of Stochastic Graph Models - Draft
We present new generalized copying models for massive self-organizing networks such as the web graph, and analyze their limit behaviour. Our model is motivated by a desire to unify common design elements of the copying models of the web graph, and the partial duplication model for biological networks. In these models, new nodes copy (with some error) the link structure of existing nodes, and a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00744-2