Results for 'Kohtaro Tadaki'

4 found
Order:
  1.  29
    An extension of Chaitin's halting probability Ω to a measurement operator in an infinite dimensional quantum system.Kohtaro Tadaki - 2006 - Mathematical Logic Quarterly 52 (5):419-438.
    This paper proposes an extension of Chaitin's halting probability Ω to a measurement operator in an infinite dimensional quantum system. Chaitin's Ω is defined as the probability that the universal self-delimiting Turing machine U halts, and plays a central role in the development of algorithmic information theory. In the theory, there are two equivalent ways to define the program-size complexity H of a given finite binary string s. In the standard way, H is defined as the length of the shortest (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  2.  19
    Fixed point theorems on partial randomness.Kohtaro Tadaki - 2012 - Annals of Pure and Applied Logic 163 (7):763-774.
  3.  10
    Building on Spash's critiques of monetary valuation to suggest ways forward for relational values research.Rachelle K. Gould, Austin Himes, Lea May Anderson, Paola Arias Arévalo, Mollie Chapman, Dominic Lenzi, Barbara Muraca & Marc Tadaki - 2024 - Environmental Values 33 (2):139-162.
    Scholars have critiqued mainstream economic approaches to environmental valuation for decades. These critiques have intensified with the increased prominence of environmental valuation in decision-making. This paper has three goals. First, we summarise prominent critiques of monetary valuation, drawing mostly on the work of Clive Spash, who worked extensively on cost–benefit analysis early in his career and then became one of monetary valuation's most thorough and ardent critics. Second, we, as a group of scholars who study relational values, describe how relational (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  4.  15
    On partial randomness.Cristian S. Calude, Ludwig Staiger & Sebastiaan A. Terwijn - 2006 - Annals of Pure and Applied Logic 138 (1):20-30.
    If is a random sequence, then the sequence is clearly not random; however, seems to be “about half random”. L. Staiger [Kolmogorov complexity and Hausdorff dimension, Inform. and Comput. 103 159–194 and A tight upper bound on Kolmogorov complexity and uniformly optimal prediction, Theory Comput. Syst. 31 215–229] and K. Tadaki [A generalisation of Chaitin’s halting probability Ω and halting self-similar sets, Hokkaido Math. J. 31 219–253] have studied the degree of randomness of sequences or reals by measuring their (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations