Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “turing”

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.

At least 19 records

Feasibility of Turing-Style Tests for Autonomous Aerial Vehicle "Intelligence"

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.

Young, Larry A.↗

Formation of turing patterns in strongly magnetized electric discharges

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.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

On-line turing machine computations.

Lower bounds on computation times of certain input-output transformations and tradeoff relation between computation time and dimensionality of Turing machine tapes

DATA PROCESSING↗

On The Computational Capabilities of Physical Systems: Relationship With Conventional Computer Science - Part 2

In the first of this pair of papers, it was proven that there cannot be a physical computer to which one can properly pose any and all computational tasks concerning the physical universe. It was then further proven that no physical computer C can correctly carry out all computational tasks that can be posed to C. As a particular example, this result means that no physical computer that can, for any physical system external to that computer, take the specification of that external system's state as input and then correctly predict its future state before that future state actually occurs; one cannot build a physical computer that can be assured of correctly "processing information faster than the universe does". These results do not rely on systems that are infinite, and/or non-classical, and/or obey chaotic dynamics. They also hold even if one uses an infinitely fast, infinitely dense computer, with computational powers greater than that of a Turing Machine. This generality is a direct consequence of the fact that a novel definition of computation - "physical computation" - is needed to address the issues considered in these papers, which concern real physical computers. While this novel definition does not fit into the traditional Chomsky hierarchy, the mathematical structure and impossibility results associated with it have parallels in the mathematics of the Chomsky hierarchy. This second paper of the pair presents a preliminary exploration of some of this mathematical structure. Analogues of Chomskian results concerning universal Turing Machines and the Halting theorem are derived, as are results concerning the (im)possibility of certain kinds of error-correcting codes. In addition, an analogue of algorithmic information complexity, "prediction complexity", is elaborated. A task-independent bound is derived on how much the prediction complexity of a computational task can differ for two different reference universal physical computers used to solve that task, a bound similar to the "encoding" bound governing how much the algorithm information complexity of a Turing machine calculation can differ for two reference universal Turing machines. Finally, it is proven that either the Hamiltonian of our universe proscribes a certain type of computation, or prediction complexity is unique (unlike algorithmic information complexity), in that there is one and only version of it that can be applicable throughout our universe.

Wolpert, David H.↗

Large Primtive Asteroids: Thermal and Dynamical Context

Primitiveasteroids, most of which are located in the outer belt and Jupiter’s Trojan clouds, provide information related to the origin and evolution of the solar system and the conditions in which the solar nebula was formed. These asteroids are widely thought to be the origin of the least-altered car-bonaceous chondrite that allow us to put crucial con-straints on the current dynamical and thermal theories of the formation and evolution of the early solar sys-tem. The nature of surface composition of large and low-albedo asteroids, like (1) Ceres, (10) Hygiea and (52) Europa, is still under intense debate and different interpretations have beenput forth to explain the ab-sorption features in these objects (e.g.,[1, 2, 3,4,5,6]). Laboratory and spectroscopic experiments on me-teorites that represent all nine carbonaceous chondrite types also found no spectral matches for these large asteroids (e.g.,[7]). Previous studies of asteroid Ceres (the largest primitive asteroid in the solar system) have been conducted to constrain and estimate its surface composition (e.g., [2, 5]). Using linear mixing,[2]found hydroxide brucite, serpentines, and carbonates, to be consistent with Ceres’ ground-based spectra.[5]estimated the surface composition of Ceres and found evidence of widespread NH3-phyllosilicates across its surface using best-fit solutions to Dawn’s NIR spectra. The presence of NH3-phyllosilicates implies that mate-rial from the outer solar system was incorporated into large primitive asteroids, either during their formation at great heliocentric distance or by incorporation of material transported into the Main Belt region. Here we presentnew largeand primitive asteroidsthat share the same spectral similaritieswith the largest asteroid in the solar system, Ceres.We also present the context of these new observations in terms oftheirthermal and dynamicalevolution.Large Primitive Asteroids: Dynamical and Thermal Context:Orbital Distribution of LargePrimitiveAsteroids: Constraining the mineralogy and surface composition of large primitive asteroids will place crucial con-straints on existing dynamical and thermal theories of the formation of the early solar system. We identified several additional asteroids in the Europa-like group in addition to asteroids Europa, Euphrosyne, and Patien-tia, that wereidentified in [8]using NASA IRTFtele-scope (e.g.,Figure 1). These new asteroids along with the already-observed Ceres-and Europa-like group members are localized in the 2.8 < a < 3.4 AU region and characterized by larger sizes, showing an interest-ing orbital distribution (Figure 2). Ceres-likeand Eu-ropa-like groups, which include the largest asteroids in the solar system, show an interesting orbital distribu-tion. These groups are located in the 2.6 < a < 3.6 AU region that contains the snow-line. The snow-line’s location may have been driftedinwards due to the disk’s cooling and evolution[9,10]. Recent dynamical models[11,12]suggested that a substantial fraction of primitive asteroids originated between or beyond the giant planets (a > 5 AU), where water ice would have been stable, and then implanted in the outer Main Belt region because of the giant planets’ growth.Figure 1. Two asteroids, 94 Aurora and 423 Diotima, showing spectra similar to asteroids (1)Ceres and (52)Europa.Thermal modeling and evolution of primitive aster-oids:Primitive water-rich asteroids are thought to be originally composed of mixtures of anhydrous materi-als and water ice that waslater melted by heating sources such as the decay of 26Al, reacting with anhy-drous materials to form H2O/OH-rich minerals. Calcu-lations of the evolution of the temperature and struc-ture of icy planetesimals were performedusing a 1D finite differences thermal evolution model[13, 14] for 26Al-heated planetesimals. In particular, thermally activated compaction due to hot pressing of bodies with an initially unconsolidated porous structure is included. An ice-rich initial composition that leads to a material dominated by phyllosilicates upon aqueous alteration (with 25 vol% H2O and a rock fraction that contains 85 vol% phyllosilicates and 15 vol% olivine upon aque-ous alteration, similar to CIand CM chondrites) was assumed. Atypical initial porosity of 40%[15] is re-duced following the change of the strain rate that is calculated as Voigt approximation from the strain rates of components[16]. Material properties (thermal con-ductivity, density, heat capacity, etc.) correspond to the composition assumed and are adjusted with tempera-ture and porosity. Melting of the water ice as well as water-rock separation are included[14]. Both short-and long-lived radionuclides are consideredas heat sources. Figure 3 shows the maximum temperature calculated as a function of radius and accretion time. A variety of internal structures is obtained, ranging from primordial (no melting of water ice) over partially melted or partially differentiated (melting of water ice, hydration, formation of a rocky core and water ocean below an undifferentiated layer) to completely differ-entiated ones (rocky core, water mantle, Enceladus-like case). The heating and differentiation of planetesi-mals is determined by the availability of 26Al, i.e., by the accretion time t0 relative to the formation of the calcium-aluminum-rich inclusions (CAIs), such that maximum temperatures and structures vary stronglyfor t0< 6 Myr rel. to CAIs. However, for a later accre-tion only the size of the body determines its maximum tempera-ture and structure due to the nearly constant heating by long-lived radionuclides. Average densities of Ceres-and Europa-like group membersimply high-ly porous interiors and, consequently, relatively late accretion at t0> 3 Myr rel. to CAIs with a maximum temperature of < 600 K (Figure3)

