Philosophy Now Forum

I am trying to validate the simplest possibly notion of a formal system as relations between finite strings. I know that Lambda Calculus has the expressive power of a Turing Machine: <λexp> ::= < var > | λ . <λexp> | ( <λexp> <λexp> ) I was thinking that it might be possible so somehow convert the ...