Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

JSYML
2000

favoriteEmaildiscussreport

56views more JSYML 2000»

Computability over The Partial Continuous Functionals

13 years 5 months ago

Computability over The Partial Continuous Functionals

Download www.math.uio.no

We show that to every recursive total continuous functional there is a representative of in the hierearchy of partial continuous functionals such that is S1 - S9 computable over the hierarchy of partial continuous functionals. Equivalently, the representative will be PCF-definable over the partial continuous functionals, where PCF is Plotkin's programming language for computable functionals.

Dag Normann

Real-time Traffic

Continuous Functionals | JSYML 2000 | Partial Continuous Functionals | Recursive Total |

claim paper

Related Content

» Partial Continuous Functions and Admissible Domain Representations

» Continuous monitoring of topk queries over sliding windows

» Subrecursive functions on partial sequences

» Dynamic topological logics over spaces with continuous functions

» Timevarying reeb graphs for continuous spacetime data

» Rational approximation to the FermiDirac function with applications in density functional ...

» A Network Model of Analogue Computation over Metric Algebras

» Winning back the CUP for distributed POMDPs planning over continuous belief spaces

» Existence of Cascade DiscreteContinuous State Estimators for Systems on a Partial Order

Post Info
More Details (n/a)

Added	19 Dec 2010
Updated	19 Dec 2010
Type	Journal
Year	2000
Where	JSYML
Authors	Dag Normann

Comments (0)