Help Wanted: A Modern-Day Turing
Here, the National Strategic Computing Initiative will inevitably produce new computer hardware, but what about software?
SEARCH · Search NASA
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Here, the National Strategic Computing Initiative will inevitably produce new computer hardware, but what about software?
A new approach is suggested to define and evaluate key metrics as to autonomous aerial vehicle performance. This approach entails the conceptual definition of a "Turing Test" for UAVs. Such a "UAV Turing test" would be conducted by means of mission simulations and/or tailored flight demonstrations of vehicles under the guidance of their autonomous system software. These autonomous vehicle mission simulations and flight demonstrations would also have to be benchmarked against missions "flown" with pilots/human-operators in the loop. In turn, scoring criteria for such testing could be based upon both quantitative mission success metrics (unique to each mission) and by turning to analog "handling quality" metrics similar to the well-known Cooper-Harper pilot ratings used for manned aircraft. Autonomous aerial vehicles would be considered to have successfully passed this "UAV Turing Test" if the aggregate mission success metrics and handling qualities for the autonomous aerial vehicle matched or exceeded the equivalent metrics for missions conducted with pilots/human-operators in the loop. Alternatively, an independent, knowledgeable observer could provide the "UAV Turing Test" ratings of whether a vehicle is autonomous or "piloted." This observer ideally would, in the more sophisticated mission simulations, also have the enhanced capability of being able to override the scripted mission scenario and instigate failure modes and change of flight profile/plans. If a majority of mission tasks are rated as "piloted" by the observer, when in reality the vehicle/simulation is fully- or semi- autonomously controlled, then the vehicle/simulation "passes" the "UAV Turing Test." In this regards, this second "UAV Turing Test" approach is more consistent with Turing s original "imitation game" proposal. The overall feasibility, and important considerations and limitations, of such an approach for judging/evaluating autonomous aerial vehicle "intelligence" will be discussed from a theoretical perspective.
Square Turing patterns are usually unstable in reaction-diffusion systems and are rarely observed in corresponding experiments and simulations. We report here an example of spontaneous formation of square Turing patterns with the Lengyel-Epstein model of two coupled layers. The squares are found to be a result of the resonance between two supercritical Turing modes with an appropriate ratio. Besides, the spatiotemporal resonance of Turing modes resembles to the mode-locking phenomenon. Analysis of the general amplitude equations for square patterns reveals that the fixed point corresponding to square Turing patterns is stationary when the parameters adopt appropriate values.
Turing’s reaction–diffusion theory of morphogenesis has been very successful for understanding macroscopic patterns within complex objects ranging from biological systems to sand dunes. However, Turing patterns on microscopic length scales are extremely rare. Here we show that a strained atomic bismuth monolayer assembled on the surface of NbSe 2 —and subject to interatomic interactions and kinetics—displays Turing patterns. Our reaction–diffusion model produces stripe patterns with a period of five atoms (approximately 2 nm) and domain walls with Y-shaped junctions that bear a striking resemblance to what has been experimentally observed. Our work establishes that Turing patterns can occur at the atomic scale in a hard condensed-matter setting.
Turing's theory of pattern formation has provided crucial insights into the behavior of various biological, geographical, and chemical systems over the last few decades. Existing studies have focused on moving-boundary Turing systems for which the motion of the boundary is prescribed by an external agent. In this paper, we present an extension of this theory to a class of systems in which the front motion is governed by the physical processes that occur within the domain. Biological systems exhibiting apically dominant growth and corrosion of metals and alloys highlight some of the noteworthy examples of such systems. In this study, we characterize the nature of interaction between the moving front and the Turing-instability for both an activator-inhibitor and an activator-substrate model. Behavioral regimes of periodic, as well as nonperiodic (nonconstant), growth rates are obtained. Furthermore, the trends in the first show striking similarities with the cyclic-boundary-kinetics observed in experimental systems. In general, a stationary, periodic structure is also left behind the moving front. If the periodicity of the boundary kinetics agrees with the allowed range of the stable-periodic solutions, the pattern formed tends to persist. Lastly, it evolves to a nearby energy-minimum either by peak-splitting, peak-decay, or by settling down to a spatially homogeneous state.
Neuromorphic computing is a non-von Neumann computing paradigm that performs computation by emulating the human brain. Neuromorphic systems are extremely energy-efficient and known to consume thousands of times less power than CPUs and GPUs. They have the potential to drive critical use cases such as autonomous vehicles, edge computing and internet of things in the future. For this reason, they are sought to be an indispensable part of the future computing landscape. Neuromorphic systems are mainly used for spike-based machine learning applications, although there are some non-machine learning applications in graph theory, differential equations, and spike-based simulations. These applications suggest that neuromorphic computing might be capable of general-purpose computing. However, general-purpose computability of neuromorphic computing has not been established yet. In this work, we prove that neuromorphic computing is Turing-complete and therefore capable of general-purpose computing. Specifically, we present a model of neuromorphic computing, with just two neuron parameters (threshold and leak), and two synaptic parameters (weight and delay). We devise neuromorphic circuits for computing all the μ-recursive functions (i.e., constant, successor and projection functions) and all the μ-recursive operators (i.e., composition, primitive recursion and minimization operators). Given that the μ-recursive functions and operators are precisely the ones that can be computed using a Turing machine, this work establishes the Turing-completeness of neuromorphic computing.
Abstract Pattern formation and self-organization in many biological and non-biological systems can be explained through Turing’s activator-inhibitor model. Here we show how this model can be employed to describe the formation of filamentary structures in a low-pressure electric discharge exposed to a strong magnetic field. Theoretical investigation reveals that the fluid equations describing a magnetized plasma can be rearranged to take the mathematical form of Turing’s activator-inhibitor model. Numerical simulations based on the equations derived from this approach could reproduce the various patterns observed in the experiments. Also, it is shown that a density imbalance between electrons and ions exists in the bulk of the magnetized plasma that generates an electric field structure transverse to the applied magnetic field. This electric field is responsible for the stability of the filamentary patterns in the magnetized plasma over time scales much longer than the characteristic time scales of the electric discharge.
The formation of Turing patterns was investigated in thin cylindrical layers using the Lengyel-Epstein model of the chlorine dioxide-iodine-malonic acid reaction. The influence of the width of the layer W and the diameter D of the inner cylinder on the pattern with intrinsic wavelength l were determined in simulations with initial random noise perturbations to the uniform state for W < l/2 and D ∼ l or lower. We show that the geometric constraints of the reaction domain may result in the formation of helical Turing patterns with parameters that give stripes (b = 0.2) or spots (b = 0.37) in two dimensions. For b = 0.2, the helices were composed of lamellae and defects were likely as the diameter of the cylinder increased. With b = 0.37, the helices consisted of semi-cylinders and the orientation of stripes on the outer surface (and hence winding number) increased with increasing diameter until a new stripe appeared.
Despite foreseeing tremendous speedups over conventional deep neural networks, the performance advantage of binarized neural networks (BNNs) has merely been showcased on general-purpose processors such as CPUs and GPUs. In fact, due to being unable to leverage bit-level-parallelism with a word-based architecture, GPUs have been criticized for extremely low utilization (1%) when executing BNNs. Consequently, the latest tensorcores in NVIDIA Turing GPUs start to experimentally support bit computation. In this work, we look into this brand new bit computation capability and characterize its unique features. We show that the stride of memory access can significantly affect performance delivery and a data-format co-design is highly desired to support the tensorcores for achieving superior performance than existing software solutions without tensorcores. We realize the tensorcore-accelerated BNN design, particularly the major functions for fully-connect and convolution layers — bit matrix multiplication and bit convolution. Evaluations on two NVIDIA Turing GPUs show that, with ResNet-18, our BTC-BNN design can process ImageNet at a rate of 5.6K images per second, 77% faster than state-of-the-art. Our BNN approach is released on https://github.com/pnnl/TCBNN.
The Turing instability is studied in two-component reaction-diffusion systems with nonlinear diffusion terms, and the regions in parametric space where Turing patterns can form are determined. The boundaries between super- and subcritical bifurcations are found. Calculations are performed for one-dimensional brusselator and oregonator models.
Since the Turing test was first proposed by Alan Turing in 1950, the goal of artificial intelligence has been predicated on the ability for computers to imitate human intelligence. However, the majority of uses for the computer can be said to fall outside the domain of human abilities and it is exactly outside of this domain where computers have demonstrated their greatest contribution. Another definition for artificial intelligence is one that is not predicated on human mimicry, but instead, on human amplification, where the algorithms that are best at accomplishing this are deemed the most intelligent. This article surveys various systems that augment human and social intelligence.
One-tape off-line Turing machines covering crossing sequences, recognition problems and computation times
One-tape off-line Turing machine, analyzing characteristics and computation time minimization
Lower bounds on computation times of certain input-output transformations and tradeoff relation between computation time and dimensionality of Turing machine tapes
This paper is concerned with the formation and persistence of spatiotemporal patterns in binary mixtures of chemically reacting species, where one of the species is an activator, the other an inhibitor of the chemical reaction. The system of reaction-diffusion equations is reduced to a finite system of ordinary differential equations by a variant of the centre-manifold reduction method. The reduced system fully describes the local dynamics of the original system near transition points at the onset of instability. The attractor-bifurcation theory is used to give a complete characterization of the bifurcated objects in terms of the physical parameters of the problem. The results are illustrated for the Schnakenberg model.
Explore the source record for details and available documents.
Explore the source record for details and available documents.