English
Related papers

Related papers: Recombinations of Busy Beaver Machines

200 papers

This paper constructively proves the existence of an effective procedure generating a computable (total) function that is not contained in any given effectively enumerable set of such functions. The proof implies the existence of machines…

Artificial Intelligence · Computer Science 2010-05-05 Kurt Ammon

Developing robust locomotion for humanoid robots is a complex task due to the unstable nature of these robots and also to the unpredictability of the terrain. A robust locomotion planner is one of the fundamental components for generating…

Robotics · Computer Science 2019-09-17 Mohammadreza Kasaei , Nuno Lau , Artur Pereira

We consider computations of a Turing machine subjected to noise. In every step, the action (the new state and the new content of the observed cell, the direction of the head movement) can differ from that prescribed by the transition…

Computational Complexity · Computer Science 2021-12-07 Ilir Çapuni , Peter Gács

The architecture of neural Turing machines is differentiable end to end and is trainable with gradient descent methods. Due to their large unfolded depth Neural Turing Machines are hard to train and because of their linear access of…

Neural and Evolutionary Computing · Computer Science 2016-12-08 Janez Aleš

Complex problems, whether in math, logic, or planning, are solved by humans through a sequence of steps where the result of one step informs the next. In this work, we adopt the perspective that the reasoning power of Transformers is…

Machine Learning · Computer Science 2026-02-23 Mohan Tang , Sidi Lu

The human brain has immense learning capabilities at extreme energy efficiencies and scale that no artificial system has been able to match. For decades, reverse engineering the brain has been one of the top priorities of science and…

At first glance, one-state Turing machines are very weak: the halting problem for them is decidable, and, without memory, they cannot even accept a simple one element language such as $L = \{ 1 \}$ . Nevertheless it has been showed that a…

Formal Languages and Automata Theory · Computer Science 2019-01-23 Marzio De Biasi

The current cycle of hype and anxiety concerning the benefits and risks to human society of Artificial Intelligence is fuelled, not only by the increasing use of generative AI and other AI tools by the general public, but also by claims…

Human-Computer Interaction · Computer Science 2025-01-30 Sharon Temtsin , Diane Proudfoot , David Kaber , Christoph Bartneck

Machine learning applications are computationally demanding and power intensive. Hardware acceleration of these software tools is a natural step being explored using various technologies. A recurrent processing unit (RPU) is fast and…

Emerging Technologies · Computer Science 2019-12-17 Heidi Komkov , Alessandro Restelli , Brian Hunt , Liam Shaughnessy , Itamar Shani , Daniel P. Lathrop

Hypercomputation or super-Turing computation is a ``computation'' that transcends the limit imposed by Turing's model of computability. The field still faces some basic questions, technical (can we mathematically and/or physically build a…

Quantum Physics · Physics 2007-05-23 Vadim A. Adamyan , Cristian S. Calude , Boris S. Pavlov

Transformers demonstrate impressive performance on a range of reasoning benchmarks. To evaluate the degree to which these abilities are a result of actual reasoning, existing work has focused on developing sophisticated benchmarks for…

Machine Learning · Computer Science 2024-07-02 Jannik Brinkmann , Abhay Sheshadri , Victor Levoso , Paul Swoboda , Christian Bartelt

We revisit the planning problem in the blocks world, and we implement a known heuristic for this task. Importantly, our implementation is biologically plausible, in the sense that it is carried out exclusively through the spiking of…

Artificial Intelligence · Computer Science 2022-11-22 Francesco d'Amore , Daniel Mitropolsky , Pierluigi Crescenzi , Emanuele Natale , Christos H. Papadimitriou

Current approaches for scaling inference-time compute in transformers train them to emit explicit chain-of-thought tokens before producing an answer. While these methods are powerful, they are limited because they cannot be applied during…

Machine Learning · Computer Science 2026-02-02 Houjun Liu , Shikhar Murty , Christopher D. Manning , Róbert Csordás

The world has seen the emergence of machines based on pretrained models, transformers, also known as generative artificial intelligences for their ability to produce various types of content, including text, images, audio, and synthetic…

Artificial Intelligence · Computer Science 2024-10-10 Bernardo Gonçalves

Transformers are central to recent successes in natural language processing and computer vision. Transformers have a mostly uniform backbone where layers alternate between feed-forward and self-attention in order to build a deep network.…

The applicability of computational models to the biological world is an active topic of debate. We argue that a useful path forward results from abandoning hard boundaries between categories and adopting an observer-dependent, pragmatic…

Multiagent Systems · Computer Science 2022-12-22 Joshua Bongard , Michael Levin

The notion of quantum Turing machines is a basis of quantum complexity theory. We discuss a general model of multi-tape, multi-head Quantum Turing machines with multi final states that also allow tape heads to stay still.

Quantum Physics · Physics 2007-05-23 Tomoyuki Yamakami

The inner operations of the human brain as a biological processing system remain largely a mystery. Inspired by the function of the human brain and based on the analysis of simple neural network systems in other species, such as Drosophila,…

Neural and Evolutionary Computing · Computer Science 2022-01-20 Zuo-Wei Yeh , Chia-Hua Hsu , Alexander White , Chen-Fu Yeh , Wen-Chieh Wu , Cheng-Te Wang , Chung-Chuan Lo , Kea-Tiong Tang

We have designed a machine that becomes increasingly better at behaving in underspecified circumstances, in a goal-directed way, on the job, by modeling itself and its environment as experience accumulates. Based on principles of…

Transformer-based models can perform complicated reasoning by generating reasoning paths token by token. While effective, this approach often requires generating thousands of tokens to solve a single problem, which can be slow and…

Machine Learning · Computer Science 2026-05-05 Jiayu Liu , Zhenya Huang , Xuan Yang , Tianyun Ji , Anya Sims , Hao Xu , Enhong Chen , Yee Whye Teh , Ning Miao