scientific article; zbMATH DE number 2066189
From MaRDI portal
Publication:4462632
zbMath1094.68038arXivmath/0301274MaRDI QIDQ4462632
Publication date: 18 May 2004
Full work available at URL: https://arxiv.org/abs/math/0301274
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Number-theoretic algorithms; complexity (11Y16) Turing machines and related notions (03D10)
Related Items (5)
Towards finite-fold Diophantine representations ⋮ The quest for Diophantine finite-fold-ness ⋮ Hypercomputation with quantum adiabatic processes ⋮ Why there is no such discipline as hypercomputation ⋮ What can and cannot be done with Diophantine problems
This page was built for publication: