Sökning: "recursion theory"

Visar resultat 1 - 5 av 20 avhandlingar innehållade orden recursion theory.

  1. 1. Designing Intranets for Viability Approaching Organizational Empowerment and Participation

    Detta är en avhandling från Umeå : Informatik

    Författare :Christina Amcoff Nyström; Mittuniversitetet.; Mittuniversitetet.; Umeå universitet.; [2006]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; SOCIAL SCIENCES Statistics; computer and systems science Informatics; computer and systems science; SAMHÄLLSVETENSKAP Statistik; data- och systemvetenskap Informatik; data- och systemvetenskap; Intranet design; Viable System Model; empowerment; democracy; autonomy; recursion; viability; participation; Computer Science; data- och systemvetenskap; Empowerment; Democracy; Autonomy; Recursion; Viability; Participation;

    Sammanfattning : Intranets appeared in the mid-1990s and were perceived as the answer to the need for the integration of existing Information Systems into organisations. Despite the fact that there has been extensive research regarding implementation, development processes, policies standardisation vs. LÄS MER

  2. 2. Metamathematical fixed points

    Detta är en avhandling från Göteborg : University of Gothenburg

    Författare :Rasmus Blanck; Göteborgs universitet.; Gothenburg University.; [2011]
    Nyckelord :HUMANIORA; HUMANITIES; arithmetised metamathematics; fixed point; recursion theory;

    Sammanfattning : This thesis concerns the concept of metamathematical fixed points. After an introduction, we survey the field of metamathematics, from la fin du siècle to present. We are especially interested in the notion of fixed points, theorems on the existence of various kinds of fixed points, and their applications to metamathematics. LÄS MER

  3. 3. Guarded Recursive Types in Type Theory

    Detta är en avhandling från Göteborg : University of Gothenburg

    Författare :Andrea Vezzosi; [2015]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; sized types; induction; coinduction; type theory; totality; guarded types; Agda;

    Sammanfattning : In total functional (co)programming valid programs are guaranteed to always produce (part of) their output in a finite number of steps.Enforcing this property while not sacrificing expressivity has beenchallenging. LÄS MER

  4. 4. Multiplet bases, recursion relations and full color parton showers

    Detta är en avhandling från Lund University, Faculty of Science, Department of Astronomy and Theoretical Physics

    Författare :Johan Thorén; Lund University.; Lunds universitet.; [2018-09]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; QCD; Multiplet Bases; SU Nc ; SU N ; Recursion Relations; BCFW; Nc=3 Parton Showers; Parton Showers;

    Sammanfattning : The papers in this thesis all concern the treatment of colors in perturbative QCD, both in the context of hard scattering cross sections and for parton showers. The complexity of the color structure of QCD increases quickly with the number of external partons. LÄS MER

  5. 5. On Induction, Coinduction and Equality in Martin-Löf and Homotopy Type Theory

    Detta är en avhandling från ; Chalmers tekniska högskola; Gothenburg

    Författare :Andrea Vezzosi; [2018]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Conversion; Parametricity; Higher Inductive Types; Sized Types; Dependent Types; Type Theory; Guarded Types;

    Sammanfattning : Martin Löf Type Theory, having put computation at the center of logical reasoning, has been shown to be an effective foundation for proof assistants, with applications both in computer science and constructive mathematics. One ambition though is for MLTT to also double as a practical general purpose programming language. LÄS MER