Results 1 
4 of
4
Semantics of Exact Real Arithmetic
, 1997
"... In this paper, we incorporate a representation of the nonnegative extended real numbers based on the composition of linear fractional transformations with nonnegative integer coefficients into the Programming Language for Computable Functions (PCF) with products. We present two models for the exten ..."
Abstract

Cited by 29 (8 self)
 Add to MetaCart
In this paper, we incorporate a representation of the nonnegative extended real numbers based on the composition of linear fractional transformations with nonnegative integer coefficients into the Programming Language for Computable Functions (PCF) with products. We present two models for the extended language and show that they are computationally adequate with respect to the operational semantics.
Streaming RepresentationChangers
 LNCS
, 2004
"... Unfolds generate data structures, and folds consume them. ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
Unfolds generate data structures, and folds consume them.
Part I Case for Support Computing with arbitrary precision curves
, 2004
"... Previous research track record and plans for the future The proposer has a longstanding interest in the theory and applications of computing with arbitrary precision (AP), which began with his PhD training (1996–2000) at the University of Birmingham under the supervision of Prof. Jung. PhD thesis. ..."
Abstract
 Add to MetaCart
Previous research track record and plans for the future The proposer has a longstanding interest in the theory and applications of computing with arbitrary precision (AP), which began with his PhD training (1996–2000) at the University of Birmingham under the supervision of Prof. Jung. PhD thesis. The thesis (Konečn´y 2000) built on the work of Wiedmer, Weihrauch, Edalat, Ko and others on representing real numbers as infinite streams of digits in an arbitrary precision computation. The thesis addressed, in this context, one of the first fundamental questions in computational complexity theory: Which realnumber functions can be computed to an arbitrary precision without an ever growing need for more memory? This question was answered for many different ways of representing the real numbers as infinite streams of symbols and for all reasonably wellbehaved functions (in some precise sense). This result is also described and proved in two journal articles (Konečn´y 2004, Konečn´y 2002), each for different types of realnumber representations. The thesis extends the articles in terms of the scope of representations and also generalises the theorem in another direction. It covers not only functions but also onetomany mappings. Such mappings arise naturally from the fact that each real number can be represented in many ways: for different representations of the same arguments different, but all correct results may be computed. More importantly, some frequently occurring practical problems, such as finding a zero of a polynomial, cannot be computed as a function but rather as a onetomany mapping. Work in Edinburgh. More recently, the proposer worked as a research fellow for the EPSRC funded project “Type