Results 51 to 60 of about 697,012 (268)
Meaningless Sets in Infinitary Combinatory Logic [PDF]
, 2012 In this paper we study meaningless sets in infinitary combinatory logic. So far only a handful of meaningless sets were known. We show that there are uncountably many meaningless sets.
Severi, Paula, de Vries, Fer-Jan
core +1 more source
Directed evolution of enzymes at the crossroads of tradition and innovation
FEBS Open Bio, EarlyView.An iterative cycle of data‐driven enzyme optimization comprising four stages: genetic diversification of a template enzyme, expression of protein variants, high‐throughput evaluation, and machine‐learning‐guided redesign of the next variant library.
Maria Tomkova +2 more
wiley +1 more source
Electrica, 2009 This paper proposes an open switch faults detection and localization algorithm for shunt three phase active filter topology. It mainly details converter configuration and examines a simple and reliable optimised fault diagnosis method.
Tarak BENSLIMANE, Thameur ABDELKRIM
doaj +2 more sources
Functional completeness of the mixed λ-calculus and combinatory logic [PDF]
, 1990 Functional completeness of the combinatory logic means that every lambda-expression may be translated into an equivalent combinator expression and this is the theoretical basis for the implementation of functional languages on combinator-based abstract ...
Nielson, Hanne Riis, Nielson, Flemming
core +1 more source
FEBS Open Bio, EarlyView.This pilot study investigates the potential of Generative AI to provide formative feedback to students. ChatGPT was prompted to provide feedback on Year 1 Bioscience essays, which were evaluated against established good feedback practices. GenAI‐authored feedback had useful elements, but was limited in scope. GenAI may have potential to provide instant,
Annabel Court +3 more
wiley +1 more source
A combinatory account of internal structure [PDF]
, 2011 Traditional combinatory logic uses combinators S and K to represent all Turing-computable functions on natural numbers, but there are Turing-computable functions on the combinators themselves that cannot be so represented, because they access internal ...
Barry Jay +3 more
core +1 more source
A Q‐Learning Algorithm to Solve the Two‐Player Zero‐Sum Game Problem for Nonlinear Systems
International Journal of Adaptive Control and Signal Processing, Volume 39, Issue 3, Page 566-581, March 2025.A Q‐learning algorithm to solve the two‐player zero‐sum game problem for nonlinear systems. ABSTRACT This paper deals with the two‐player zero‐sum game problem, which is a bounded L2$$ {L}_2 $$‐gain robust control problem. Finding an analytical solution to the complex Hamilton‐Jacobi‐Issacs (HJI) equation is a challenging task.
Afreen Islam +2 more
wiley +1 more source
Normal Forms in Combinatory Logic
Notre Dame Journal of Formal Logic, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
On Combinatorial Proofs for Modal Logic [PDF]
, 2019 In this paper we extend Hughes’ combinatorial proofs to modal logics. The crucial ingredient for modeling the modalities is the use of a self-dual non-commutative operator that has first been observed by Retoré through pomset logic. Consequently, we had to generalize the notion of skew fibration from cographs to Guglielmi’s relation webs.Our main ...
Acclavio, Matteo, Strassburger, Lutz
openaire +3 more sources
Advanced Engineering Materials, EarlyView.This article presents the NFDI‐MatWerk Ontology (MWO), a Basic Formal Ontology‐based framework for interoperable research data management in materials science and engineering (MSE). Covering consortium structures, research data management resources, services, and instruments, MWO enables semantic integration, Findable, Accessible, Interoperable, and ...
Hossein Beygi Nasrabadi +4 more
wiley +1 more source