Armando B. Matos

A. Matos homepage

Recovered from an older version


Armando B. Matos
$ Display all 3194 possibilities? (y or n)

Researcher and retired teacher, email: reverse "moc.oohay@mcbodnamra"
LIACC, Artificial Intelligence Computer Science Laboratory / Computer Science Department / Faculty of Sciences / FCUP info / Universidade do Porto / Porto

What can be asserted without evidence can also be dismissed without evidence.

	Papers (below)			易
	Reversible languages: work in progress (pdf)			Course: “Topics on Advanced Algorithms”
	Reversible languages: TCS paper (pdf)			Course: “Introductory Programming”
	...A text on advanced algorithms (pdf).			Course: “Complexity”
	Mathoverflow			Course: “Imperative Programming”
	Research on primitive recursive functions			C.A.R. Hoare on categories (only for my study)
	Pr. recursive functions: implementation efficiency			Logicians discussing weak arithmetics
	AI & CS Lab, LIACC, Univ. Porto			Consequences of Godel's Incompleteness Theorem
	Programming is useful...			Panflation!
	List of quotes...			Frege

"Random" quote: Rob Tubbs: ...there is this pressure on you to publish papers, and if you happen to get some results - even if they say something strange about something of no interest - you want to publish it someplace.

List of papers and research notes

Available papers: click on the title to see the document

[2018] - Abstracts and tables of contents here.

[2018] - Armando B. Matos, Luca Paolini, and Luca Roversi
The Fixed Point Problem for General and for Linear SRL Programs is Undecidable
Proceedings of the 19th Italian Conference on Theoretical Computer Science
Urbino, Italy, 2018. Edited by Alessandro Aldini and Marco Bernardo
http://ceur-ws.org/Vol-2243/

‍

[2016] - Armando B. Matos
https://arxiv.org/abs/1607.01686
Primitive recursive functions versus partial recursive functions:
comparing the degree of undecidability

[2016] - Armando B. Matos
Total recursive functions that are not primitive recursive
For personal access only.

‍

[2014] - Turing Princeton PhD dissertation converted to LaTeX
(available in in Andrew Hodges page).

‍

[2013] - Luís Antunes, Armando Matos, Alexandre Pinto, André Souto, Andreia Teixeira
One-way functions using Algorithm and Classical Information Theories
Theory of Computing Systems, Vol 52, n. 1, pages 162-178, 2013.

‍

[2012] - Luís Antunes, Andreia Teixeira, Armando Matos
Conditional Renyi entropies
IEEE Transactions on Information Theory Vol 58, issue 7.

[2012] - Armando B. Matos
A bibliography on sub-recursive classes.

‍

[2011] - Luís Antunes, Armando Matos, Alexandre Pinto, André Souto, Andreia Teixeira
Entropy Measures vs. Kolmogorov Complexity
Entropy, Special Issue on Kolmogorov Complexity, 13(3), pp 595-611.
[2011] - André Souto, Andreia Teixeira, Armando Matos
Distinguishing probability ensembles
Computability in Europe, Sofia 2011.
[2011] - (Preliminary, published in 2015)
Luís Antunes, Henry Buhrman, Armando Matos, André Souto, Andreia Teixeira
Distinguishing two probability ensembles with one sample from each ensemble
Theory_of_Computing_Systems, 10/2015
Vol 57, pp 1-15.

‍

[2010] - Armando Matos, Alexandre Pinto, André Souto, Andreia Teixeira
One-way functions using Kolmogorov complexity
Computability in Europe, Azores 2010.

[2010] - André Souto, Andreia Teixeira, Armando Matos, Luis Antunes
Entropy Measures vs. Algorithmic Information
2010 IEEE International Symposium on Information Theory, (ISIT 2010), Austin, Texas.

[2010] - Luis Antunes, Armando Matos, André Souto, Andreia Teixeira
Kolmogorov Complexity and Entropy Measures
Current Trends in Theory and Practice of Computer Science 2010,
36th International Conference, Czech Republic.

[2010] - Armando Matos, André Souto, Andreia Teixeira
The largest monochromatic combinatorial rectangles with applications to Communication Complexity
Computers in Europe 2010, Azores, 2010.

[2010] - Armando Matos
Selected talk: Around descriptive complexity complexity
DCC-Faculdade de Ciencias da Universidade do Porto.

[2010] - The largest monochromatic combinatorial rectangles with applications to Communication Complexity
Note. Slide presentation of the above paper.

[2010] - Armando Matos
About non integral compositional order [working paper]
DCC-Faculdade de Ciencias da Universidade do Porto.

‍

