Aspects of Computable Analysis

About this item

Title

Aspects of Computable Analysis

Content partner

Victoria University of Wellington

Collection

VUW ResearchArchive

Description

Computable analysis has been well studied ever since Turing famously formalised the computable reals and computable real-valued function in 1936. However, analysis is a broad subject, and there still exist areas that have yet to be explored. For instance, Sierpinski proved that every real-valued function ƒ : ℝ → ℝ is the limit of a sequence of Darboux functions. This is an intriguing result, and the complexity of these sequences has been largely unstudied. Similarly, the Blaschke Selection Th...

Read more

Format

Research paper

Research format

Scholarly text / Thesis

Creator

Porter, Michelle

URL

http://researcharchive.vuw.ac.nz/handle/10063/5191

Related subjects

Computable analysis / Blaschke Selection Theorem / Computable real / Sierpinski / Darboux

What is the copyright status of this item?

All Rights Reserved

This item is all rights reserved, which means you'll have to get permission from Victoria University of Wellington before using it.

More Information

Victoria University of Wellington has this to say about the rights status of this item:

Author Retains All Rights

What can I do with this item?

You must always check with Victoria University of Wellington to confirm the specific terms of use, but this is our understanding:

Non-infringing use

NZ Copyright law does not prevent every use of a copyright work. You should consider what you can and cannot do with a copyright work.

No sharing

You may not copy and/or share this item with others without further permission. This includes posting it on your blog, using it in a presentation, or any other public use.

No modifying

You are not allowed to adapt or remix this item into any other works.

No commercial use

You may not use this item commercially.