In their 1977 work "The Early Development of Programming Languages", Trabb Pardo and Knuth introduced a trivial program that involved arrays, indexing, mathematical functions, subroutines, I/O, conditionals and iteration. They then wrote implementations of the algorithm in several early programming languages to show how such concepts were expressed.

//// TPKA. m// RosettaCode//// Created by Alexander Alvonellos on 5/26/12. // Trabb Pardo-Knuth algorithm// #import <Foundation/Foundation. h>double f(double x); double f(double x) { return pow(abs(x), 0. 5) + 5*(pow(x, 3)); } int main (int argc, const char * argv[]){ @autoreleasepool { NSMutableArray *input = [[NSMutableArray alloc] initWithCapacity:0]; printf("%s", "Instructions: please enter 11 numbers.

Talk:Trabb Pardo–Knuth algorithm From Wikipedia, the free encyclopedia Jump to: navigation, search.

In their 1977 work “The Early Development of Programming Languages”, Trabb Pardo and Knuth introduced a trivial program which involved arrays, indexing, mathematical functions, subroutines, I/O, conditionals and iteration. They then wrote implementations of the algorithm in several early programming languages to show how such concepts were expressed.

I also worked on what could be done to print especially document proofs. At first there were no good page printers, except for the Xerox XGPs (three of them: Stanford, MIT, and CMU) so we interfaced Varian and Versatec electrostatic plotters (I still remember the kerosene smell). Then one day Canon showed up with a prototype laser printer (LBP-10) and I developed an interface for it. I remember the first time we showed it to outside people, and how hungry everybody was to be able to print beyond line printers and Daisy wheels. DW: You are known for the Trabb Pardo-Knuth.

Trabb Pardo Knuth algorithm (TPK) reads an array of 11 numbers, applies a function to each value, checks for overflow and writes the result in reverse order. It is meant to show the variation in expression of different programming languages.