•  11
    Some Consequences of And
    with Yinhe Peng and W. U. Liuzhen
    Journal of Symbolic Logic 88 (4): 1573-1589. 2023.
    Strong Turing Determinacy, or ${\mathrm {sTD}}$, is the statement that for every set A of reals, if $\forall x\exists y\geq _T x (y\in A)$, then there is a pointed set $P\subseteq A$. We prove the following consequences of Turing Determinacy ( ${\mathrm {TD}}$ ) and ${\mathrm {sTD}}$ over ${\mathrm {ZF}}$ —the Zermelo–Fraenkel axiomatic set theory without the Axiom of Choice: (1) ${\mathrm {ZF}}+{\mathrm {TD}}$ implies $\mathrm {wDC}_{\mathbb {R}}$ —a weaker version of $\mathrm {DC}_{\mathbb {R}…Read more
  •  2
    Proceedings of the 14th and 15th Asian Logic Conferences (edited book)
    with Byunghan Kim, Jörg Brendle, Gyesik Lee, Fenrong Liu, R. Ramanujam, Shashi M. Srivastava, and Akito Tsuboi
    World Scientific Publishing Company. 2019.
    The Asian Logic Conference (ALC) is a major international event in mathematical logic. It features the latest scientific developments in the fields of mathematical logic and its applications, logic in computer science, and philosophical logic. The ALC series also aims to promote mathematical logic in the Asia-Pacific region and to bring logicians together both from within Asia and elsewhere for an exchange of information and ideas. This combined proceedings volume represents works presented or a…Read more
  •  52
    Bounding non- GL ₂ and R.E.A
    with Klaus Ambos-Spies, Decheng Ding, and Wei Wang
    Journal of Symbolic Logic 74 (3): 989-1000. 2009.
    We prove that every Turing degree a bounding some non-GL₂ degree is recursively enumerable in and above (r.e.a.) some 1-generic degree
  •  38
    The Increased Sex Differences in Susceptibility to Emotional Stimuli during Adolescence: An Event-Related Potential Study
    with Jiemin Yang, Shu Zhang, Yixue Lou, Quanshan Long, Shixue Xie, and Jiajin Yuan
    Frontiers in Human Neuroscience 11. 2018.
  •  34
    A novel data-driven model-free adaptive control approach is first proposed by combining the advantages of model-free adaptive control and data-driven optimal iterative learning control, and then its stability and convergence analysis is given to prove algorithm stability and asymptotical convergence of tracking error. Besides, the parameters of presented approach are adaptively adjusted with fuzzy logic to determine the occupied proportions of MFAC and DDOILC according to their different control…Read more
  •  6
    Machine learning algorithms now sweep the world to train machines to learn and make decisions similar to a human. These algorithms provide recommendations and sometimes make judgments on a human’s behalf. However, machine learning creates a disconnect between the intention of human beings and the results of machine learning algorithms, which is defined as the alignment problem. This chapter aims to establish what is required for future leaders to address the alignment problem and the related eth…Read more
  •  2
    Conference on Computability, Complexity and Randomness
    with Jinhe Chen and Decheng Ding
    Bulletin of Symbolic Logic 14 (4): 548-549. 2008.
  •  8
    Luzin’s (n) and randomness reflection
    with Arno Pauly and Linda Westrick
    Journal of Symbolic Logic 87 (2): 802-828. 2022.
    We show that a computable function $f:\mathbb R\rightarrow \mathbb R$ has Luzin’s property if and only if it reflects $\Pi ^1_1$ -randomness, if and only if it reflects $\Delta ^1_1$ -randomness, and if and only if it reflects ${\mathcal {O}}$ -Kurtz randomness, but reflecting Martin–Löf randomness or weak-2-randomness does not suffice. Here a function f is said to reflect a randomness notion R if whenever $f$ is R-random, then x is R-random as well. If additionally f is known to have bounded va…Read more
  •  11
    Gray Matter Volume and Functional Connectivity in Hypochondriasis: A Magnetic Resonance Imaging and Support Vector Machine Analysis
    with Zhe Shen, Zhiyong Zhao, Kangyu Jin, Fen Pan, Shaohua Hu, Shangda Li, Yi Xu, Dongrong Xu, and Manli Huang
    Frontiers in Human Neuroscience 14. 2020.
    Objective: Patients with hypochondriasis hold unexplainable beliefs and a fear of having a lethal disease, with poor compliances and treatment response to psychotropic drugs. Although several studies have demonstrated that patients with hypochondriasis demonstrate abnormalities in brain structure and function, gray matter volume and functional connectivity in hypochondriasis still remain unclear.Methods: The present study collected T1-weighted and resting-state functional magnetic resonance imag…Read more
  •  7
    Psychiatric document retrieval using a discourse-aware model
    with Chung-Hsien Wu and Fong-Lin Jang
    Artificial Intelligence 173 (7-8): 817-829. 2009.
  •  14
    Luzin’s (n) and randomness reflection
    with Arno Pauly and Linda Westrick
    Journal of Symbolic Logic 1-27. 2020.
    We show that a computable function $f:\mathbb R\rightarrow \mathbb R$ has Luzin’s property if and only if it reflects $\Pi ^1_1$ -randomness, if and only if it reflects $\Delta ^1_1$ -randomness, and if and only if it reflects ${\mathcal {O}}$ -Kurtz randomness, but reflecting Martin–Löf randomness or weak-2-randomness does not suffice. Here a function f is said to reflect a randomness notion R if whenever $f$ is R-random, then x is R-random as well. If additionally f is known to have bounded va…Read more
  •  12
    An application of recursion theory to analysis
    Bulletin of Symbolic Logic 26 (1): 15-25. 2020.
    Mauldin [15] proved that there is an analytic set, which cannot be represented by $B\cup X$ for some Borel set B and a subset X of a $\boldsymbol{\Sigma }^0_2$ -null set, answering a question by Johnson [10]. We reprove Mauldin’s answer by a recursion-theoretical method. We also give a characterization of the Borel generated $\sigma $ -ideals having approximation property under the assumption that every real is constructible, answering Mauldin’s question raised in [15].
  •  13
    What “Tears” Remind Us of: An Investigation of Embodied Cognition and Schizotypal Personality Trait Using Pencil and Teardrop Glasses
    with Kazuma Shimokawa, Shigeo Yoshida, and Eriko Sugimori
    Frontiers in Psychology 10 462408. 2020.
    Facial expressions influence our experience and perception of emotions—they not only tell other people what we are feeling but also might tell us what to feel via sensory feedback. We conducted three experiments to investigate the interaction between facial feedback phenomena and different environmental stimuli, by asking participants to remember emotional autobiographical memories. Moreover, we examined how people with schizotypal traits would be affected by their experience of emotional facial…Read more
  •  9
    Chaitin’s ω as a continuous function
    with Rupert Hölzl, Wolfgang Merkle, Joseph Miller, and Frank Stephan
    Journal of Symbolic Logic 85 (1): 486-510. 2020.
    We prove that the continuous function${\rm{\hat \Omega }}:2^\omega \to $ that is defined via$X \mapsto \mathop \sum \limits_n 2^{ - K\left} $ for all $X \in {2^\omega }$ is differentiable exactly at the Martin-Löf random reals with the derivative having value 0; that it is nowhere monotonic; and that $\mathop \smallint \nolimits _0^1{\rm{\hat{\Omega }}}\left\,{\rm{d}}X$ is a left-c.e. $wtt$-complete real having effective Hausdorff dimension ${1 / 2}$.We further investigate the algorithmic proper…Read more
  •  15
    Being low along a sequence and elsewhere
    with Wolfgang Merkle
    Journal of Symbolic Logic 84 (2): 497-516. 2019.
    Let an oracle be called low for prefix-free complexity on a set in case access to the oracle improves the prefix-free complexities of the members of the set at most by an additive constant. Let an oracle be called weakly low for prefix-free complexity on a set in case the oracle is low for prefix-free complexity on an infinite subset of the given set. Furthermore, let an oracle be called low and weakly for prefix-free complexity along a sequence in case the oracle is low and weakly low, respecti…Read more
  •  20
    Disruption of Cerebellar Prediction in Verbal Working Memory
    with Yi-Shin Sheu and John E. Desmond
    Frontiers in Human Neuroscience 13. 2019.
  •  22
    Basis theorems for -sets
    with Chi Tat Chong and Liuzhen Wu
    Journal of Symbolic Logic 84 (1): 376-387. 2019.
  •  6
    Eye-movement evidence of the time-course of attentional bias for threatening pictures in test-anxious students
    with Yunying Dong, Alain De Beuckelaer, and Renlai Zhou
    Cognition and Emotion 31 (4): 781-790. 2017.
  •  6
    On the definable ideal generated by nonbounding c.e. degrees
    with Yue Yang
    Journal of Symbolic Logic 70 (1): 252-270. 2005.
    Let [NB]1 denote the ideal generated by nonbounding c.e. degrees and NCup the ideal of noncuppable c.e. degrees. We show that both [NB]1 ∩ NCup and the ideal generated by nonbounding and noncuppable degrees are new, in the sense that they are different from M, [NB]1 and NCup—the only three known definable ideals so far.
  • There is no SW-complete c.e. real
    with Decheng Ding
    Journal of Symbolic Logic 69 (4): 1163-1170. 2004.
    We prove that there is no sw-complete c.e. real, negatively answering a question in [6].
  •  25
    Randomness in the higher setting
    with C. T. Chong
    Journal of Symbolic Logic 80 (4): 1131-1148. 2015.
  • This is among the last turn of the century one of the central figure in French culture: Bergson philosophy of life perspective, to interpret the same period of modern painting as part of research projects. The initial study was the author of "father of modern painting" plugs yet and the real comparative study between Bergson; then have follow-up, respectively, In order to explore the art of movement: Fauvism , stereo doctrine , Yun legal doctrine and the future doctrine theory of representative …Read more
  • Duchamp and Bergson-A Contrast Study
    Philosophy and Culture 37 (6): 127-153. 2010.
    This article is based on Bergson philosophy of life point of view, to interpret the same period of modern painting as part of research projects. The initial study was the author of "father of modern painting," Cézanne and the real comparative study between Bergson; then, have been discussed separately subsequent art movements: Fauvism, Cubism, rhythm, Futurism and the doctrine of representativeness of Ophelia in theory and creative artists in the philosophy of Bergson quality. This adjourned its…Read more
  •  10
    A Reducibility Related To Being Hyperimmune-free
    with Frank Stephan
    Annals of Pure and Applied Logic 165 (7-8): 1291-1300. 2014.
    The main topic of the present work is the relation that a set X is strongly hyperimmune-free relative to Y . Here X is strongly hyperimmune-free relative to Y if and only if for every partial X -recursive function p there is a partial Y -recursive function q such that every a in the domain of p is also in the domain of q and satisfies p
  •  33
    The Kolmogorov complexity of random reals
    with Decheng Ding and Rodney Downey
    Annals of Pure and Applied Logic 129 (1-3): 163-180. 2004.
    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 for random α. Following work of Downey, Hirschfeldt and L…Read more
  •  146
    Higher kurtz randomness
    with Bjørn Kjos-Hanssen, André Nies, and Frank Stephan
    Annals of Pure and Applied Logic 161 (10): 1280-1290. 2010.
    A real x is -Kurtz random if it is in no closed null set . We show that there is a cone of -Kurtz random hyperdegrees. We characterize lowness for -Kurtz randomness as being -dominated and -semi-traceable
  •  24
    Lowness for genericity
    Archive for Mathematical Logic 45 (2): 233-238. 2006.
    We study lowness for genericity. We show that there exists no Turing degree which is low for 1-genericity and all of computably traceable degrees are low for weak 1-genericity
  •  33
    Arithmetical Sacks Forcing
    with Rod Downey
    Archive for Mathematical Logic 45 (6): 715-720. 2006.
    We answer a question of Jockusch by constructing a hyperimmune-free minimal degree below a 1-generic one. To do this we introduce a new forcing notion called arithmetical Sacks forcing. Some other applications are presented
  •  49
    Maximal pairs of c.e. reals in the computably Lipschitz degrees
    with Yun Fan
    Annals of Pure and Applied Logic 162 (5): 357-366. 2011.
    Computably Lipschitz reducibility , was suggested as a measure of relative randomness. We say α≤clβ if α is Turing reducible to β with oracle use on x bounded by x+c. In this paper, we prove that for any non-computable real, there exists a c.e. real so that no c.e. real can cl-compute both of them. So every non-computable c.e. real is the half of a cl-maximal pair of c.e. reals