Indicate whether each of the following statements about the ς-calculus is
true or false and why.
a) The ς-calculus is confluent; therefore each expression has at most one
normal form in this calculus.
b) The ς-calculus does not have an operation to add methods to an object;
therefore it is not a Turing-complete model of computation.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here