[2009] - Luis Antunes, Armando Matos, Anfré Souto, Paul Vitányi
Depth as Randomness Deficiency
Theory of Computing Systems, 45:4 pp 724-739.
[2009] - Alexandre Pinto, Andreia Teixeira, Armando Matos, Luis Antunes
Commitment and authentication systems
Designs, Codes and Cryptography (Springer), 53:3, pp 175-193.
[2009] - Armando Matos, André Souto, Andreia Teixeira
Measuring communication complexity using instance complexity with oracles
Computing Research Repository - CORR Vol 0901.2, 2009.
[2009] - Armando Matos
Selected talk: Average case, worst case, and the universal distribution
DCC-Faculdade de Ciencias da Universidade do Porto.

‍

[2007] - Armando Matos, André Souto, Andreia Teixeira
Non-deterministic Communication Complexity and Instance Complexity
Computers in Europe 2007, Siena, 2007.
[2007] - Luís Antunes, Armindo Costa, Armando Matos, Paul Vitányi
Computational depth of infinite strings revisited
Proc. CiE 2007, Computational and Logic in the Real World, Siena, 2007.

[2007] - [P] Armando Matos Notas sobre minorantes de complexidade
DCC-Faculdade de Ciencias da Universidade do Porto.

‍

[2006] - Alexandre Pinto, Andreia Teixeira, Armando Matos, Luis Antunes
Galois Field Commitment Scheme
IACR Cryptology ePrint Archive; 2006:410.

‍

[2003] - Armando B. Matos
Linear programs in a simple reversible language Theoretical Computer Science
Vol. 290 No. 3, pp 2063-2074.

[2001] - Luis Antunes, Armando B. Matos
Explicit formulas for the Shannon and Renyi entropies of some non independent sources of symbols
(preliminary version)
EPPIA, 2001

‍

[2000] - Luis Antunes, Armando Matos
On the number of lines of the Theorems of the formal system MIU
(preliminary version)
DCC-Faculdade de Ciencias da Universidade do Porto Internal Report.

[1998] - Armando Matos
Monadic Logic Programs and Functional Complexity
Theoretical Computer Science, Vol. 176 Nos. 1-2, pp 175-204.
[1994] - Armando Matos
A matrix model for the flow of control in Prolog with applications to profiling.
Software Practice and Experience, Vol. 24 No. 8, pp 729-746.
[1994] - Armando Matos
The X-Profiler — Concepts and User Manual.
Laboratório de Inteligência Artificial e de Ciência de Computadores, Universidade do Porto.
[1994] - Armando Matos
Periodic sets of Integers.
Theoretical Computer Science, Vol. 28 No. 1, pp 577-693.
[1994] - Armando Matos
An introduction to ultimately periodic sets of integers
ACM SIGACT News, Volume 25 Issue 1, March 1994, pp 90-96.
[1993] - Armando B. Matos
Some Results on the Complexity of SLD-Derivations
In: Progress in Artificial Intelligence
6th Portuguese Conference on AI, EPIA'93
M. Filgueiras and L. Damas (eds), Springer-Verlag, 1993.
[1993] - Armando B. Matos
Regular Languages and a Class of Logic Programs
In: Progress in Artificial Intelligence
6th Portuguese Conference on AI, EPIA'93
M. Filgueiras and L. Damas (eds), Springer-Verlag, 1993.
[19??] - Armando B. Matos
An efficient Prolog implementation of the Knuth-Bendix reduction system
Technical Report, Faculdade de Engenharia da Universidade do Porto
[1980] - (Lastest revision: 2915)
António Porto, Armando Matos
Ackermann and the superpowers
DCC-Faculdade de Engenharia da Universidade do Porto,
Previous version published in "SIGACT, IEEE".
[19??] - Armando Matos, Miguel Filgueiras
Programação em PASCAL
Centro de Informática, Universidade do Porto.

[P] In Portuguese.

"The power of instruction is seldom of much efficacy except in those happy dispositions where it is almost superfluous", Gibbon


   Monday 15 September 2025

 (28203 accesses)

`Identity problem: the security code is still encrypted; you seem to be either a visitor without a number or a number without a visitor; please try again.`

Recovered from an older version

易

List of papers and research notes

Available papers: click on the title to see the document

‍

‍

‍

‍

‍

‍

‍

‍

‍

‍

‍

‍

‍

‍

‍

‍

‍

Identity problem: the security code var d = new Date() h=d.getHours() m=d.getMinutes() s=d.getSeconds() document.write("'" + (d*3+100000000000000*s) + "'") is still encrypted; you seem to be either a visitor without a number or a number without a visitor; please try again.

`Identity problem: the security code is still encrypted; you seem to be either a visitor without a number or a number without a visitor; please try again.`