Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 35 for “"Computable functions"”.

  1. A topological and domain theoretical study of total computable functions

    Topologically the set of total computable functions has been studied only as a subspace of a Baire space. Where the topology of this Baire space is the induced topology of a Scott topology for the partial functions (not necessarily computable). In this thesis a novel topology on the index set of …

    brazil-ufrn Repository record for A topological and domain theoretical study of total computable functions (opens in a new tab)

  2. Random Variable Spaces: Mathematical Properties and an Extension to Programming Computable Functions

    … aims to extend the boundaries of Programming Computable Functions (PCF) by introducing a novel collection of categories referred to as Random Variable Spaces. Originating as a generalization of Quasi-Borel Spaces, Random Variable Spaces are rigorously defined as categories where objects are …

    chapman Repository record for Random Variable Spaces: Mathematical Properties and an Extension to Programming Computable Functions (opens in a new tab)

  3. Aspects of Recursion Theory in Arithmetical Theories and Categories

    Traditional recursion theory is the study of computable functions on the natural numbers. This thesis considers recursion theory in first-order arithmetical theories and categories, thus expanding the work of Ritchie and Young, Lambek, Scott, and Hofstra. We give a complete characterisation of the …

    ottawa-retro Repository record for Aspects of Recursion Theory in Arithmetical Theories and Categories (opens in a new tab)

  4. Investigating Structure in Turing Categories

    The concept of a computable function is quite a well-studied one, however, it is possible to capture certain important properties of computability categorically. A special type of category used for this purpose is called a Turing category. This thesis starts with a brief overview of Turing …

    ottawa-retro Repository record for Investigating Structure in Turing Categories (opens in a new tab)

  5. On Definability and Normalization by Evaluation in the Logical Framework

    … -calculus characterises exactly the Turing-computable functions. This thesis gives a characterisation of LF-definability—definability in a variant of the Edinburgh Logical Framework—in terms of a notion of Kripke predicates. The constructions in this thesis are heavily inspired by, and …

    chalmers Repository record for On Definability and Normalization by Evaluation in the Logical Framework (opens in a new tab)

  6. Complexity in artificial life

    … self-replicates under perturbation and computes functions (``phenotype''). By defining a merit function over the computable functions, differential reproductive success is applied to the populations, such that they evolve to the implicit fitness landscape. Evolutionary complexity in an evolving …

    nus Repository record for Complexity in artificial life (opens in a new tab) Download file for Complexity in artificial life (opens in a new tab)

  7. Witness Functions in Program Analysis and Complexity Theory

    … the computational properties of such witness functions and discuss their implications. In program analysis theory, we prove that a large class of undecidable program analysis problems have computable witness functions, including every semantic property described in Rice's theorem. This implies …

    gatech Repository record for Witness Functions in Program Analysis and Complexity Theory (opens in a new tab)

  8. Tractable cognition : complexity theory in cognitive psychology

    … the Tractable Cognition thesis: only tractably computable functions describe cognitive systems. This dissertation considers two possible formalizations of the Tractable Cognition thesis. The first, called the P-Cognition thesis, defines tractability as polynomial-time computability and is the …

    uvic Repository record for Tractable cognition : complexity theory in cognitive psychology (opens in a new tab)

  9. Quality economics in total quality control.

    … It also offers a set of simplified and computable functions to be applied in quality control practices.

    wvu Repository record for Quality economics in total quality control. (opens in a new tab)

  10. An analysis of conjunctive-goal planning

    This thesis develops a formal theory of planning, using a simple paradigm of planning that has been previously explored in work such as GPS, HACKER, STRIPS and NOAH. This thesis analyzes the goal interactions that occur when the goal is stated as a conjunction of sub-goals. In this analysis we …

    vt Repository record for An analysis of conjunctive-goal planning (opens in a new tab)

  11. Mechanizing the metatheory of ReWire

    … the concept of effective computability, for all computable functions are definable in the untyped [lambda]-calculus, making it expressively equivalent to recursive functions. In software, the expressiveness of functional languages is considered a strength. Functional approaches to language …

    missouri Repository record for Mechanizing the metatheory of ReWire (opens in a new tab)

  12. Language-based Lifting of Analyses to Software Product Lines

    … Datalog, and an extended version of Programming Computable Functions (PCF). Datalog combines relational data definition and manipulation, together with logical inference. It has been used to implement different categories of declarative, succinct, and easy to understand software analyses. We …

    toronto-retro Repository record for Language-based Lifting of Analyses to Software Product Lines (opens in a new tab)

  13. Coding Schemes for Physical Layer Network Coding Over a Two-Way Relay Channel

    … computation (or, decoding) of a class of functions at the relay. The function to be decoded is chosen at the relay depending on the channel realization. We define such a class of reliably computable functions for the proposed coding scheme and derive rates that are universally achievable …

    tamu Repository record for Coding Schemes for Physical Layer Network Coding Over a Two-Way Relay Channel (opens in a new tab)

  14. REPROGRAMMABLE THRESHOLD LOGIC GATES BASED ON RANDOM NANOSTRUCTURED NETWORKS FOR ALGEBRAIC AND LOGIC BOOLEAN COMPUTATION

    … weighting mechanism to widen the spectrum of TL-computable functions. We have shown that thanks to nonlinearity a Receptrons can implement any Boolean function, and due to the multitude of possible configurations, can rely on a random exploration of weights’ space for an efficient generation of …

    milano Repository record for REPROGRAMMABLE THRESHOLD LOGIC GATES BASED ON RANDOM NANOSTRUCTURED NETWORKS FOR ALGEBRAIC AND LOGIC BOOLEAN COMPUTATION (opens in a new tab)

Page 1 of 2