Citation Link: https://nbn-resolving.org/urn:nbn:de:hbz:467-2894

Recursion and subrecursion over finite and infinite words with applications to computable real valued functions

Publication Type
Doctoral Thesis
Author(s)
Schulz, Holger 
Institute
Subjects
computability
recursion
real valued functions
DDC
510 Mathematik
GHBS-Clases
Date Issued
2006
Abstract
A recursion scheme for functions on intervals to approximate real-valued functions is described and compared with recursion schemes on finite and infinite words.
URN
URI
License
File(s)
Loading...
Thumbnail Image
Download
Name

schulz.pdf

Size

1.49 MB

Format

Adobe PDF

Checksum

(MD5):d7c7884ba53a14094fa3f0d61ae8c571

Owning collection
Theses and Dissertations