Results 51 to 60 of about 2,083,882 (139)
Executable Behaviour and the π-Calculus (extended abstract) [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 Reactive Turing machines extend classical Turing machines with a facility to model observable interactive behaviour. We call a behaviour executable if, and only if, it is behaviourally equivalent to the behaviour of a reactive Turing machine.
Bas Luttik, Fei Yang
doaj +1 more source
Generative AI—the Transgression of Technology
Systems Research and Behavioral Science, EarlyView.ABSTRACT This article offers a systems‐theoretical analysis of generative artificial intelligence (GenAI) grounded in Niklas Luhmann's sociology of technology. It addresses a central conceptual problem: How GenAI can be understood within a theoretical framework that has traditionally defined technology as a means of stabilising action through causal ...
Jesper Tække
wiley +1 more source
Problems in number theory from busy beaver competition [PDF]
Logical Methods in Computer Science, 2015 By introducing the busy beaver competition of Turing machines, in 1962, Rado defined noncomputable functions on positive integers. The study of these functions and variants leads to many mathematical challenges.
Pascal Michel
doaj +1 more source
What Can Deep Neural Networks Teach Us About Embodied Bounded Rationality
Frontiers in Psychology, 2022 “Rationality” in Simon's “bounded rationality” is the principle that humans make decisions on the basis of step-by-step (algorithmic) reasoning using systematic rules of logic to maximize utility. “Bounded rationality” is the observation that the ability
Edward A. Lee
doaj +1 more source
The law of AI knowledge distillation
American Business Law Journal, EarlyView.Abstract Knowledge distillation—the practice of training a compact student model on the outputs of a larger teacher model—has emerged as the fastest‐growing technique for replicating and disseminating frontier artificial intelligence (AI) capabilities.
Taorui Guan
wiley +1 more source
Turing Impossibility Properties for Stack Machine Programming
, 2012 The strong, intermediate, and weak Turing impossibility properties are introduced. Some facts concerning Turing impossibility for stack machine programming are trivially adapted from previous work. Several intriguing questions are raised about the Turing
Bergstra, J.A., Middelburg, C.A.
core +4 more sources
Random strings and tt-degrees of Turing complete C.E. sets [PDF]
Logical Methods in Computer Science, 2014 We investigate the truth-table degrees of (co-)c.e.\ sets, in particular, sets of random strings. It is known that the set of random strings with respect to any universal prefix-free machine is Turing complete, but that truth-table completeness depends ...
Mingzhong Cai +4 more
doaj +1 more source
Educational Theory, EarlyView.Abstract Can an artificial intelligence (AI) system perform the emotional labor of teaching, or can it only reproduce emotional labor's outward signs? In this article, I argue that the latter does not by itself justify the former. Emotional labor in education includes surface acting, but it still presupposes an agent capable of emotion, self‐regulation,
Noah Khan
wiley +1 more source
International Endodontic Journal, EarlyView.ABSTRACT Background Computer vision methods based on artificial intelligence (AI) have found numerous applications in endodontic diagnosis and treatment planning. While most current applications employ discriminative deep learning models for detection and classification tasks, the field is now witnessing the rise of generative AI (GenAI), a class of AI
Hossein Mohammad‐Rahimi +6 more
wiley +1 more source
On the Expressiveness of the Approach to Constructing PLC-programs by LTL-Specification
Моделирование и анализ информационных систем, 2015 The article is devoted to the approach to constructing and verification of discrete PLC-programs by LTL-specification. This approach provides an ability of correctness analysis of PLC-programs by the model checking method.
E. V. Kuzmin +2 more
doaj +1 more source