L = {an bn an| n = 1, 2, 3...} is recursively enumerable

Recursive languages are closed under union

Every recursive is closed under union

All of these

stored program computers

interpretative implementation of program­ming language

computability

all of these

1

2

3

4

TRUE

FALSE

still an open question

all of these

stable

unsolvable

partially solvable

unstable