D Takir↗

Reversal-bounded multipushdown machines

Several representations of the recursively enumerable (r.e.) sets are presented. The first states that every r.e. set is the homomorphic image of the intersection of two linear context-free languages. The second states that every r.e. set is accepted by an on-line Turing acceptor with two pushdown stores such that in every computation, each pushdown store can make at most one reversal (that is, one change from 'pushing' to 'popping'). It is shown that this automata theoretic representation cannot be strengthened by restricting the acceptors to be deterministic multitape, nondeterministic one-tape, or nondeterministic multicounter acceptors. This provides evidence that reversal bounds are not a natural measure of computational complexity for multitape Turing acceptors.

Baker, B. S.↗

Consequences of nonclassical measurement for the algorithmic description of continuous dynamical systems

Continuous dynamical systems intuitively seem capable of more complex behavior than discrete systems. If analyzed in the framework of the traditional theory of computation, a continuous dynamical system with countably many quasistable states has at least the computational power of a universal Turing machine. Such an analysis assumes, however, the classical notion of measurement. If measurement is viewed nonclassically, a continuous dynamical system cannot, even in principle, exhibit behavior that cannot be simulated by a universal Turing machine.

Fields, Chris↗

Is thinking computable?

Strong artificial intelligence claims that conscious thought can arise in computers containing the right algorithms even though none of the programs or components of those computers understand which is going on. As proof, it asserts that brains are finite webs of neurons, each with a definite function governed by the laws of physics; this web has a set of equations that can be solved (or simulated) by a sufficiently powerful computer. Strong AI claims the Turing test as a criterion of success. A recent debate in Scientific American concludes that the Turing test is not sufficient, but leaves intact the underlying premise that thought is a computable process. The recent book by Roger Penrose, however, offers a sharp challenge, arguing that the laws of quantum physics may govern mental processes and that these laws may not be computable. In every area of mathematics and physics, Penrose finds evidence of nonalgorithmic human activity and concludes that mental processes are inherently more powerful than computational processes.

Denning, Peter J.↗

Consequences of nonclassical measurement for the algorithmic description of continuous dynamical systems

Continuous dynamical systems intuitively seem capable of more complex behavior than discrete systems. If analyzed in the framework of the traditional theory of computation, a continuous dynamical system with countablely many quasistable states has at least the computational power of a universal Turing machine. Such an analyses assumes, however, the classical notion of measurement. If measurement is viewed nonclassically, a continuous dynamical system cannot, even in principle, exhibit behavior that cannot be simulated by a universal Turing machine.

