scientific article; zbMATH DE number 3286027
From MaRDI portal
Publication:5569445
Cited in
(6)- The fixed point problem of a simple reversible language
- The efficiency of primitive recursive functions: a programmer's view
- Universality and programmability of quantum computers
- From mathesis universalis to provability, computability, and constructivity
- Consistent ultrafinitist logic
- A note on the notation of recursion in process algebras
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 Q5569445)