scientific article
From MaRDI portal
Publication:3682473
zbMATH Open0567.03015MaRDI QIDQ3682473
Publication date: 1983
Title of this publication is not available (Why is that?)
complexity classesarithmetical representation of the normal form of non-deterministic computabilityarithmetization of Turing machine computations
Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10)
Related Items (10)
Title not available (Why is that?) ⋮ The Arithmetic of the Digital Computer: A New Approach ⋮ A review note on arbitrary precision arithmetic ⋮ Making the Case for Pseudodifferential Arithmetic ⋮ Arithmetization of register machines with counters ⋮ On the arithmetic of the BC-system ⋮ A Complete Axiomatization of Computer Arithmetic ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ On Grounding Arithmetic
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3682473)
