The following pages link to Armando B. Matos (Q1342237):
Displaying 13 items.
- (Q503463) (redirect page) (← links)
- Distinguishing two probability ensembles with one sample from each ensemble (Q503466) (← links)
- Entropy measures vs. Kolmogorov complexity (Q657548) (← links)
- Depth as randomness deficiency (Q733740) (← links)
- Periodic sets of integers (Q1342238) (← links)
- Monadic logic programs and functional complexity (Q1392280) (← links)
- Linear programs in a simple reversible language. (Q1401215) (← links)
- The fixed point problem of a simple reversible language (Q1989327) (← links)
- On the expressivity of total reversible programming languages (Q2039893) (← links)
- The efficiency of primitive recursive functions: a programmer's view (Q2355684) (← links)
- (Q3902991) (← links)
- Splitting Recursion Schemes into Reversible and Classical Interacting Threads (Q5162610) (← links)
- Conditional Rényi Entropies (Q5271803) (← links)
