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 119 for “"Recursion"”.
-
Prosody and recursion
This thesis proposes a recursive mapping of syntactic derivations to prosodic representations. I argue that the prosody of an expression, just like its meaning, is determined compositionally, as originally proposed in Chomsky et al. (1957), Chomsky and Halle (1968). Syntactic structure are …
-
From Simplest Recursion to the Recursion of Generalizations of Cross Polytope Numbers
<p>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 …
-
Categories in recursion theory,
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1971.
-
Recursion on inadmissible ordinals
Thesis. 1976. Ph.D.--Massachusetts Institute of Technology. Dept. of Mathematics.
-
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 …
-
Contributions to higher recursion theory
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1993.
-
Admissible ordinals and recursion theory,
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1971.
-
Automated termination proofs using Walther recursion
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1994.
-
Initial segments in ordinal recursion theory.
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 1979
-
Priority arguments in α-recursion theory,
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1972.
-
An Investigation of a Game Generator Tool to Teach Recursion
… difficult, in particular, learning the topic of recursion. Serious games have shown much promise in education, including in the teaching of programming. However, the adoption rate in mainstream teaching still remains low. One reason given for this is the lack of game authoring tools to support …
-
The dead room : reflexivity, recursion and memory in the act of autobiographical scriptwriting
During the course of this practice-based PhD I intend to explore the themes of family, memory and time by researching and writing a feature-length screenplay that will draw on research into autobiographical scriptwriting, establishing a direct and substantive dialogue between my own practice and …
-
Modeling Recursion with Iteration: Enabling LLVM Loop Optimizations for Recursive Data Structure Traversal
… for compiler transformations that bridge recursion and iteration, paving the way for future systems that better optimize real-world recursive code without sacrificing clarity or maintainability.
-
Contributions to recursion theory on higher types (or, a proof of Harrington's conjecture),
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1973.
-
An investigation of a manipulative simulation in the learning of recursive programming
<p>Recursion is a fundamentally important topic in Computer Sciences; Even so, it is often omitted in introductory courses, or discussed only briefly. This is likely due, at least in part, to the fact that teaching recursion has been difficult. Perhaps the biggest problem in teaching recursion is …
-
On Counting Substructures with Graph Neural Networks
… into a number of subgraphs (which we call the recursion step), and then the collection of subgraphs is encoded by several iterative pooling steps. While recently proposed higher-order networks show a remarkable increase in the expressive power through a single recursion on larger neighborhoods …
-
Gromov Witten Invariants of Blow Ups of P² using Logarithmic Geometry
We show that Parker’s recursion for computing Gromov-Witten invariants of blow ups of P² can be derived using logarithmic Gromov-Witten theory and punctured maps. We extend the recursion to compute Gromov-Witten invariants with Hodge class insertions.
Page 1 of 6