marte
Remote: Yes (and only)
Skills: Python, SQL/NoSQL & Database Design, Desktop APIs (e.g. macOS/Cocoa, Windows), Web/Cloud APIs (e.g. Google, Microsoft, OAuth), JavaScript & HTML/CSS, Data Structures & Algorithms, Networking, Security, DevOps, Linux, Product Development, Startups, Architecture & Design of whole systems
Resume: https://talaksan.com
Email: marte [at] talaksan [dot] com
Looking for: problems to solve! I'm available for consulting / freelancing. If you have a problem, I'll help you develop ideas to solve it. If you have an idea, I can quickly prototype a system to implement it. If you have a system, I can help improve and fix issues in it.
I love solving problems through application development, from ideation to launching and iteration. If you have a problem, I'll help you develop ideas to solve it. If you have an idea, I can quickly prototype a system to implement it. If you have a system, I can help improve and fix issues in it.
As (former) CTO of Insync (https://insynchq.com/), I became proficient in many technologies (e.g. Python, SQL/NoSQL Databases, macOS & Windows APIs, JavaScript, Web/Cloud APIs, Networking, HTML/CSS, Linux) and different aspects of software engineering (e.g. Architecture & Design, DevOps, Security, Training, People Management). As its co-founder, I had great experience in product development and cultivating company culture.
I built a solid foundation by having fun doing sport programming, which made me fluent in data structures & algorithms, and joining hackathons, which exposed me to new paradigms & problem domains. I've won (or placed) in plenty of competitions along the way (see my website for details).
Hit me up at marte [at] talaksan [dot] com if you have problems to solve!
I agree that this is not the main point of the discussion, though.
Regarding the typo: it happens all the time to all kinds of sites.
Even though Winograd's algorithm (matrix multiplication) is theoretically faster than Strassen's, the constant is so high that Winograd's is only faster in matrices so large you can't practically compute in the first place.
Quicksort is a more familiar example. Although its worst case complexity is O(n^2), many techniques have been invented to avoid the worst cases and execute in just O(n log n) (average case), and it's usually faster than merge sort in practice.