منابع مشابه
Condensed Unpredictability
We consider the task of deriving a key with high HILL entropy (i.e., being computationally indistinguishable from a key with high min-entropy) from an unpredictable source. Previous to this work, the only known way to transform unpredictability into a key that was indistinguishable from having min-entropy was via pseudorandomness, for example by Goldreich-Levin (GL) hardcore bits. This approach...
متن کاملFundamental sources of unpredictability
In discussing the fundamental sources of unpredictability, I shall concentrate on those indeterminacies that are definitely required by theory. Let me therefore begin by eliminating from consideration supposed indeterminacies stemming from doubts that some people may entertain about basic principles or from certain kinds of ignorance that I believe to be temporary and likely to be remedied in t...
متن کاملRandomness Is Unpredictability
The concept of randomness has been unjustly neglected in recent philosophical literature, and when philosophers have thought about it, they have usually acquiesced in views about the concept that are fundamentally flawed. After indicating the ways in which these accounts are flawed, I propose that randomness is to be understood as a special case of the epistemic concept of the unpredictability ...
متن کاملUnpredictability of internal
Current observations from a shelf sea, continental slopes and the abyssal North-East Atlantic Ocean are all dominated by the semidiurnal lunar (M2) tide. It is shown that motions at M2 vary at usually large barotropic and coherent baroclinic scales, >50 km horizontally and >0.5 H vertically. H represents the waterdepth. Such M2-scales are observed even close to topography, the potential source ...
متن کاملUnpredictability and Computational Irreducibility
We explore several concepts for analyzing the intuitive notion of computational irreducibility and we propose a robust formal definition, first in the field of cellular automata and then in the general field of any computable function f from N to N. We prove that, through a robust definition of what means "to be unable to compute the n th step without having to follow the same path than simulat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 2005
ISSN: 0028-0836,1476-4687
DOI: 10.1038/4341073a