AI Chat AI Image Generator AI Video Text to Speech

A conservative Turing complete S^4 flow

08/28/2023

∙

by Pablo Suárez-Serrato, et al.

∙

We present a Turing complete, volume preserving, smooth flow on the 4-sphere.

READ FULL TEXT

page 1

page 2

page 3

page 4

research

∙ 10/18/2021

Turing Tumble is Turing-Complete

It is shown that the toy Turing Tumble, suitably extended with an infini...

0 Lenny Pitt, et al. ∙

research

∙ 04/11/2021

Hausdorff approximations and volume of tubes of singular algebraic sets

We prove bounds for the volume of neighborhoods of algebraic sets, in th...

0 Saugata Basu, et al. ∙

research

∙ 08/31/2022

Python Type Hints are Turing Complete

Grigore showed that Java generics are Turing complete by describing a re...

0 Ori Roth, 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

∙ 03/11/2019

The relationship between word complexity and computational complexity in subshifts

We prove several results about the relationship between the word complex...

0 Ronnie Pavlov, et al. ∙

research

∙ 05/03/2021

Turing Number: How Far Are You to A. M. Turing Award?

The ACM A.M. Turing Award is commonly acknowledged as the highest distin...

0 Feng Xia, et al. ∙

research

∙ 09/30/2021

Robustness of non-computability

Turing computability is the standard computability paradigm which captur...

0 Daniel S. Graça, et al. ∙

A conservative Turing complete S^4 flow

Related Research

Turing Tumble is Turing-Complete

Hausdorff approximations and volume of tubes of singular algebraic sets

Python Type Hints are Turing Complete

Problem Theory

The relationship between word complexity and computational complexity in subshifts

Turing Number: How Far Are You to A. M. Turing Award?

Robustness of non-computability