HackerPapers

arXiv:1702.06000cs.AI

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

T. E. Raptis

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

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.

arXiv comments
24 p., 4 figures
Journal reference
DOI
doi:10.1016/j.chaos.2017.09.033
Subjects
cs.AIArtificial Intelligence nlin.CGCellular Automata and Lattice Gases

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Jun 2018 to Jun 2018.

Comments linking this paper, per year.

Discussed in comments1 thread

  1. Are real numbers really real? 1 comment
    • Originally I wanted to make a point here about Interactive Computation, the strong Church-Turing hypothesis and persistent Turing Machines, however, while checking on the latest research in that area before doing so, I found the following paper: https://arxiv.org/abs/1702.06000…

      no_identdView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.