Non-structured programming
 | This article or section is in a state of significant expansion or restructuring. You are welcome to assist in its construction by editing it as well. If this article or section has not been edited in several days, please remove this template. If you are the editor who added this template and you are actively editing, please be sure to replace this template with {{in use}} during the active editing session. Click on the link for template parameters to use.
This article was last edited by Dojarca (talk | contribs) 16 years ago. (Update timer) |
Non-structured programming is the historically earliest programming paradigm capable of creating Turing-complete algorithms.