scientific article; zbMATH DE number 3105099

zbMath0063.03115MaRDI QIDQ5843849

L. Kalmár

Publication date: 1943

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Related Items

An analog characterization of the Grzegorczyk hierarchy ⋮ Some observations on the connection between counting and recursion ⋮ Computation models and function algebras ⋮ On the operations of bounded suffix summation and multiplication ⋮ Kalmár's Argument Against the Plausibility of Church's Thesis ⋮ Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations ⋮ Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity ⋮ Parallel beta reduction is not elementary recursive ⋮ Complexity of the search for the least solution to a system of dictionary equations of exponential type