Results 141 to 150 of about 1,908,978 (257)
Gap junctions in Turing-type periodic feather pattern formation.
Periodic patterning requires coordinated cell-cell interactions at the tissue level. Turing showed, using mathematical modeling, how spatial patterns could arise from the reactions of a diffusive activator-inhibitor pair in an initially homogeneous 2D ...
Chun-Chih Tseng +6 more
doaj +1 more source
A modified Turing model for the pattern formation model
The linear model introduced by Turing for pattern formation, known as the Turing bifurcation, is one of the most extensively studied mathematical programming problems in this field.\\ In this paper, we address a nonlinear reaction-diffusion model for ...
Amattouch
core +1 more source
ABSTRACT Advances in artificial intelligence (AI) and robotics since 2000 led to widespread concern that automation would eliminate a massive number of jobs. Frey and Osborne's influential study concluded AI and robots might eliminate nearly half of all US jobs between 2010 and 2030.
Michael J. Handel
wiley +1 more source
Turing conditions for a two-component isotropic growing system from a potential function
We analyze pattern formation in a two-component system within an isotropically growing or shrinking domain. By studying the evolution of a Lyapunov-like function, we derive time-dependent Turing bifurcation conditions through a stability analysis of ...
Aldo Ledesma-Durán +2 more
doaj +1 more source
Fecha de consulta: 206-05-10La informática a la que recurrimos para tuitear o hacernos una resonancia magnética es en esencia Alan Turing, uno de los científicos más importantes de la Historia.
Meseguer, Pedro +1 more
core
Do large language models (“LLMs”) think? Daniel Stoljar and Zhihe Vincent Zhang have recently developed an argument from rationality for the claim that LLMs do not think. We contend, however, that the argument from rationality not only falters, but leaves open an intriguing possibility: that LLMs engage only in arational, associative forms of thinking ...
Joseph Gottlieb +2 more
wiley +1 more source
Explaining the undecidability of first-order logic
Turing proved the unsolvability of the decision problem for first-order logic (Entscheidungsproblem) in his famous paper On Computable Numbers, with an Application to the Entscheidungsproblem.
Timm Lampert, Anderson Nakano
doaj +1 more source
Abstract This essay, designed as a complement to opinions expressed by Rowan Williams and some speakers at the conference in his honour, explores features of early Christianity which suggest a positive evaluation of artificial intelligence. Noting that the fear of reducing humans to machines has been joined in the modern age by the fear that machines ...
Mark J. Edwards
wiley +1 more source
Is A Little Learning Dangerous?
ABSTRACT I argue that a little learning is often dangerous even for ideal reasoners who are operating in extremely simple scenarios and know all the relevant facts about how the evidence is generated. More precisely, I show that, on many plausible ways of assigning value to a credence in a hypothesis H, ideal Bayesians should sometimes expect other ...
Bernhard Salow
wiley +1 more source
Life, but Not as We Know It: Why Fine‐Tuning Arguments Fail
ABSTRACT Definitions of “life” and theories of life are systematically neglected in arguments for and from fine‐tuning. Despite claims to be neutral about the definition of “life,” fine‐tuning arguments generally presuppose that life requires a form of structural complexity only afforded by physicochemical complexity of the sort with which we are ...
Joe Gough
wiley +1 more source

