-
How do we want to approach the topic of algorithmic complexity and Big O notion? @hcolmanccc @Zune-Ahmed @boughrira
I can think of a few ways:
- We can mention the topic as it comes up
- Have …
-
Currently, support for the following items is lacking:
- Union, intersection, complement, and converse of binary relations:
> [...] Should we introduce some notation for relI, (e.g., `[relI e1…
-
Unlike other binary relations over lists, `Data.List.Relation.Binary.Permutation.(Setoid/Propositional)` are implemented separately which results in an awful lot of proof duplication. It also means th…
-
Presently the confidence is only set for the ParseNodes and not for the relations. This was pointed out @ https://groups.google.com/d/msg/opencog/8I4oBE2dOJc/GG0lqRmmKrwJ and https://github.com/openco…
-
```
2024-07-21 15:59:45.886551: W tensorflow/core/framework/op_kernel.cc:1828] OP_REQUIRES failed at gather_nd_op.cc:48 : INVALID_ARGUMENT: Requested more than 0 entries, but params is empty. Params…
-
> ```
> # Progress Tracker
> ```
>
> ## DSA
> * [ ] Complete Git & GitHub Course
> * [ ] Introduction to Programming
>
> * * [ ] Types of languages
> * * [ ] Memory management…
-
### Bug Report
| Q | A
|------------ | ------
| BC Break | idk
| Version | 3.1.1
#### Summary
When eager relations are loaded by `BasicEntityPersister::loadAll()`
h…
-
# Progress Tracker
## DSA
- [ ] Complete Git & GitHub Course
- [x] Introduction to Programming
- - [x] Types of languages
- - [x] Memory management
- [x] Flow of the program
…
-
I find that the current `Total` for binary relations is a misnomer: Currently there is:
```agde
Total : ∀ {a ℓ} {A : Set a} → Rel A ℓ → Set _
Total _∼_ = ∀ x y → (x ∼ y) ⊎ (y ∼ x)
```
But a binar…
-
When using at least `×-refl`, `×-symmetric` and `×-transitive`, the relations `R` and `S` do not appear to be inferable. Should be made explicit?