COMPUTATIONAL COMPLEXITY AND BIG O NOTATION
Join SWFL Coders and James English on this awesome presentation on computer science.
Programming techniques might be called "linear," "log time," or "O(1)." Problems can be labeled "Polynomial" or "NP-Complete." This is the language of computational complexity and Big O Notation, a powerful tool used by programmers to measure the difficulty of problems and quality of solutions. This talk will cover the meaning and language of computational complexity as used in practice by programmers. It will be shown how it applies to common parts of a program, like data storage and sorting. Additional examples will be given from the domains of robotics, cryptocurrency, and machine learning. This foundation will lead to discussion of the philosophical aspects and fundamental limits of programming and computing
6:30 - Arrival /Networking
6:45 - Introduction and announcements by the organizers
6:50 - Companies/Employers Needs: Connect to local developers
7:00 - Computational Complexity and Big O Notation
8:20 - Wrap Up
8:30 - After party celebration
ABOUT THE SPEAKER:
James English is the President and CTO of Energid Technologies, a robotics software company.