Logo Questions Linux Laravel Mysql Ubuntu Git Menu
HTML CSS JAVASCRIPT SQL PYTHON PHP BOOTSTRAP JAVA JQUERY R React Kotlin
 

New posts in proof

Stable comparison sort with O(n * log(n)) time and O(1) space complexity

algorithm sorting complexity-theory proof

Is there a way to prove a program has no bug?

proof formal-verification proof-of-correctness

General proof of equivalence of two FSMs in finite time?

theory fsm proof state-machine

Big Oh Notation O((log n)^k) = O(log n)?

big-o proof

Proof assistant for mathematics only

proof agda idris proof-of-correctness isar

If two things are not not equal, are they equal?

types proof agda dependent-type

Which vector library to use in coq?

list vector coq proof dependent-type

Proof that a binary tree with n leaves has a height of at least log n

logic binary-tree nodes proof induction

Why is the greedy algorithm optimal?

algorithm greedy proof

Universal Quantification in Isabelle/HOL

proof isabelle

How to solve goals with invalid type equalities in Coq?

types equality proof coq

If Idris thinks things may be total that are not, can Idris be used for proofs?

proof idris totality

Handling let in hypothesis

coq proof dependent-type

How to prove (forall x, P x /\ Q x) -> (forall x, P x)

proof coq

Prove the efficiency of repeated calls to successor() in binary trees?

algorithm binary-search-tree proof

Using Ogden’s Lemma versus regular Pumping Lemma for Context-Free Grammars

string math context-free-grammar proof pumping-lemma

How to prove False from obviously contradictory assumptions

coq proof

prove n = Big-O(1) using induction

complexity-theory big-o proof
« Newer Entries Older Entries »