« first day (2834 days earlier)      last day (1607 days later) » 

Bounty!
Bounty!
10:25 AM
9
Q: Is extensionality for coinductive datatypes consistent with Coq's logic?

Jannis LimpergGiven a coinductive datatype, one can usually (always?) define a bisimulation as the smallest equivalence relation over it. I would like to add an axiom stating that if two members of the type are related by the bisimulation, they are equal in the sense of Leibniz equality (=). Would this make th...

coq equality coinduction
 
 
6 hours later…
JohnnyApplesauce
JohnnyApplesauce
4:52 PM
First off, this isn't a homework question, this is a study-for-exam question, and the professor encourages using the 'net
What are the most efficient algorithms for finding the shortest path for a weighted, acyclic graph? Google hasn't helped.
Also, are these answers that I put on the study guide correct? Wikipedia and SO got me this far:
Most efficient for....
Unweighted: BFS, O(E+V)
Weighted, non-negative weights: Dijkstra, O(E+V*log(V))
Weighted, negative weights: Bellman-Ford, O(V*E)

The part of that question on the study guide is just "weighted acyclic"
 

« first day (2834 days earlier)      last day (1607 days later) »