Results 41 to 50 of about 307 (171)

NP-Completeness of a combinator optimisation problem [PDF]

open access: yes
We consider a deterministic rewrite system for combinatory logic over combinators S, K, I, B, C, S', B' and C'. Terms will be represented by graphs so that reduction of a duplicator will cause the duplicated expression to be "shared" rather than copied ...
Rayward-Smith, V. J., Joy, Mike
core  

NbOx Mott Memristor‐Based Oscillatory P‐trit for Ternary Potts Machine

open access: yesAdvanced Science, EarlyView.
A ternary Potts machine utilizing NbOx‐based probabilistic trits (p‐trits) is demonstrated for efficient combinatorial optimization. By leveraging the electro‐thermal switching dynamics of NbOx memristors, this architecture generates three‐state stochastic fluctuations.
Hakseung Rhee   +10 more
wiley   +1 more source

Reversible Combinatory Logic

open access: yes, 2006
The lambda-calculus is destructive: its main computational mechanism, beta reduction, destroys the redex, which makes replaying the computational steps impossible.
Wiklicky H.   +2 more
core   +1 more source

Efficient Current‐Driven Perpendicular Magnetization Switching Through the Synergy of the Orbital and Spin Hall Effects

open access: yesAdvanced Science, EarlyView.
NiNb alloys enable efficient charge‐to‐spin conversion by combining the spin Hall effect of nickel with the orbital Hall effect of niobium. Composition tuning yields spin‐torque efficiencies of −1.4 to −1.7 and a non‐monotonic efficiency‐resistivity relationship, revealing orbital‐spin synergy beyond conventional spin Hall materials and offering a ...
Chuangwen Wu   +16 more
wiley   +1 more source

CLRe: A Synergistic Dual‐Engine Framework for One‐Step Retrosynthesis Prediction

open access: yesAdvanced Science, EarlyView.
CLRe uses a contrastive difficulty score to order pretrained seq2seq fine‐tuning for retrosynthesis. Reaction embeddings define the ranking score, and a cumulative easy‐to‐hard schedule expands from the easiest subset to the full training set while earlier examples remain active.
Tianhao Su   +5 more
wiley   +1 more source

Verification Conditions are Code

open access: yes, 2006
This paper presents a new theoretical result concerning Hoare Logic. It is shown here that the verification conditions which support a Hoare Logic program derivation are themselves sufficient to construct a correct implementation of the given pre-, post-
Gravell, Andrew M, Andrew M Gravell
core   +1 more source

Substrate Engineering of SWCNT p–n Junctions for Dual‐Mode Power Generation and Heat‐Flux Sensing

open access: yesAdvanced Science, EarlyView.
Through substrate engineering alone, a single‐walled carbon nanotube p–n junction device switches between two functions under uniform infrared irradiation. A low‐absorbance substrate sustains a central hot junction for continuous power generation, whereas high‐absorbance substrates transiently invert the temperature gradient for sensitive heat‐flux ...
Ryota Tamai   +3 more
wiley   +1 more source

Biochemically Constrained Multi‐Omics Integration Reveals Protein–Metabolite Dependencies Across Diseases

open access: yesAdvanced Science, EarlyView.
ProMetNet introduces a biologically constrained deep learning framework for proteo‐metabolomic integration by embedding Reactome‐derived pathway topology into neural networks. It captures non‐linear molecular dependencies and pathway‐level metabolic reorganization, enabling interpretable discrimination.
Minghui Zhao   +6 more
wiley   +1 more source

Neural circuits and symbolic processing. [PDF]

open access: yesNeurobiol Learn Mem, 2021
Do Q, Hasselmo ME.
europepmc   +1 more source

Home - About - Disclaimer - Privacy