Pith. sign in

On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

citation-role summary

background 1

citation-polarity summary

fields

cs.NE 1

years

2025 1

verdicts

REJECT 1

roles

background 1

polarities

background 1

representative citing papers

Neural Field Turing Machine: A Differentiable Spatial Computer

cs.NE · 2025-08-27 · reject · novelty 4.0

NFTM is a differentiable architecture with spatial read/write heads that claims Turing completeness and demonstrates learning local update rules for cellular automata, heat PDE, and CIFAR-10 inpainting.

citing papers explorer

Showing 1 of 1 citing paper.

  • Neural Field Turing Machine: A Differentiable Spatial Computer cs.NE · 2025-08-27 · reject · none · ref 3

    NFTM is a differentiable architecture with spatial read/write heads that claims Turing completeness and demonstrates learning local update rules for cellular automata, heat PDE, and CIFAR-10 inpainting.