Results 41 to 50 of about 134,383 (239)
Would You Pass the Turing Test? Influencing Factors of the Turing Decision
Psychological Topics, 2022 We aimed to contribute to the emerging field of human-computer interaction by revealing some of the cues we use to distinguish humans from machines.
Adrienn Ujhelyi +2 more
doaj +2 more sources
Information Transmission Strategies for Self‐Organized Robotic Aggregation
Advanced Robotics Research, EarlyView.In this review, we discuss how information transmission influences the neighbor‐based self‐organized aggregation of swarm robots. We focus specifically on local interactions regarding information transfer and categorize previous studies based on the functions of the information exchanged.
Shu Leng +5 more
wiley +1 more source
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
Robotic Materials With Bioinspired Microstructures for High Sensitivity and Fast Actuation
Advanced Science, EarlyView.In the review paper, design rationale and approaches for bioinspired sensors and actuators in robotics applications are presented. These bioinspired microstructure strategies implemented in both can improve the performance in several ways. Also, recent ideas and innovations that embed robotic materials with logic and computation with it are part of the
Sakshi Sakshi +4 more
wiley +1 more source
Fuzzy Kolmogorov Complexity Based on a Classical Description
Entropy, 2020 In this paper, we give a definition for fuzzy Kolmogorov complexity. In the classical setting, the Kolmogorov complexity of a single finite string is the length of the shortest program that produces this string.
Songsong Dai
doaj +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
On Turing Machines Deciding According to the Shortest Computations
Axioms, 2021 In this paper we propose and analyse from the computational complexity point of view several new variants of nondeterministic Turing machines. In the first such variant, a machine accepts a given input word if and only if one of its shortest possible ...
Florin Manea
doaj +1 more source
MGM as a Large‐Scale Pretrained Foundation Model for Microbiome Analyses in Diverse Contexts
Advanced Science, EarlyView.We present the Microbial General Model (MGM), a transformer‐based foundation model pretrained on over 260,000 microbiome samples. MGM learns contextualized microbial representations via self‐supervised language modeling, enabling robust transfer learning, cross‐regional generalization, keystone taxa discovery, and prompt‐guided generation of realistic,
Haohong Zhang +5 more
wiley +1 more source
Decision Problems For Turing Machines [PDF]
, 2009 We answer two questions posed by Castro and Cucker, giving the exact complexities of two decision problems about cardinalities of omega-languages of Turing machines.
Dominique Lecomte +2 more
core +3 more sources
Advanced Intelligent Discovery, EarlyView.Combining machine learning and probabilistic statistical learning is a powerful way to discover and design new materials. A variety of machine learning approaches can be used to identify promising candidates for target applications, and causal inference can help identify potential ways to make them a reality.
Jonathan Y. C. Ting, Amanda S. Barnard
wiley +1 more source