program 'elegant proof would solve halting problem ibid ''algorithm versus function computable algorithm'' given function multiple algorithms may exist true even without expanding available instruction set available programmer rogers observes important distinguish notion ''algorithm'' ie procedure notion ''function computable algorithm'' ie mapping yielded procedure function may several different algorithms unfortunately may tradeoff goodness speed elegance compactness elegant program may take steps complete
Formal science Computer science Algorithms