Results 81 to 90 of about 2,960,567 (255)
On the Expressiveness of the Approach to Constructing PLC-programs by LTL-Specification
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
The world problem: on the computability of the topology of 4-manifolds [PDF]
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
On parallelism in turing machines [PDF]
A model of parallel computation based on a generalization of nondeterminism in Turing machines is introduced. Complexity classes //T(n)-TIME, //L(n)-SPACE, //LOGSPACE, //PTIME, etc. are defined for these machines in a way analogous to T(n)-TIME, L(n)-SPACE, LOGSPACE, PTIME, etc. for deterministic machines.
openaire +1 more source
Should Dermatologists Recommend Direct‐to‐Consumer App‐Based Remote Diagnostics? An Ethical Analysis
ABSTRACT Background Dermatology patients still face barriers in accessing timely specialist care. As direct‐to‐consumer (DTC) apps for remote dermatological diagnostics proliferate, guidance is lacking. While promising efficiency and efficacy, their clinical—and ethical—legitimacy is not yet well established.
Sonja Mathes +9 more
wiley +1 more source
Involutory Turing Machines [PDF]
An involutory function, also called involution, is a function [Formula: see text] that is its own inverse, i.e., [Formula: see text] holds whenever [Formula: see text] is defined. This paper presents a computational model of involution as a variant of Turing machines, called an involutory Turing machine.
openaire +1 more source
We extend the capabilities of neural networks by coupling them to external memory resources, which they can interact with by attentional processes. The combined system is analogous to a Turing Machine or Von Neumann architecture but is differentiable end-to-end, allowing it to be efficiently trained with gradient descent.
Alex Graves, Greg Wayne, Ivo Danihelka
openaire +2 more sources
Modeling n‐Butyl Acrylate Polymerization using Complementary Modeling Techniques
Two different simulation methods are used for the radical polymerization of nBA: deterministic in Predici and stochastic with mcPolymer. It has been successfully implemented across a wide temperature range. It turns out that the partially different implementation of chain‐length‐dependent termination and β‐scission are important for obtaining ...
Marco Drache +3 more
wiley +1 more source
The article discusses the importance of studying the notion of algorithm and its formal specification using Turing machines. In the article it was identified the basic hypothesis of the theory of algorithms for Turing as well as reviewed scientific ...
Oleksandr B. Yashchyk
doaj
Program Algebra for Turing-Machine Programs
This paper presents an algebraic theory of instruction sequences with instructions for Turing tapes as basic instructions, the behaviours produced by the instruction sequences concerned under execution, and the interaction between such behaviours and ...
Jan A. Bergstra, Cornelius A. Middelburg
doaj +1 more source
Generative AI—the Transgression of Technology
ABSTRACT This article offers a systems‐theoretical analysis of generative artificial intelligence (GenAI) grounded in Niklas Luhmann's sociology of technology. It addresses a central conceptual problem: How GenAI can be understood within a theoretical framework that has traditionally defined technology as a means of stabilising action through causal ...
Jesper Tække
wiley +1 more source

