BOUNDS IN THE TURING REDUCIBILITY OF FUNCTIONS

A hierarchy of functions with respect to their role as bounds in the Turing reducibility of functions is introduced and studied. This hierarchy leads to a certain notion of incompressibility of sets which is also investigated.     

Programming in Polygon R&D: Explorations with a Spatial Language II

This paper introduces the language associated with a polygon microworld called PolygonR&D, which has the mathematical crispness of Logo and has the discreteness and simplicity of a Turing machine. In this microworld, polygons serve two purposes: as agents (similar to the turtles in Logo), and as data (landmarks in the plane). Programming the spatial behaviour of polygon agents is achieved by a simple variable-free language. Although limited in the number of instructions, the language allows for complex outcomes such as creation of sophisticated tilings, algorithm visualization, simulations, and even numerical computation. The ease of constructing the variety of examples shown in this paper indicates the microworld’s potential in both secondary and post-secondary education. An erratum to this article can be found at     

Spatiotemporal Dynamic Analysis in a Time-space Discrete Brusselator Mode

In this paper, we study the spatiotemporal patterns of a Brusselator model with discrete time-space by using the coupled mapping lattice (CML) model. The existence and stability conditions of the equilibrium point are obtained by using linear stability analysis. Then, applying the center manifold reduction theorem and the bifurcation theory, the parametric conditions of the flip and the Neimark-Sacker bifurcation are described respectively. Under space diffusion, the model admits the Turing instability at stable homogeneous solutions under some certain conditions. Two nonlinear mechanisms, including flip-Turing instability and Neimark-Sacker-Turing instability, are presented. Through numerical simulation, periodic windows, invariant circles, chaotic phenomenon and some interesting spatial patterns are found.     

Isomorphism of lattices of recursively enumerable sets

Let , and for , let be the lattice of subsets of which are recursively enumerable relative to the ``oracle' . Let be , where is the ideal of finite subsets of . It is established that for any , is effectively isomorphic to if and only if , where is the Turing jump of . A consequence is that if , then . A second consequence is that can be effectively embedded into preserving least and greatest elements if and only if .

     

耦合反应扩散体系中的超点阵斑图

采用双层耦合的布鲁塞尔(Brusselator)模型研究了超点阵斑图的形成机制.理论分析和数值模拟结果表明,只有在具有较短波长图灵模的系统中才能产生超点阵斑图.将不同类型的斑图进行耦合,得到了超六边形斑图和黑眼斑图等超点阵斑图.本工作还在反应扩散系统中首次得到了长方形斑图.     

Analysis of ratio-dependent food chain model

In this paper, a food chain model with ratio-dependent functional response is studied under homogeneous Neumann boundary conditions. The large time behavior of all non-negative equilibria in the time-dependent system is investigated, i.e., conditions for the stability at equilibria are found. Moreover, non-constant positive steady-states are studied in terms of diffusion effects, namely, Turing patterns arising from diffusion-driven instability (Turing instability) are demonstrated. The employed methods are comparison principle for parabolic problems and Leray-Schauder Theorem.     

Modulo computably enumerable degrees by cupping partners

Cupping partners of an element in an upper semilattice with a greatest element 1 are those joining the element to 1. We define a congruence relation on such an upper semilattice by considering the elements having the same cupping partners as equivalent. It is interesting that this congruence relation induces a non-dense quotient structure of computably enumerable Turing degrees. Another main interesting phenomenon in this article is that on the computably enumerable degrees, this relation is different from that modulo the noncuppable ideal, though they define a same equivalent class for the computable Turing degree.     

Distinguishing between evidence and its explanations in the steering of atomic clocks

Quantum theory reflects within itself a separation of evidence from explanations. This separation leads to a known proof that: (1) no wave function can be determined uniquely by evidence, and (2) any chosen wave function requires a guess reaching beyond logic to things unforeseeable. Chosen wave functions are encoded into computer-mediated feedback essential to atomic clocks, including clocks that step computers through their phases of computation and clocks in space vehicles that supply evidence of signal propagation explained by hypotheses of spacetimes with metric tensor fields.     

What is a universal computing machine?

A computer is classically formalised as a universal Turing machine or a similar device. However over the years a lot of research has focused on the computational properties of dynamical systems other than Turing machines, such cellular automata, artificial neural networks, mirrors systems, etc.In this paper we propose a unifying formalism derived from a generalisation of Turing’s arguments. Then we review some of universal systems proposed in the literature and show that are particular case of this formalism. Finally, we review some of the attempts to understand the relation between dynamical and computational properties of a system.     

Lattice-valued fuzzy Turing machines: Computing power, universality and efficiency

In this paper we study fuzzy Turing machines with membership degrees in distributive lattices, which we called them lattice-valued fuzzy Turing machines. First we give several formulations of lattice-valued fuzzy Turing machines, including in particular deterministic and non-deterministic lattice-valued fuzzy Turing machines (l-DTMcs and l-NTMs). We then show that l-DTMcs and l-NTMs are not equivalent as the acceptors of fuzzy languages. This contrasts sharply with classical Turing machines. Second, we show that lattice-valued fuzzy Turing machines can recognize n-r.e. sets in the sense of Bedregal and Figueira, the super-computing power of fuzzy Turing machines is established in the lattice-setting. Third, we show that the truth-valued lattice being finite is a necessary and sufficient condition for the existence of a universal lattice-valued fuzzy Turing machine. For an infinite distributive lattice with a compact metric, we also show that a universal fuzzy Turing machine exists in an approximate sense. This means, for any prescribed accuracy, there is a universal machine that can simulate any lattice-valued fuzzy Turing machine on it with the given accuracy. Finally, we introduce the notions of lattice-valued fuzzy polynomial time-bounded computation (lP) and lattice-valued non-deterministic fuzzy polynomial time-bounded computation (lNP), and investigate their connections with P and NP. We claim that lattice-valued fuzzy Turing machines are more efficient than classical Turing machines.