HNHacker News
TopNewBestAskShowJobs

marte

18 karma · joined July 11, 2010

Running a one-man consulting business at https://talaksan.com

Co-founder and ex-CTO of https://insynchq.com

submissionscomments
marte··on Ask HN: Who wants to be hired? (October 2020)
Location: Asia-Pacific (e.g. Philippines, Singapore, Australia)

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.

marte··on Ask HN: Freelancer? Seeking freelancer? (October 2020)
SEEKING WORK | Asia-Pacific | Remote

https://talaksan.com

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!

marte··on Why did OKCupid write their own web server?
No, it does. There's a type in Python called "deque" that more closely resembles the performance characteristics of a linked list.

I agree that this is not the main point of the discussion, though.

marte··on 2010 Nobel Prize for Peace Awarded to Liu Xiaobo
It's there, the UI just obscures it. It's actually an accordion and when you click "The Nobel Peace Prize 2010" tab you can see more like the "Press Release".

Regarding the typo: it happens all the time to all kinds of sites.

marte··on Faster Web Development With Virtual Machines at deviantART
virtualenv
marte··on Facebook name extraction based on email/wrong password + POC
There is an option to not send an email. And it's not a request - once you share it, the recipient doesn't need to accept. The users can see them in their GDocs list though. But if you quickly unshare them and they're not currently viewing their list, they'll be unaware of it.
marte··on Facebook name extraction based on email/wrong password + POC
The same can be done for Gmail (and probably Google Apps) users through GDocs. Just share a document to an email address, and GDocs will show you their name.
marte··on Issues in the Proof that P ≠ NP
Would they pursue for the proof in the first place, if not for the prizes (recognition, among others)? I think it's just analogous to how businesses work, with competition, secrecy, etc. And the debate on whether this approach to proof is good or not overall is similar to the debate of capitalism vs. communism.
marte··on Plain english explanation of Big O
Some examples:

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.

marte··on Stack Overflow: Defend PHP - convince me it isn't horrible
Yeah, but if we continue that logic and fill up that "etc etc" it would seem that the other languages have their own bad features and PHP combines them all.