scientific article; zbMATH DE number 3672268
From MaRDI portal
Publication:3869322
Cites work
- A Machine-Independent Theory of the Complexity of Recursive Functions
- A mathematical logic without variables. I
- Abstract computational complexity and cycling computations
- GEDANKEN—a simple typeless language based on the principle of completeness and the reference concept
- scientific article; zbMATH DE number 3672268 (Why is no real title available?)
- scientific article; zbMATH DE number 3485195 (Why is no real title available?)
- scientific article; zbMATH DE number 3518770 (Why is no real title available?)
- scientific article; zbMATH DE number 3532922 (Why is no real title available?)
- scientific article; zbMATH DE number 3557747 (Why is no real title available?)
- scientific article; zbMATH DE number 3568542 (Why is no real title available?)
- scientific article; zbMATH DE number 3605901 (Why is no real title available?)
- scientific article; zbMATH DE number 3280068 (Why is no real title available?)
- scientific article; zbMATH DE number 3322510 (Why is no real title available?)
- scientific article; zbMATH DE number 3344561 (Why is no real title available?)
- scientific article; zbMATH DE number 3423994 (Why is no real title available?)
- Recursive functions of symbolic expressions and their computation by machine, Part I
- Types in combinatory logic
Cited in
(2)
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 Q3869322)