Metric Structures and Probabilistic Computation

Details Metric Structures and Probabilistic Computation Metric Structures and Probabilistic Computation

2008-06-02

arxiv.org/abs/0806.0398v1

Mathematics

Logic

Scientific paper

Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable model theory is used to examine the algorithmic structure of mathematical objects that can be described in classical first-order logic. The present paper shows that probabilistic computation (sometimes called randomized computation) can play an analogous role for structures described in continuous first-order logic. The main result of this paper is an effective completeness theorem, showing that every decidable continuous first-order theory has a probabilistically decidable model. Later sections give examples of the application of this framework to various classes of structures, and to some problems of computational complexity theory.

Affiliated with

Also associated with

No associations

Rating

Metric Structures and Probabilistic Computation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Metric Structures and Probabilistic Computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Metric Structures and Probabilistic Computation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-194613