Computability in Europe 2008
Logic and Theory of Algorithms

Print current page  Print this page

Regular Talk:
Probabilistic machines vs. relativized computation

Edit abstract data

Author(s): Hayato Takahashi and Kazuyuki Aihara
Slot: Fri, 11:20-11:40, Room 22 (col. 4)

Abstract

Computational power of probabilistic machines is studied.
In particular, we extend the classical result of K.~de Leeuw et al. (1956) to
various distributions then apply our result to analyze the computational power
of analog machines.

websites: Arnold Beckmann 2008-05-19 Valid HTML 4.01! Valid CSS!