Results 61 to 70 of about 2,960,567 (255)
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
Fabric‐Based Wearable Robotic Exoskeleton Gloves: Advancements and Challenges
Advanced Materials Technologies, EarlyView.This review highlights interdisciplinary technological advances in fabric‐based robotic gloves, focusing on progress in design, fabrication, actuation, sensing, control, and power and energy requirements. It also addresses performance testing and validation, including biomechanical, strength, functional, user experience, and durability assessments, to ...
Ayse Feyza Yilmaz +2 more
wiley +1 more source
Executable Behaviour and the π-Calculus (extended abstract) [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 Reactive Turing machines extend classical Turing machines with a facility to model observable interactive behaviour. We call a behaviour executable if, and only if, it is behaviourally equivalent to the behaviour of a reactive Turing machine.
Bas Luttik, Fei Yang
doaj +1 more source
Information Transmission Strategies for Self‐Organized Robotic Aggregation
Advanced Robotics Research, EarlyView.In this review, we discuss how information transmission influences the neighbor‐based self‐organized aggregation of swarm robots. We focus specifically on local interactions regarding information transfer and categorize previous studies based on the functions of the information exchanged.
Shu Leng +5 more
wiley +1 more source
Fuzzy Kolmogorov Complexity Based on a Classical Description
Entropy, 2020 In this paper, we give a definition for fuzzy Kolmogorov complexity. In the classical setting, the Kolmogorov complexity of a single finite string is the length of the shortest program that produces this string.
Songsong Dai
doaj +1 more source
Decision Problems For Turing Machines [PDF]
, 2009 We answer two questions posed by Castro and Cucker, giving the exact complexities of two decision problems about cardinalities of omega-languages of Turing machines.
Dominique Lecomte +2 more
core +3 more sources
Weight-reducing Turing machines
Information and Computation, 2023 It is well-known that one-tape Turing machines working in linear time are no more powerful than finite automata, namely they recognize exactly the class of regular languages. We prove that it is not decidable if a one-tape machine works in linear time, even if it is deterministic and restricted to use only the portion of the tape which initially ...
Guillon, Bruno +3 more
openaire +2 more sources
Advanced Science, EarlyView.We introduce AutomataGPT, a generative pretrained transformer (GPT) trained on synthetic spatiotemporal data from 2D cellular automata to learn symbolic rules. Demonstrating strong performance on both forward and inverse tasks, AutomataGPT establishes a scalable, domain‐agnostic framework for interpretable modeling, paving the way for future ...
Jaime A. Berkovich +2 more
wiley +1 more source
What Can Deep Neural Networks Teach Us About Embodied Bounded Rationality
Frontiers in Psychology, 2022 “Rationality” in Simon's “bounded rationality” is the principle that humans make decisions on the basis of step-by-step (algorithmic) reasoning using systematic rules of logic to maximize utility. “Bounded rationality” is the observation that the ability
Edward A. Lee
doaj +1 more source
A Generator for Turing Machine Simulating Programs - User's Manual - [PDF]
, 1986 By means of some sample dialogues we show the use of a program to generate Berkeley Pascal programs from Turing machine descriptions such that these Pascal programs simulate the behavior of the corresponding Turing ...
Asveld, Peter R.J., Boiten, Eerke A.
core +1 more source