Computability Over Arbitrary Fields
From MaRDI portal
Publication:5581612
DOI10.1112/jlms/s2-2.1.73zbMath0188.02502OpenAlexW2076687871MaRDI QIDQ5581612
Stephen D. Isard, Gabor T. Herman
Publication date: 1970
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/jlms/s2-2.1.73
Related Items (3)
An explicit solution to Post's problem over the reals ⋮ Every finite sequential machine is linearly realizable ⋮ On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
This page was built for publication: Computability Over Arbitrary Fields
