Using Category Theory in Modeling Generics in OOP (Outline) [abstract + link to PDF] Computer Science

Using Category Theory in Modeling Generics in OOP (Outline) [abstract + link to PDF]
AI develops human-like number sense – taking us a step closer to building machines with general intelligence
Is proof of contradiction enough to prove NP-hardness? (or any other means besides reductions)
Published my first Python PyPi Package
RingNet | 3D Face Estimation Without 3D Supervision
ICML 2019 | Google, ETH Zurich, MPI-IS, Cambridge & PROWLER.io Share Best Paper Honours
Best Programming Languages to Create a Startup

Using Category Theory in Modeling Generics in OOP (Outline) [abstract + link to PDF]

Posted: 12 Jun 2019 07:34 PM PDT

submitted by /u/flexibeast
[link] [comments]

AI develops human-like number sense – taking us a step closer to building machines with general intelligence

Posted: 13 Jun 2019 02:25 AM PDT

submitted by /u/Akkeri
[link] [comments]

Is proof of contradiction enough to prove NP-hardness? (or any other means besides reductions)

Posted: 12 Jun 2019 06:07 PM PDT

Suppose, after months of studying and practicing reductions I just simply cannot figure out how to prove correctly with a formal NP-complete <p My problem proof.

UPDATE: I did a google search and followed a 3-coloring <p Sudoku and found out that 3-color-search <p my-Sudoku search problem.

I was dumb founded that I never found out that NP problems have search problems. Because, I'm still learning.

Finally, I'm done for the week. My search problem is NP-hard(or at least should be if reduction done right)

Back to post

So lets, say I prove by contradiction that my problem is NP-hard.

Is this allowed?

Update: Thanks for the feedback. Found one mistake. Fixed it

This is what needed to be fixed in the attempted proof. (Showing that its in NP)

 Input = Sudoku Solution converted into Grid Generator Code If code output == valid grid: print("valid")

Turns out my problem is a search problem and not a decision problem. If the proof of contradiction holds then its suppose to be NP-hard.

By the way zoom in for the picture.

Attempted Contradiction proof

submitted by /u/Hope1995x
[link] [comments]

Published my first Python PyPi Package

Posted: 12 Jun 2019 12:31 PM PDT

I was always fascinated by python packages and the ease to use them. I always wanted to make one but never found a proper use case. Recently I was working with Elasticsearch and was not able to find a way to index json docs quickly so I made a tool which does exactly that. It uses multiprocessing to achieve the task. Here is the link to the GitHub repo - Link.

The tool is in its early stages so let me know how to make this better :)

submitted by /u/itsron_143
[link] [comments]

RingNet | 3D Face Estimation Without 3D Supervision

Posted: 12 Jun 2019 12:10 PM PDT

submitted by /u/Yuqing7
[link] [comments]

ICML 2019 | Google, ETH Zurich, MPI-IS, Cambridge & PROWLER.io Share Best Paper Honours