Communities and Collections

Posts

Moda Operandi is the global destination for luxury fashion, providing bespoke access, brand discovery, and unparalleled curation. At M'O you will have the unique opportunity to innovate, inspire others, and engage with fashion at the highest level.

Last Dec we raised 160MM

https://www.crunchbase.com/organization/moda-operandi

We just got a new CEO after our last one retired. He came from Tesla, where he was the Vice President in charge of developing the North America and EMEA markets.

https://www.marketwatch.com/press-release/moda-operandi-names-ganesh-srivats-as-ceo-2018-07-23

We are expanding like crazy. So fast that I posted the job descriptions in an S3 bucket!

https://s3.amazonaws.com/careers.modaoperandi.com/Data+Scientist.pdf

https://s3.amazonaws.com/careers.modaoperandi.com/Director+of+Data+Warehousing.pdf

https://s3.amazonaws.com/careers.modaoperandi.com/Director+of+Platform+Engineering.pdf

https://s3.amazonaws.com/careers.modaoperandi.com/Senior+Data+Warehouse+Engineer.pdf

https://s3.amazonaws.com/careers.modaoperandi.com/Serverless+API+Architect.pdf

We are looking for engineering in NYC or those who are willing to relocate. We have all the benefits that are expected from a technology company.

If you are looking to build the next state of the art e-commerce discovery platform, then please send me an email jon@modaoperandi.com

Post has attachment

...a celebration of women in tech: http://findingada.com/

Thanks for starting it all !!!!

with Ada.Text_IO; use Ada.Text_IO;

procedure MoAda is

begin

Put_Line("Happy Ada Lovelace Day!");

end MoAda;

MoAda();

Thanks for starting it all !!!!

with Ada.Text_IO; use Ada.Text_IO;

procedure MoAda is

begin

Put_Line("Happy Ada Lovelace Day!");

end MoAda;

MoAda();

Post has attachment

Post has attachment

Will cake really be served?

Thanks Dr. Thrun and the entire Udacity team for being SOOOO cool!

Thanks Dr. Thrun and the entire Udacity team for being SOOOO cool!

‹

›

Udacity Cake

11 Photos - View album

How does one go about doing an 8903?

We hit 100!

Post has attachment

Any solid tech want to consider working here with me.

If N=NP then it is commonly known that all of NP is NPC. P includes NP therefore P=NPC.

For a problem M to be in NPC it must:

1) be in NP

2) every problem in NP must reduce to M

If P=NPC then every problem in NP can be reduced to every problem in P.

In essence every problem in NP can be reduced to every other problem in NP.

This implies that every problem in P would be able to be reduced to every other problem in P.

This is the definition of P-complete. Therefore P would be equal to P-complete.

From this logic it would follow:

if P=NP

then P = NP = NP-Complete

if P = NP-Complete

then by definition of NP-Complete all problems in P must be reducible to NP.

if all problems in P are reducible to P

then P = P-Complete

if P = P-Complete

then NC = P

if NC = P

then NC = P = P-Complete = NP = NP-Complete

It is illogical to consider NC = NP

In fact the whole computational model collapses eventually.

If we went down this rabbit hole we would say L = NP

Therefore by contradiction P ≠ NP

For a problem M to be in NPC it must:

1) be in NP

2) every problem in NP must reduce to M

If P=NPC then every problem in NP can be reduced to every problem in P.

In essence every problem in NP can be reduced to every other problem in NP.

This implies that every problem in P would be able to be reduced to every other problem in P.

This is the definition of P-complete. Therefore P would be equal to P-complete.

From this logic it would follow:

if P=NP

then P = NP = NP-Complete

if P = NP-Complete

then by definition of NP-Complete all problems in P must be reducible to NP.

if all problems in P are reducible to P

then P = P-Complete

if P = P-Complete

then NC = P

if NC = P

then NC = P = P-Complete = NP = NP-Complete

It is illogical to consider NC = NP

In fact the whole computational model collapses eventually.

If we went down this rabbit hole we would say L = NP

Therefore by contradiction P ≠ NP

Add a comment...

Why is this so crazy and why can't I get a straight answer.

http://math.stackexchange.com/questions/1450201/if-p-np-npc-would-this-imply-that-p-p-complete

http://math.stackexchange.com/questions/1450201/if-p-np-npc-would-this-imply-that-p-p-complete

Add a comment...

Post has attachment

Wait while more posts are being loaded