scientific article
From MaRDI portal
Publication:3787999
zbMATH Open0645.03047MaRDI QIDQ3787999
Publication date: 1987
Title of this publication is not available (Why is that?)
abstract computability theory in algebraic systemsfinite algorithmic procedures with counters and stacks
Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Abstract and axiomatic computability and recursion theory (03D75)
Related Items (2)
A nondeterministic extension over finitely recursive process model ⋮ Nondeterministic polynomial-time computations and models of 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 Q3787999)
