Results 91 to 100 of about 2,596,832 (272)
On the Expressiveness of the Approach to Constructing PLC-programs by LTL-Specification
Моделирование и анализ информационных систем, 2015 The article is devoted to the approach to constructing and verification of discrete PLC-programs by LTL-specification. This approach provides an ability of correctness analysis of PLC-programs by the model checking method.
E. V. Kuzmin +2 more
doaj +1 more source
Advanced Quantum Technologies, EarlyView.The hybrid approach to Quantum Supervised Machine Learning is compatible with Noisy Intermediate Scale Quantum (NISQ) devices but hardly useful. Pure quantum kernels requiring fault‐tolerant quantum computers are more promising. Examples are kernels computed by means of the Quantum Fourier Transform (QFT) and kernels defined via the calculation of ...
Massimiliano Incudini +2 more
wiley +1 more source
Information and Control, 1977 A structured decomposition theorem for Turing machines is given. The nature of the building blocks and the form of the connections allowed suggest a parallel to the Bohm-Jacopini theorem on structured flowcharts. Thus in a broadest sense, there is obtained an independent machine-theoretic restatement of the fundamental precepts of structured ...
openaire +2 more sources
Reactor Design for Chemical Reaction‐Diffusion Systems
ChemSystemsChem, EarlyView.This review discusses methods for the design of reactors for studying reaction‐diffusion (RD) phenomena. Abstract The experimental study of reaction–diffusion‐driven chemical and biological systems is a key to understanding pattern formation in nature. Starting from experiments performed in a Petri dish or test tube, various reactors have been designed
Brigitta Dúzs +2 more
wiley +1 more source
QRS Detection in Noisy Electrocardiogram Based on Multi‐Parameter Constrained Stochastic Resonance
IEEJ Transactions on Electrical and Electronic Engineering, EarlyView.One major challenge of QRS wave detection is the deleterious impact of inevitable noise in electrocardiogram (ECG) signals, which can deteriorate the detection performance of algorithms. Previous research has shown a nonlinear monostable potential‐based algorithm for enhancing the QRS complex in a noisy environment. Its main mechanism is the stochastic
Wenyu Shang, Masaki Sekino
wiley +1 more source
The world problem: on the computability of the topology of 4-manifolds [PDF]
, 2005 Topological classification of the 4-manifolds bridges computation theory and physics. A proof of the undecidability of the homeomorphy problem for 4-manifolds is outlined here in a clarifying way.
van Meter, James R.
core +3 more sources
The Group of Reversible Turing Machines [PDF]
, 2016 We consider Turing machines as actions over configurations in $ ^{\mathbb{Z}^d}$ which only change them locally around a marked position that can move and carry a particular state. In this setting we study the monoid of Turing machines and the group of reversible Turing machines.
Barbieri, Sebastián +2 more
openaire +5 more sources
Turing complete neural computation based on synaptic plasticity.
PLoS ONE, 2019 In neural computation, the essential information is generally encoded into the neurons via their spiking configurations, activation values or (attractor) dynamics.
Jérémie Cabessa
doaj +1 more source
Rehumanizing Higher Education: Fostering Humanity in the Era of Machine Learning
New Directions for Teaching and Learning, EarlyView.ABSTRACT Recent advancements in artificial intelligence (AI) have raised contentious questions and spawned divided opinions regarding the future of education. The polarization it brings to the academy seems to be breaking between the soft and hard disciplines and is reminiscent of the Science Wars of the 1990s. This chapter highlights the philosophical
Joseph Carver, Samba Bah
wiley +1 more source
On the Transition Graphs of Turing Machines [PDF]
Theoretical Computer Science, 2001 AbstractAs for pushdown automata, we consider labelled Turing machines with ε-rules. With any Turing machine M and with a rational set C of configurations, we associate the restriction to C of the ϵ-closure of the transition set of M. We get the same family of graphs by using the labelled word rewriting systems.
openaire +2 more sources