B
Bruce Durdle
I can't let this go unchallenged!
Charles said:
> The fundamental logic has not changed much either, nor have computer
> activities. All higher-level computer languages (i.e., in software) are
> ultimately decomposable to, hence built up from, sequences and combinations
> of the Boolean operations (AND, NOT, and combinations) and STORE.
So? That's not necessarily a limitation - it's a fact of Boolean life. Similarly, I could state that "All arithmetic operations are made up from additions and complements" - that's two basic operations. It doesn't stop me from using a defined combination of these to do multiplications, logarithms, or trigonometric functions - I don't have to explicitly use multiple additions to get these results.
Bruce.
Charles said:
> The fundamental logic has not changed much either, nor have computer
> activities. All higher-level computer languages (i.e., in software) are
> ultimately decomposable to, hence built up from, sequences and combinations
> of the Boolean operations (AND, NOT, and combinations) and STORE.
So? That's not necessarily a limitation - it's a fact of Boolean life. Similarly, I could state that "All arithmetic operations are made up from additions and complements" - that's two basic operations. It doesn't stop me from using a defined combination of these to do multiplications, logarithms, or trigonometric functions - I don't have to explicitly use multiple additions to get these results.
Bruce.