Results 81 to 90 of about 3,677,609 (156)
On The Recursive Enumerability of . . .
We show that the set of fixed-point combinators forms a recursively-enumerable subset of a larger set of terms that is (A) not recursively enumerable, and (B) the terms of which are observationally equivalent to fixed-point combinators in any ...
Mayer Goldberg
core
Intuitionistic fuzzy recursive enumerable languages and its closure properties [PDF]
M. Rajasekar, V. Sumathi
openaire +1 more source
Geranium: Multimodal Retrieval of Genomics Data Visualizations. [PDF]
Nguyen HN +5 more
europepmc +1 more source
Complexity Measures for Language Recognition by Canonic Systems
A canonic system C is a specification of a recursively enumerable set, such as a set of strings over a finite alphabet. From this description C, it is possible to generate a system C , called a proof measure function, which is an indication of the ...
Haggerty, Joseph P.
core
Universal Nonlinear Spiking Neural P Systems with Delays and Weights on Synapses. [PDF]
Wang L, Liu X, Zhao Y.
europepmc +1 more source
Neuro-symbolic AI for auditable cognitive information extraction from medical reports. [PDF]
Prenosil GA +8 more
europepmc +1 more source
Recursively Enumerable Reals and Chaitin Omega Numbers
A real α is called recursively enumerable if it can be approximated by an increasing, recursive sequence of rationals. The halting probability of a universal self- delimiting Turing machine (Chaitin's Ω number, [10]) is a random r.e. real.
Khoussainov, B +3 more
core
A Physical Framework for Algorithmic Entropy. [PDF]
Edmonds J.
europepmc +1 more source
We introduce two-sided sticker systems, the two-sided variant of a computability model introduced 5 as an abstraction of Adleman's style of DNA computing 1 and of the matching of the so-called Watson-Crick complements.
Rudolf Freund +3 more
core

