Maybe I should&#x27;ve just said Lambda Calculus, which is waht I was thinking. Von Neumann architecture is prevailing implementation of it because Von Neumann machines prevail. However, functions operating on state w&#x2F; I&#x2F;O don&#x27;t require a CPU or main memory: LISP&#x2F;Scheme have been directly synthesized to hardware. That means you can describe non-Von Neumann architecture with LISP in a way that produces actual hardware. So, Lambda Calculus being a separate concept and fact that it can use non-Von Neumann implementations mean a Lambda Calculus implementation is non-Von Nuemann but can be if chosen.<p>That&#x27;s what I was thinking. Unless those with more experience in Lambda Calculus, etc tell me [with evidence] that Lambda Calculus is von-Neumann, so is any LISP&#x2F;Scheme, and never can be implemented alternatively.