Stack automatons are machines that cannot perform every function of a Turing machine but can effectively recognize solutions for certain problems. Steve Cook's research showed that stack automatons could recognize languages of any length, a notable feat that modern computers cannot easily achieve.