What is the difference between an ambiguity in a proposed algorithm and an ambiguity in the representation of an algorithm?
I have done some research and found out that ambiguity in the representation of an algorithm is when the representation can be understood by a group of people and not clear to another group e.g. a layman and a programmer.
Best Answer
This is discussed in a book Computer Science: An Overview (11th Edition) by J. Glenn Brookshear, in Chapter 5 Algorithms. To start with, author formally defines algorithm as follows:
Further discussion is starting at page 189. Author explains the meaning of ambiguity in what you call "proposed algorithm" as follows:
For the sake of completeness, author points out that above requirement is intentionally narrowed: "In Chapter 12 we will learn that “algorithms,” called nondeterministic algorithms, that do not conform to this restriction are an important topic of research."
Ambiguity of algorithm representation is explained as follows:
Further in the chapter, author also explains how to resolve it: