• Breaking News

    Monday, June 3, 2019

    Home Unlabelled Schedule of a compsci student Computer Science

    Schedule of a compsci student Computer Science

    June 03, 2019

    Schedule of a compsci student Computer Science

    Schedule of a compsci student

    Posted: 02 Jun 2019 03:56 PM PDT

    I'm curious what a typical students schedule is. Recently it seems like I'm investing a lot of time into studying and programming and I feel kind of burnt out. How much time do you put into studying/recreation/sleep?

    submitted by /u/2kfan
    [link] [comments]

    Place to meet other computer science people and hang out

    Posted: 02 Jun 2019 11:36 AM PDT

    What's up! I have started a discord to find new buddies who are also interested in CS, play games together, talk about movies and such. We do not talk about programming or answer any kind of questions. We are purely focussed on getting closer to each other and socialize. Well, if you like the idea, feel free to join us at https://discord.gg/jvX4xDaAt least I personally hope to meet you. Im out, pce.

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

    Differential evolution algorithm is killing me

    Posted: 02 Jun 2019 07:03 AM PDT

    Which architecture do you think will be able to emulate the human brain first? von Neumann, or connectivist?

    Posted: 02 Jun 2019 07:14 PM PDT

    P_vs_NP has been created

    Posted: 02 Jun 2019 06:20 PM PDT

    Bad_Experts has been created

    Posted: 02 Jun 2019 05:48 PM PDT

    Is it possible to solve the 'map coloring' problem in Datalog?

    Posted: 02 Jun 2019 08:24 AM PDT

    I'm trying to learn Datalog this weekend and am stumped on this problem that you can usually solve with a logic programming language. In Prolog, you can describe the shapes on a map in the terms of which shape touches another, specify a set of colors, and ask it for a valid assignment of colors to shapes such that no shapes that touch have the same color assigned to them.

    ​

    I've read that Datalog is a subset of Prolog -- so maybe it's just the case that Datalog isn't expressive enough to describe the relationships necessary for solving this problem?

    ​

    Is it possible to express a solution to this in Datalog? Or am I missing the right background in theory to recognize this is not possible (like trying to parse a context-free lang with regex)?

    #lang datalog country(1). country(2). country(3). country(4). country(5). touches(1, 2). touches(1, 3). touches(1, 4). touches(1, 5). touches(2, 3). touches(2, 4). touches(3, 4). touches(4, 5). %touches(X, Y) :- touches(Y, X). hue(red). hue(blue). hue(yellow). hue(green). %attempt with no conflicts color(1,red,a). color(2,blue,a). color(3,green,a). color(4,yellow,a). color(5,blue,a). %attempt with conflicts color(1,red,b). color(2,blue,b). color(3,green,b). color(4,blue,b). color(5,green,b). %you can define what it means for two countries to be in conflict for a given %attempt conflict(R1,R2,SolutionAttempt) :- touches(R1,R2), color(R1,Color,SolutionAttempt), color(R2,Color,SolutionAttempt). %print the conflicting countries for attempt 'b': conflict(A,B,b). % a set of attempts attempt(a). attempt(b). attempt(c). % generate some attempts generated_color(S, C, A) :- country(S), hue(C), attempt(A). generated_colors(S, C, A)? % but this is the full cross product of all the sets
    submitted by /u/cpdean
    [link] [comments]

    Boolean Expression Simplification

    Posted: 02 Jun 2019 12:08 PM PDT

    https://ibb.co/1ZkWYGh

    Is my expression in the most simplifed form? Im not sure how to simplify it further

    Edit: Step 3 was wrong, here is my work from step 3 fixed. https://ibb.co/2MHpkzD

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

    Request Review for a Proof of L = parity L

    Posted: 02 Jun 2019 06:23 AM PDT

    A major complexity classes are $L$, $POLYLOGTIME$ and $\oplus L$. A logarithmic Turing machine has a read-only input tape, a write-only output tape, and some read/write work tapes. The work tapes may contain $O(\log n)$ symbols. $L$ is the complexity class containing those decision problems that can be decided by a deterministic logarithmic Turing machine. We define the complexity class $POLYLOGTIME$ as the problems which can be decided by a random access machine in poly-logarithmic time. We prove there is problem in the complexity class $L$ which cannot be solved by a random access machine in poly-logarithmic time. Hence, we show $L \nsubseteq POLYLOGTIME$. The complexity class $\oplus L$ has the same relation to $L$ as $\oplus P$ does to $P$. We demonstrate there is a complete problem for $\oplus L$ that can be logarithmic space reduced to a problem in $L$. Consequently, we show $L = \oplus L$.

    ​

    https://www.academia.edu/39345145/The_complexity_of_class_L

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

    Wjat is problem solving technique in artificial intelligence ?

    Posted: 02 Jun 2019 05:29 AM PDT

    What is data flow diagram in software engineering ?

    Posted: 02 Jun 2019 05:40 AM PDT

    Whar is artificial intelligence ?

    Posted: 02 Jun 2019 05:51 AM PDT

    Request Review for a Proof of P = NP

    Posted: 02 Jun 2019 06:21 AM PDT

    P versus NP is considered as one of the most important open problems in computer science. This consists in knowing the answer of the following question: Is P equal to NP? A precise statement of the P versus NP problem was introduced independently by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this problem have failed. To attack the P versus NP problem, the NP-completeness is a useful tool. We prove the known NP-complete problem MONOTONE 1-IN-3 3SAT can be polynomially reduced to the polynomial language 2SET PACKING. In this way, MONOTONE 1-IN-3 3SAT must be in P. If any NP-complete problem can be solved in polynomial time, then every language in NP has a polynomial time algorithm. Hence, we demonstrate the complexity class P is equal to NP.

    ​

    https://www.academia.edu/39345182/The_P_versus_NP_Problem

    submitted by /u/frankvegadelgado
    [link] [comments]
    Read more
    at

    No comments:

    Post a Comment