![Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5928/TOC-Subject-Sample-2021-Computer-Science.jpg"})
Abstract
Most attempts to explain some aspect of computation formally have relied on a single formalism. This paper presents examples of a blending of two well-known formalisms, the ,λ-calculus and Markov normal algorithms, and illustrates the additional expressive power of the combined formalism.