scientific article; zbMATH DE number 3105099
From MaRDI portal
Publication:5843849
zbMATH Open0063.03115MaRDI QIDQ5843849FDOQ5843849
Authors: L. Kalmár 
Publication date: 1943
Title of this publication is not available (Why is that?)
Cited In (10)
- A note on the relation between polynomial time functionals and Constable's class \(\mathcal K\)
- Some observations on the connection between counting and recursion
- Kalmár's argument against the plausibility of Church's thesis
- Complexity of the search for the least solution to a system of dictionary equations of exponential type
- Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity
- An analog characterization of the Grzegorczyk hierarchy
- Computation models and function algebras
- Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations
- Parallel beta reduction is not elementary recursive
- On the operations of bounded suffix summation and multiplication
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 Q5843849)
