Results 91 to 100 of about 2,083,882 (139)
About Shannon's problem for turing machines [PDF]
Computer Science Journal of Moldova, 1993 Describe the universal turing machine with 3 states and 10 symbols and with 27 commands really used in the program.
Yu. Rogozhin
doaj
Factors Predicting Pre‐Service Teachers' Intentions to Use Artificial Intelligence Software
European Journal of Education, Volume 61, Issue 4, December 2026.ABSTRACT This research investigates the factors affecting pre‐service teachers' (PSTs) behavioural intentions (BI) to use artificial intelligence software in their future classes. The study examined factors affecting PSTs' behavioural intentions using an extended UTAUT framework comprising Performance Expectancy (PE), Effort Expectancy (EE), Social ...
Kubra Acikgul +2 more
wiley +1 more source
LABOUR, Volume 40, Issue 4, Page 409-431, December 2026.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 Machine / Nordin Abu Bakar
, 1992 Turing Machine is one of the earliest device in programming to describe or interpret a model for algorithmic specification. Beside Turing, Church and Kleene also offer their own formulations to define computability of functions.
core
Clinical Pharmacology &Therapeutics, Volume 120, Issue 5, Page 1181-1194, November 2026.Conventional clinical trials remain the benchmark for evaluating therapeutic safety and efficacy, yet they are constrained by escalating costs, withdrawal over the extended follow‐up periods, recruitment difficulties, ethical limits, and a restricted ability to characterize heterogeneous populations.
Maximilian Balmus +7 more
wiley +1 more source
A Common External Framework for Kleene and McCarthy Algebras
Mathematical Logic Quarterly, Volume 72, Issue 4, November 2026.ABSTRACT Algebras of disjoint alternatives (ADAs), introduced by Manes, are extensions of McCarthy algebras by a unary operator acting as an oracle for the halting problem, and provide a semantics for the equational theory of the if–then–else construct.
Gandolfo Vergottini +2 more
wiley +1 more source
Digital Minds: Issues in the Philosophy of Mind and Cognitive Science
Philosophy Compass, Volume 21, Issue 6, November/December 2026.ABSTRACT This article provides a contemporary introduction to issues in the philosophy of mind and cognitive science that are studied within the emerging field of digital minds research. We explore the potential for AI systems to have mental states. Questions that we address include whether artificially intelligent systems can be phenomenally conscious
Bradford Saad, Andreas L. Mogensen
wiley +1 more source
The Turing Way: A Handbook for Reproducible Data Science
, 2019 <p>Reproducible research is necessary to ensure that scientific work can be trusted. Funders and publishers are beginning to require that publications include access to the underlying data and the analysis code.
The Turing Way Community (6945962) +19 more
core +1 more source
Facing the Humanities Without the Human: Technological Advances in Creativity
ELOPEIn 1950, the mathematician and computer scientist Alan Turing proposed that, given the difficulty of objectively comparing human and machine intelligence, since the processes employed by each differ substantially, a subjective test could be used to ...
Victor Kennedy +3 more
doaj +1 more source
The wolfram 2,3 turing machine
, 2008 Knowledge about computer scienceThe Wolfram 2,3 Turing machine is the smallest Turing machine known to have the property of computation universality. (The universality was established by the solution of the Wolfram 2,3 Turing machine research prize in ...
Wolfram, Stephen, Nochella, Jesse
core