AI Chat AI Image Generator AI Video Text to Speech

Turing machine interaction problem

05/08/2022

∙

by Marsel Matdinov, et al.

∙

∙

The article introduces some ideas for solving special cases of the following problem, proposed in a somewhat generalized form by Marcus Hutter in 2000. Given two Turing machines A and C, it is required to build a Turing machine B, such that after interacting of A and B on a shared tape for a fixed number of iterations, the machine C outputs 1 on the communication protocol of A and B. Details in the introduction.

page 1

page 2

page 3

page 4

research

∙ 05/27/2010

A Formalization of the Turing Test

The paper offers a mathematical formalization of the Turing test. This f...

0 Evgeny Chutchev, et al. ∙

research

∙ 07/23/2009

Beyond Turing Machines

This paper discusses "computational" systems capable of "computing" func...

0 Kurt Ammon, et al. ∙

research

∙ 01/31/2017

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

The interactive computation paradigm is reviewed and a particular exampl...

0 T. E. Raptis, et al. ∙

research

∙ 01/30/2019

Neuroevolution with Perceptron Turing Machines

We introduce the perceptron Turing machine and show how it can be used t...

0 David Landaeta, et al. ∙

research

∙ 04/30/2021

Human-Machine Interaction in the Light of Turing and Wittgenstein

We propose a study of the constitution of meaning in human-computer inte...

0 Charles Bodon, et al. ∙

research

∙ 12/01/2014

Problem Theory

The Turing machine, as it was presented by Turing himself, models the ca...

0 Ramón Casares, et al. ∙

research

∙ 09/02/2020

Circuit Satisfiability Problem for circuits of small complexity

The following problem is considered. A Turing machine M, that accepts a ...

0 Marsel Matdinov, et al. ∙