Notions of Probabilistic Computability on Represented Spaces

dc.creatorBosserhoff,Volker
dc.date2008
dc.date.accessioned2024-02-06T12:56:22Z
dc.date.available2024-02-06T12:56:22Z
dc.descriptionWe define and compare several probabilistic notions of computability for mappings from represented spaces (that are equipped with a measure or outer measure) into computable metric spaces. We thereby generalize definitions by [Ko 1991] and Parker (see [Parker 2003, Parker 2005, Parker 2006]), and furthermore introduce the new notion of computability in the mean. Some results employ a notion of computable measure that originates in definitions by [Weihrauch 1999] and [Schröder 2007]. In the spirit of the well-known Representation Theorem (see [Weihrauch 2000]), we establish dependencies between the probabilistic computability notions and classical properties of mappings. We furthermore present various results on the computability of vector-valued integration, composition of mappings, and images of measures. Finally, we discuss certain measurability issues arising in connection with our definitions.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-014-06-0956
dc.identifierhttps://lib.jucs.org/article/29014/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/9671
dc.languageen
dc.publisherJournal of Universal Computer Science
dc.relationinfo:eu-repo/semantics/altIdentifier/eissn/0948-6968
dc.relationinfo:eu-repo/semantics/altIdentifier/pissn/0948-695X
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsJ.UCS License
dc.sourceJUCS - Journal of Universal Computer Science 14(6): 956-995
dc.subjectcomputable analysis
dc.subjectcomputable measures
dc.subjectprobabilistic computation
dc.titleNotions of Probabilistic Computability on Represented Spaces
dc.typeResearch Article
Файлы