paper-with-me

홈 › Papers

'Viral' Turing Machines, Computation from Noise and Combinatorial Hierarchies

2017-01-31 · T. E. Raptis

The interactive computation paradigm is reviewed and a particular example is extended to form the stochastic analog of a computational process via a transcription of a minimal Turing Machine into an equivalent asynchronous Cellular Automaton with an exponential waiting times distribution of effective transitions. Furthermore, a special toolbox for analytic derivation of recursive relations of important statistical and other quantities is introduced in the form of an Inductive Combinatorial Hierarchy.

📄 PDF Abstract BibTeX arXiv:1702.06000

Code (0)

등록된 구현이 없습니다.

Tasks

Form

Similar Papers 제목 키워드 기반

Noise-injected analog Ising machines enable ultrafast statistical sampling and machine learning

2021-12-21 · Fabian Böhm, Diego Alonso-Urquijo, Guy Verschaffelt, Guy Van der Sande

Ising machines are a promising non-von-Neumann computational concept for neural network training and combinatorial optimization. However, while various neural networks can be implemented with Ising machines, their inabil…

BIG-bench Machine LearningCombinatorial Optimization

Directed percolation and numerical stability of simulations of digital memcomputing machines

2021-02-06 · Yuan-Hang Zhang, Massimiliano Di Ventra

Digital memcomputing machines (DMMs) are a novel, non-Turing class of machines designed to solve combinatorial optimization problems. They can be physically realized with continuous-time, non-quantum dynamical systems wi…

Combinatorial Optimization

Evolutionary Turing in the Context of Evolutionary Machines

2013-04-13 · Mark Burgin, Eugene Eberbach

One of the roots of evolutionary computation was the idea of Turing about unorganized machines. The goal of this work is the development of foundations for evolutionary computations, connecting Turing's ideas and the con…

Mamba Meets Scheduling: Learning to Solve Flexible Job Shop Scheduling with Efficient Sequence Modeling

2026-02-25 · Zhi Cao, Cong Zhang, Yaoxin Wu, Yaqing Hou 외 arxiv

The Flexible Job Shop Problem (FJSP) is a well-studied combinatorial optimization problem with extensive applications for manufacturing and production scheduling. It involves assigning jobs to various machines to optimiz…

Reservoir memory machines

2020-02-12 · Benjamin Paassen, Alexander Schulz

In recent years, Neural Turing Machines have gathered attention by joining the flexibility of neural networks with the computational capabilities of Turing machines. However, Neural Turing Machines are notoriously hard t…

regression