Search results for 'Corrinne C. M. Lim' (try it on Scholar)

4 found
  1.  16
    Amanda R. Bolbecker, Zixi Cheng, Gary Felsten, King-Leung Kong, Corrinne C. M. Lim, Sheryl J. Nisly-Nagele, Lolin T. Wang-Bennett & Gerald S. Wasserman (2002). Two Asymmetries Governing Neural and Mental Timing. Consciousness and Cognition 11 (2):265-272.
    Mental timing studies may be influenced by powerful cognitive illusions that can produce an asymmetry in their rate of progress relative to neuronal timing studies. Both types of timing research are also governed by a temporal asymmetry, expressed by the fact that the direction of causation must follow time's arrow. Here we refresh our earlier suggestion that the temporal asymmetry offers promise as a means of timing mental activities. We update our earlier analysis of Libet's data within this framework. Then (...)
    Direct download (6 more)  
    Export citation  
    My bibliography   3 citations  
  2. P. A. Vargas, Y. Fernaeus, M. Y. Lim, S. Enz, W. C. Ho, M. Jacobsson & R. Aylett (forthcoming). Forgetting What Must Be Forgotten: Advocating an Ethical Memory Model for Artificial Companions. Special Issue of Ai and Society: Killer Robots or Friendly Fridges: The Social Understanding of Artificial Intelligence.
    Export citation  
    My bibliography  
  3.  3
    Jakob Kellner & Saharon Shelah (2009). Decisive Creatures and Large Continuum. Journal of Symbolic Logic 74 (1):73-104.
    For f, g $ \in \omega ^\omega $ let $c_{f,g}^\forall $ be the minimal number of uniform g-splitting trees (or: Slaloms) to cover the uniform f-splitting tree, i.e., for every branch v of the f-tree, one of the g-trees contains v. $c_{f,g}^\exists $ is the dual notion: For every branch v, one of the g-trees guesses v(m) infinitely often. It is consistent that $c_{f \in ,g \in }^\exists = c_{f \in ,g \in }^\forall = k_ \in $ for N₁ many (...)
    Direct download (5 more)  
    Export citation  
    My bibliography   1 citation  
  4. Liang Yu, Decheng Ding & Rodney Downey (2004). The Kolmogorov Complexity of Random Reals. Annals of Pure and Applied Logic 129 (1-3):163-180.
    We investigate the initial segment complexity of random reals. Let K denote prefix-free Kolmogorov complexity. A natural measure of the relative randomness of two reals α and β is to compare complexity K and K. It is well-known that a real α is 1-random iff there is a constant c such that for all n, Kn−c. We ask the question, what else can be said about the initial segment complexity of random reals. Thus, we study the fine behaviour of K (...)
    Direct download (3 more)  
    Export citation  
    My bibliography