Fields, Chris↗

Undecidability in macroeconomics

In this paper we study the difficulty of solving problems in economics. For this purpose, we adopt the notion of undecidability from recursion theory. We show that certain problems in economics are undecidable, i.e., cannot be solved by a Turing Machine, a device that is at least as powerful as any computational device that can be constructed. In particular, we prove that even in finite closed economies subject to a variable initial condition, in which a social planner knows the behavior of every agent in the economy, certain important social planning problems are undecidable. Thus, it may be impossible to make effective policy decisions. Philosophically, this result formally brings into question the Rational Expectations Hypothesis which assumes that each agent is able to determine what it should do if it wishes to maximize its utility. We show that even when an optimal rational forecast exists for each agency (based on the information currently available to it), agents may lack the ability to make these forecasts. For example, Lucas describes economic models as 'mechanical, artificial world(s), populated by ... interacting robots'. Since any mechanical robot can be at most as computationally powerful as a Turing Machine, such economies are vulnerable to the phenomenon of undecidability.

Chandra, Siddharth↗

AI's Philosophical Underpinnings: A Thinking Person's Walk through the Twists and Turns of Artificial Intelligence's Meandering Path

Few human endeavors can be viewed both as extremely successful and unsuccessful at the same time. This is typically the case when goals have not been well defined or have been shifting in time. This has certainly been true of Artificial Intelligence (AI). The nature of intelligence has been the object of much thought and speculation throughout the history of philosophy. It is in the nature of philosophy that real headway is sometimes made only when appropriate tools become available. Similarly the computer, coupled with the ability to program (at least in principle) any function, appeared to be the tool that could tackle the notion of intelligence. To suit the tool, the problem of the nature of intelligence was soon sidestepped in favor of this notion: If a probing conversation with a computer could not be distinguished from a conversation with a human, then AI had been achieved. This notion became known as the Turing test, after the mathematician Alan Turing who proposed it in 1950. Conceptually rich and interesting, these early efforts gave rise to a large portion of the field's framework. Key to AI, rather than the 'number crunching' typical of computers until then, was viewed as the ability to manipulate symbols and make logical inferences. To facilitate these tasks, AI languages such as LISP and Prolog were invented and used widely in the field. One idea that emerged and enabled some success with real world problems was the notion that 'most intelligence' really resided in knowledge. A phrase attributed to Feigenbaum, one of the pioneers, was 'knowledge is the power.' With this premise, the problem is shifted from 'how do we solve problems' to 'how do we represent knowledge.' A good knowledge representation scheme could allow one to draw conclusions from given premises. Such schemes took forms such as rules,frames and scripts. It allowed the building of what became known as expert systems or knowledge based systems (KBS).

Colombano, Silvano↗

The world problem: on the computability of the topology of 4-manifolds

Topological classification of the 4-manifolds bridges computation theory and physics. A proof of the undecidability of the homeomorphy problem for 4-manifolds is outlined here in a clarifying way. It is shown that an arbitrary Turing machine with an arbitrary input can be encoded into the topology of a 4-manifold, such that the 4-manifold is homeomorphic to a certain other 4-manifold if and only if the corresponding Turing machine halts on the associated input. Physical implications are briefly discussed.

vanMeter, J. R.↗

A simple fourth order propagator based on the Magnus expansion in the Liouville space: Application to a Λ-system and assessment of the rotating wave approximation

A simple fourth-order propagator [Ture and Jang, J. Phys. Chem. A 128, 2871 (2024)] based on the Magnus expansion is extended to the Liouville space for both closed-system and Lindbladian open-system quantum dynamics. For both dynamics, commutator free versions of fourth-order propagators are provided as well. These propagators are then applied to the dynamics of a driven Λ-system, where Lindblad terms represent the effect of a photonic bath. For both dynamics, the accuracy of the rotating wave approximation (RWA) for the matter–radiation interaction is assessed. We confirmed reasonable performance of RWA for weak and resonant fields. However, small errors appear for moderate fields and substantial errors can be found for strong fields where coherent population trapping can still be expected. We also found that the presence of bath for open-system quantum dynamics consistently reduces the errors of the RWA. These results provide quantitative information on how the RWA breaks down beyond weak field or for non-resonant cases. Major results are benchmarked against results of our sixth-order ME-based propagator. Finally, we also provide numerical comparison of our algorithms with other fourth-order algorithms for the Λ-system. These confirm reasonable performance of our simple propagators and the improvement gained through commutator-free expressions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Probability Simulations by Non-Lipschitz Chaos

It has been demonstrated that classical probabilities, and in particular, probabilistic Turing machine, can be simulated by combining chaos and non-Lipschitz dynamics, without utilization of any man-made devices. Self-organizing properties of systems coupling simulated and calculated probabilities and their link to quantum computations are discussed.

classical dynamics classical probabilities probabi↗