Results 31 to 40 of about 17,229 (237)
An Intensional Concurrent Faithful Encoding of Turing Machines [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 The benchmark for computation is typically given as Turing computability; the ability for a computation to be performed by a Turing Machine. Many languages exploit (indirect) encodings of Turing Machines to demonstrate their ability to support arbitrary ...
Thomas Given-Wilson
doaj +1 more source
Filozofia i Nauka, 2023 We examine Turing’s intriguing claim, made in the philosophy journal Mind, that he had created a short computer program of such a nature that it would be impossible “to discover by observation sufficient about it to predict its future behaviour, and this within a reasonable time, say a thousand years” (Turing, 1950, p. 457).
B. Jack Copeland, Diane Proudfoot
openaire +2 more sources
Notre Dame Journal of Formal Logic, 1987 A number-theoretic function f is called ``Turing projectable'' if there is a Turing computable function g such that for each fixed n, g(n,m) is constant for sufficiently large m, and \(f(n)=\lim_{m\to \infty}g(n,m)\). Some elementary recursion-theoretic properties of this notion are derived, for example that the Turing projectable functions are exactly
McCarthy, Timothy, Shapiro, Stewart
openaire +2 more sources
Turing–Hopf bifurcation of a ratio-dependent predator-prey model with diffusion
Advances in Difference Equations, 2019 In this paper, the Turing–Hopf bifurcation of a ratio-dependent predator-prey model with diffusion and Neumann boundary condition is considered. Firstly, we present a kind of double parameters selection method, which can be used to analyze the Turing ...
Qiushuang Shi, Ming Liu, Xiaofeng Xu
doaj +1 more source
Bifurcations and Turing patterns in a diffusive Gierer–Meinhardt model
Electronic Journal of Qualitative Theory of Differential Equations, 2023 In this paper, the Hopf bifurcations and Turing bifurcations of the Gierer–Meinhardt activator-inhibitor model are studied. The very interesting and complex spatially periodic solutions and patterns induced by bifurcations are analyzed from both ...
Yong Wang, Mengping Guo, Weihua Jiang
doaj +1 more source
Homogeneous solution assembled Turing structures with near zero strain semi-coherence interface
Nature Communications, 2022 Turing structures emerge in reaction-diffusion processes far from thermodynamic equilibrium involving chemicals with different diffusion coefficients in classic Turing systems.
Yuanming Zhang +11 more
doaj +1 more source
A Risk-based Approach to AI Regulation: System Categorisation and Explainable AI Practices
SCRIPTed: A Journal of Law, Technology & Society, 2023 The regulation of artificial intelligence (AI) presents a challenging new legal frontier that is only just beginning to be addressed around the world. This article provides an examination of why regulation of AI is difficult, with a particular focus on ...
Keri Grieman, Joseph Early
doaj +1 more source
The Mathematical Objection to Artificial (Machine) Intelligence
PhilosophiesTuring develops the idea of machine intelligence in a series of lectures and papers between 1947 and 1952. In some of them he addresses the mathematical objection (his term), whose gist is the claim that humans can assert some mathematical truths that ...
Ben Gershon, Oron Shagrir
doaj +1 more source
Artificial Intelligence as a Simulacra of Meaning
Галактика медиа: журнал медиа исследованийIn recent years, artificial intelligence (AI) has been actively integrated into everyday human life. Its popularity continues to grow steadily, and companies increasingly employ AI to optimize and accelerate workflows.
Sergey A. Malinov
doaj +1 more source
Quaternionic quantum Turing machines
Frontiers in Physics, 2023 Quaternionic quantum theory is an extension of the standard complex quantum theory. Inspired by this, we study the quaternionic quantum computation using quaternions.
Songsong Dai
doaj +1 more source