Results 11 to 20 of about 134,383 (239)
The $\pi$-Calculus is Behaviourally Complete and Orbit-Finitely Executable [PDF]
Logical Methods in Computer Science, 2021 Reactive Turing machines extend classical Turing machines with a facility to model observable interactive behaviour. We call a behaviour (finitely) executable if, and only if, it is equivalent to the behaviour of a (finite) reactive Turing machine.
Bas Luttik, Fei Yang
doaj +1 more source
Some undecidable problems about the trace-subshift associated to a Turing machine [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 We consider three problems related to dynamics of one-tape Turing machines: Existence of blocking configurations, surjectivity in the trace, and entropy positiveness. In order to address them, a reversible two-counter machine is simulated by a reversible
Anahí Gajardo +2 more
doaj +1 more source
How Hard Is It to Detect Surveillance? A Formal Study of Panopticons and Their Detectability Problem
Cryptography, 2022 The Panopticon (which means “watcher of everything”) is a well-known prison structure of continuous surveillance and discipline studied by Bentham in 1785. Today, where persistent, massive scale, surveillance is immensely facilitated by new technologies,
Vasiliki Liagkou +3 more
doaj +1 more source
Quaternionic quantum Turing machines
Frontiers in Physics, 2023 Quaternionic quantum theory is an extension of the standard complex quantum theory. Inspired by this, we study the quaternionic quantum computation using quaternions.
Songsong Dai
doaj +1 more source
Features requirement elicitation process for designing a chatbot application
IET Networks, EarlyView., 2022 This article seeks to assist the chatbot community by outlining the characteristics that a chatbot needs to possess and explaining how to create a chatbot for a bank. In order to determine which capabilities are most crucial to ending users, a study of a small sample of chatbot users was conducted.
Nurul Muizzah Johari +4 more
wiley +1 more source
Molecular system for an exponentially fast growing programmable synthetic polymer
Scientific Reports, 2023 In this paper, we demonstrate a molecular system for the first active self-assembly linear DNA polymer that exhibits programmable molecular exponential growth in real time, also the first to implement “internal” parallel insertion that does not rely on ...
Nadine Dabby, Alan Barr, Ho-Lin Chen
doaj +1 more source
A Small Universal Petri Net [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 A universal deterministic inhibitor Petri net with 14 places, 29 transitions and 138 arcs was constructed via simulation of Neary and Woods' weakly universal Turing machine with 2 states and 4 symbols; the total time complexity is exponential in the ...
Dmitry A. Zaitsev
doaj +1 more source
Turing Automata and Graph Machines [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 Indexed monoidal algebras are introduced as an equivalent structure for self-dual compact closed categories, and a coherence theorem is proved for the category of such algebras.
Miklós Bartha
doaj +1 more source
Testing technology for tensile properties of metal materials based on deep learning model
Frontiers in Neurorobotics, 2022 The properties of metallic materials have been extensively studied, and nowadays the tensile properties testing techniques of metallic materials still have not found a suitable research method.
Xuewen Chen, Weizhong Fan, Weizhong Fan
doaj +1 more source
Reflector – A Dynamic Manifestation of Turing Machines with Time and Space Complexity Analysis
JISR on Computing, 2013 The Turing Machine model has proven to be capable of simulating every known computational model. Since its inception the model has served as the basis on which computational devices have been constructed.
Behroz Mirza, Muhammad Rafi
doaj +1 more source