Armando B. Matos

Available identifiers

zbMath Open matos.armando-bWikidataQ62051640 ScholiaQ62051640MaRDI QIDQ1342237

List of research outcomes

Publication	Date of Publication	Type
Splitting Recursion Schemes into Reversible and Classical Interacting Threads	2021-11-03	Paper
On the expressivity of total reversible programming languages	2021-07-05	Paper
The fixed point problem of a simple reversible language	2020-04-21	Paper
Conditional Rényi Entropies	2017-07-12	Paper
Distinguishing two probability ensembles with one sample from each ensemble	2017-01-12	Paper
The efficiency of primitive recursive functions: a programmer's view	2015-07-24	Paper
Entropy measures vs. Kolmogorov complexity	2012-01-09	Paper
Depth as randomness deficiency	2009-10-19	Paper
Linear programs in a simple reversible language.	2003-08-17	Paper
Monadic logic programs and functional complexity	1998-07-23	Paper
Periodic sets of integers	1995-01-11	Paper
https://portal.mardi4nfdi.de/entity/Q3902991	1980-01-01	Paper

Research outcomes over time

This page was built for person: Armando B. Matos