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 77 for “"Recursive functions"”.

  1. Parallel processing of recursive functions

    Algorithms define} as recursive functions, such as in "pure" LISP, are shown to have structure sufficient to distinguish between processes which must be executed in sequence and processes which may be executed in parallel. An interpreter program is presented for executing LISP programs and …

    nps Repository record for Parallel processing of recursive functions (opens in a new tab)

  2. Recursive functions and finite automata

    Thesis (Ph.D.)--Michigan State University of Agriculture and Applied Science. Department of Electrical Engineering, 1960

    msu Repository record for Recursive functions and finite automata (opens in a new tab)

  3. ALGEBRAIC PROPERTIES OF FAREY RECURSIVE FUNCTIONS

    … by an edge exactly when |ps - qr| = 1. A Farey recursive function assigns values in a commutative ring to these vertices so that, along any line formed by edges in the diagram, the values satisfy a second-order linear recurrence. Although these functions arise naturally in hyperbolic geometry, …

    montana Repository record for ALGEBRAIC PROPERTIES OF FAREY RECURSIVE FUNCTIONS (opens in a new tab)

  4. ALGEBRAIC PROPERTIES OF FAREY RECURSIVE FUNCTIONS

    … by an edge exactly when |ps - qr| = 1. A Farey recursive function assigns values in a commutative ring to these vertices so that, along any line formed by edges in the diagram, the values satisfy a second-order linear recurrence. Although these functions arise naturally in hyperbolic geometry, …

    montana-tech Repository record for ALGEBRAIC PROPERTIES OF FAREY RECURSIVE FUNCTIONS (opens in a new tab)

  5. Mapping recursive functions to reconfigurable hardware

    … available between successive iterations of a recursive function. This squanders the high amount of parallelism provided by the resources on the FPGA thus reducing the performance of the recursive algorithm. This thesis presents a method to address the lack of support for recursion in design …

    unsw Repository record for Mapping recursive functions to reconfigurable hardware (opens in a new tab)

  6. On the formal specification of recursive functions

    Thesis (Ph. D.)--Michigan State University. Department of Computer Science, 1995

    msu Repository record for On the formal specification of recursive functions (opens in a new tab)

  7. Sets, Models, And Proofs: Topics In The Theory Of Recursive Functions

    SETS, MODELS, AND PROOFS: TOPICS IN THE THEORY OF RECURSIVE FUNCTIONS David Roger Belanger, Ph.D. Cornell University We prove results in various areas of recursion theory. First, in joint work with Richard Shore, we prove a new jump-inversion result for ideals of recursively enumerable (r.e.) …

    cornell Repository record for Sets, Models, And Proofs: Topics In The Theory Of Recursive Functions (opens in a new tab)

  8. Weak Truth Table Reducibility and the Pointwise Ordering of 1-1 Recursive Functions

    Made available in DSpace on 2014-12-14T13:09:24Z (GMT). No. of bitstreams: 1 7524283.pdf: 1603476 bytes, checksum: 566bca7e7eb5532f6c9beb67369f5c0b (MD5) Previous issue date: 1975

    uiuc Repository record for Weak Truth Table Reducibility and the Pointwise Ordering of 1-1 Recursive Functions (opens in a new tab)

  9. Evaluation of a new recursion induction principle for automated induction

    … is a powerful tool for proving properties of functions with recursive structure, but it is useless when the functions do not preserve the structure of the input. Many of today’s cutting-edge automated theorem provers use structural induction, which makes it impossible for them to prove …

    chalmers Repository record for Evaluation of a new recursion induction principle for automated induction (opens in a new tab)

  10. Variants of Partial Learning in Inductive Inference

    … learning. Consistent partial learning of recursive functions is classifi ed according to the mode of data presentation; the two main types of data texts considered are canonical text and arbitrary text. The issue of consistent partial learning from incomplete texts is also given a brief …

    nus Repository record for Variants of Partial Learning in Inductive Inference (opens in a new tab) Download file for Variants of Partial Learning in Inductive Inference (opens in a new tab)

  11. Automatically Introducing Tail Recursion in CakeML

    … 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 call-by-value semantics and a fully verified compiler. We …

    chalmers Repository record for Automatically Introducing Tail Recursion in CakeML (opens in a new tab)

  12. Towards Scalable Fully Automatic Program Verification

    … of programs manipulating user defined recursive datatypes like lists and trees. The invariants of such programs typically require recursive functions as well. This domain is particularly hard for CHC solvers because the presence of recursive functions make even validating solutions to …

    waterloo Repository record for Towards Scalable Fully Automatic Program Verification (opens in a new tab)

  13. Polynomial-time Martin-Lof type theory

    … a natural model of which is the class of partial recursive functions. In conclusion, an example in group theory is considered.

    uiuc Repository record for Polynomial-time Martin-Lof type theory (opens in a new tab)

  14. Compiler-assisted workload consolidation to efficiently exploit dynamic parallelism for recursive applications

    … (DP), which enables the initiation of GPU functions from inside a GPU function. This makes the nested parallelism easy to be explored on GPU since one can program in a way that a new GPU function can be launched whenever a local nested parallelism is met during the execution. What is more, …

    missouri Repository record for Compiler-assisted workload consolidation to efficiently exploit dynamic parallelism for recursive applications (opens in a new tab)

  15. Modal logics of provability

    … for any theory 'strong' enough to represent recursive functions. In the process he showed that the provability predicate can be represented in such theories. Modal logics of provability are modal logics which attempt to express the concept of 'provability' and 'consistency' using the modal …

    vt Repository record for Modal logics of provability (opens in a new tab)

  16. Formalus Elixir standartinės bibliotekos verifikavimas TLA+ kalba /

    … of the given Elixir function, including recursive algorithms. This is achieved by creating a template for TLA+ to specify recursive functions using stack memory, which could represent the execution of various Elixir functions based on the information gained from the given functions …

    vilnius Repository record for Formalus Elixir standartinės bibliotekos verifikavimas TLA+ kalba / (opens in a new tab)

  17. Elements Of Classical Recursion Theory: Degree-Theoretic Properties And Combinatorial Properties

    … is to build a strong connection between array nonrecursive degrees and relatively recursively enumerable degrees. The former is a combinatorial property and the latter is a degree-theoretic one. We prove that a degree is array nonrecursive if and only if every degree above it is relatively …

    cornell Repository record for Elements Of Classical Recursion Theory: Degree-Theoretic Properties And Combinatorial Properties (opens in a new tab)

Page 1 of 4