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 436 for “"Recursion"”.
-
Random recursion
We study the limiting behavior of three stochastic processes. Two are interacting particle systems, the frog model and coalescing random walk. We work out transience and recurrence properties on various graphs. The last is an interval splitting algorithm, which is shown to be equidistributed in the …
-
From Simplest Recursion to the Recursion of Generalizations of Cross Polytope Numbers
My research project involves investigations in the mathematical field of combinatorics. The research study will be based on the results of Professors Steven Edwards and William Griffiths, who recently found a new formula for the cross-polytope numbers. My topic will be focused on "Generalizations …
-
A Haskell Recursion Tutor
Recursion is not an easy subject to learn. In this thesis the literature is examined on the common difficulties and misconceptions students encounter when trying to understand recursion in the functional paradigm, and on the available tools for teaching and visualizing recursion. It is found that …
-
Enhancing Learning of Recursion
Recursion is one of the most important and hardest topics in lower division computer science courses. As it is an advanced programming skill, the best way to learn it is through targeted practice exercises. But the best practice problems are hard to grade. As a consequence, students experience only …
-
Topological Recursion, Deformations, and Interlacing
The theory of topological recursion has proven to be a powerful unifying force in the areas of enumerative geometry, integrability, matrix models, enumerative combinatorics, and mathematical physics more generally. As a “classical” example, using the Weingarten calculus for unitary groups, the …
-
Graphical Recursion for String Diagrams
… general, principled method for adding primitive recursion to graphical<br/>calculi for monoidal categories. The central idea is to treat diagrams with a designated<br/>hole as optics (a.k.a. combs), composed along a thin ladder of depth-indexed steps. We give<br/>two distinct but complementary …
-
TEACHERS' PEDACOGICAL CONTENT KNOWLEDGE OF RECURSION
… it comprehensible to others" (Shulman, 1986). Recursion is a process that permeates many aspects of the real world-both natural and man-made. In discrete mathernatics, recursion is a powerful idea, a problem solving strategy that enables us to describe or predict future results as a function of …
-
Farey Recursion and Hyperbolic Dehn Filling
In this work, we present a solution to William Thurston's edge gluing equations for Dehn fillings of hyperbolic 3-manifolds. This is done for triangulations that involve the layered solid torus. Our approach uses Farey recursive functions, and we present a Farey recursive function that provides a …
-
Farey Recursion and Hyperbolic Dehn Filling
In this work, we present a solution to William Thurston's edge gluing equations for Dehn fillings of hyperbolic 3-manifolds. This is done for triangulations that involve the layered solid torus. Our approach uses Farey recursive functions, and we present a Farey recursive function that provides a …
-
Automatically Introducing Tail Recursion in CakeML
In this thesis, we describe and implement an optimizing compiler transformation which turns non–tail-recursive functions into equivalent tail-recursive functions in an intermediate language of the CakeML compiler. CakeML is a strongly typed functional language based on Standard ML with …
-
On-Shell Recursion Relations in General Relativity
… of the validity and application of the on-shell recursion relations within the theory of General Relativity. These relations are also known as the Britto-Cachazo-Feng-Witten (BCFW) relations. They reduce the calculation of a tree-level graviton scattering amplitude into the evaluation of two …
-
Concrete sheaf models of higher-order recursion
… languages with higher-order functions and recursion. We give a general method for building such models and show how the method includes examples such as existing models of probabilistic and differentiable computation. Using our method, we build a new fully abstract sheaf model of …
-
Grätzer-Schmidt Theorem In Arithmetical Transfinite Recursion
… will be shown that the arithmetical transfinite recursion (ATR0) is sufficient to prove GS. Additionally, other variations of GS will be explored as well. Some will be proved in ACA0, while others will be shown equivalent to ATR0. We will also explore Birkhoff-Frink theorem (BF) as a closely …
-
Tail Recursion Modulo Cons Optimization in CakeML
In this project, the Tail Recursion Modulo Cons (TMC) optimization is implemented in the end-to-end verified CakeML compiler. The optimization makes tail recursive those functions which contain a recursive call nested inside one or more constructors. The TMC transformation is applied in the …
-
Non-perturbative topological recursion and knot invariants
… and com- putational aspects of the topological recursion formalism introduced by Eynard and Orantin. We develop efficient methods for the calculation of non-perturbative wave functions associated to spectral curves of genus one. Our results are used to test two conjectures. The first one relates …
-
Twisted Higgs Bundles, Topological Recursion, and Quantum Curves
… interplay between Higgs bundles and topological recursion. Our interests lie in the relationship between quantum curves and the quantization of Hitchin spectral curves, and also the relationship between Eynard-Orantin differentials and the geometry of the Hitchin moduli space. We give an overview …
-
Partial functions and recursion in univalent type theory
We investigate partial functions and computability theory from within a constructive, univalent type theory. The focus is on placing computability into a larger mathematical context, rather than on a complete development of computability theory. We begin with a treatment of partial functions, using …
-
On the semantics of intensionality and intensional recursion
… intensionality is the phenomenon of intensional recursion, which refers to the ability of a program to have access to its own code. In computability theory, intensional recursion is enabled by Kleene’s Second Recursion Theorem.</p> <p>This thesis is concerned with the crafting of a logical …
-
Classical Theorems in Reverse Mathematics and Higher Recursion Theory
… the view point of reverse mathematics and higher recursion theory. These classical theorems include the existence of a proper d-r.e. degree, Friedberg numbering and the Kechris-Woodin rank of everywhere differentiable functions.
-
Tree-Based Hardware Recursion for Divide-and-Conquer Algorithms
… traditional stack-based approaches to handling recursion in hardware make exploiting this parallelism difficult. This work proposes a new general-purpose approach to implementing recursive functions in hardware, which we call TreeRecur. TreeRecur uses trees to represent the branching recursive …
Page 1 of 22