Who proved that a machine capable of processing a stream of s and s what capable of solving any problem?

Alan Turing proved that a machine capable of processing a stream of symbols, known as the Turing machine, could theoretically solve any problem that is computable. His work laid the foundation for modern computer science and established the concept of algorithmic computation. Turing's findings demonstrated that, given sufficient time and resources, such a machine could perform any calculation that can be algorithmically defined.