Results 21 to 30 of about 20,918 (155)
Real Computational Universality: The Word Problem for a class of groups with infinite presentation [PDF]
, 2006 The word problem for discrete groups is well-known to be undecidable by a Turing Machine; more precisely, it is reducible both to and from and thus equivalent to the discrete Halting Problem.
Meer, Klaus, Ziegler, Martin
core +4 more sources
Fabric‐Based Wearable Robotic Exoskeleton Gloves: Advancements and Challenges
Advanced Materials Technologies, EarlyView.This review highlights interdisciplinary technological advances in fabric‐based robotic gloves, focusing on progress in design, fabrication, actuation, sensing, control, and power and energy requirements. It also addresses performance testing and validation, including biomechanical, strength, functional, user experience, and durability assessments, to ...
Ayse Feyza Yilmaz +2 more
wiley +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
Infinite time decidable equivalence relation theory [PDF]
, 2009 We introduce an analog of the theory of Borel equivalence relations in which we study equivalence relations that are decidable by an infinite time Turing machine.
Coskey, Samuel, Hamkins, Joel David
core +1 more source
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
Trace Complexity of Chaotic Reversible Cellular Automata
, 2014 Delvenne, K\r{u}rka and Blondel have defined new notions of computational complexity for arbitrary symbolic systems, and shown examples of effective systems that are computationally universal in this sense.
A.R. Smith III +11 more
core +1 more source
Artificial Intelligence for Bone: Theory, Methods, and Applications
Advanced Intelligent Discovery, EarlyView.Advances in artificial intelligence (AI) offer the potential to improve bone research. The current review explores the contributions of AI to pathological study, biomarker discovery, drug design, and clinical diagnosis and prognosis of bone diseases. We envision that AI‐driven methodologies will enable identifying novel targets for drugs discovery. The
Dongfeng Yuan +3 more
wiley +1 more source
Philosophy of Computer Science: An Introductory Course [PDF]
, 2005 There are many branches of philosophy called “the philosophy of X,” where X = disciplines ranging from history to physics. The philosophy of artificial intelligence has a long history, and there are many courses and texts with that title.
Rapaport, William J.
core
Computability and analysis: the legacy of Alan Turing
, 2009 We discuss the legacy of Alan Turing and his impact on computability and analysis.Comment: 49 ...
Avigad, Jeremy, Brattka, Vasco
core +2 more sources
The Challenge of Handling Structured Missingness in Integrated Data Sources
Advanced Intelligent Discovery, EarlyView.As data integration becomes ever more prevalent, a new research question that emerges is how to handle missing values that will inevitably arise in these large‐scale integrated databases? This missingness can be described as structured missingness, encompassing scenarios involving multivariate missingness mechanisms and deterministic, nonrandom ...
James Jackson +6 more
wiley +1 more source