theory - What computer science theorem is this? -


i've got study note ten years ago i've written:

all power of programming available in language supports 3 things:

  • step step execution (statements)
  • altering flow of execution based on conditions (branch selection)
  • performing execution repeatedly in loop.

    i have 3 questions:

  • 1) first postulated this?

    2) first proved it? (i remember proof relatively recent.)

    3) popular book or text source this?

    googling hasn't given me answers. :-(

    you thinking of structured program theorem, demonstrates language features can compute computable function.

    as wikipedia states, stated in form corrado böhm , giuseppe jacopini in 1966, can traced further regular languages.


    Comments

    Popular posts from this blog

    python - Subclassed QStyledItemDelegate ignores Stylesheet -

    java - HttpClient 3.1 Connection pooling vs HttpClient 4.3.2 -

    SQL: Divide the sum of values in one table with the count of rows in another -