Multiway Storage Modification Machines

11/12/2021
by   J. -M. Chauvet, et al.
0

We present a parallel version of Schönhage's Storage Modification Machine, the Multiway Storage Modification Machine (MWSMM). Like the alternative Association Storage Modification Machine of Tromp and van Emde Boas, MWSMMs recognize in polynomial time what Turing Machines recognize in polynomial space. Falling thus into the Second Machine Class, the MWSMM is a parallel machine model conforming to the Parallel Computation Thesis. We illustrate MWSMMs by a simple implementation of Wolfram's String Substitution System.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/28/2021

Compiling Turing Machines into Storage Modification Machines

It is well known that Schönhage's Storage Modification Machines (SMM) ca...
research
08/19/2021

Prof. Schönhage's Mysterious Machines

We give a simple Schönhage Storage Modification Machine that simulates o...
research
12/22/2022

Time and Space Measures for a Complete Graph Computation Model

We present a computation model based on a subclass of GP 2 graph program...
research
11/21/2022

The Berlekamp-Massey Algorithm revisited

We propose a slight modification of the Berlekamp-Massey Algorithm for o...
research
05/05/2014

Universal Memcomputing Machines

We introduce the notion of universal memcomputing machines (UMMs): a cla...
research
08/19/2018

Evolving Algebras 1993: Lipari Guide

Computation models and specification methods seem to be worlds apart. Th...
research
09/20/2021

Machines as Programs: P ≠ NP

The Curry-Howard correspondence is often called the proofs-as-programs r...

Please sign up or login with your details

Forgot password? Click here to reset