Laszlo Kalmar. Egyszeru pelda eldonthetetlen aritmetikai problemara (Ein einfaches Beispiel fur ein unentsheidbares arithmetisches Problem). Matematikai es zikai lapok 50, 1943, pp. 1-23. Hungarian with German abstract. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Parallel Beta Reduction is Not Elementary Recursive - Asperti, Mairson (1998) (5 citations) (Correct)
....nonelementary complexity was originally proven by Meyer [Mey74] It is very easy to give a brief description of the proof of our lower bound, if the reader has a nodding familiarity with sharing graphs. We de ne the Kalm ar elementary functions K (n) as K 0 (n) n, and K t 1 (n) 2 K t (n) [Kal43]. 2 Main Theorem. Let 0 be any xed integer. Then there exists a set of explicitly typed, closed terms En : Bool, where jEn j = O(n) En normalizes in O(jEn j) parallel steps, and the time needed to implement the parallel steps, on any rst class machine model 1 , grows as K ....
Laszlo Kalmar. Egyszeru pelda eldonthetetlen aritmetikai problemara (Ein einfaches Beispiel fur ein unentsheidbares arithmetisches Problem). Matematikai es zikai lapok 50, 1943, pp. 1-23. Hungarian with German abstract.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC