Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Armando B. Matos"'
Publikováno v:
Reversible Computation ISBN: 9783030798369
RC
RC
Given a simple recursive function, we show how to extract from it a reversible and an classical iterative part. Those parts can synchronously cooperate under a Producer/Consumer pattern in order to implement the original recursive function. The rever
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1160ff8afc0db99376c022d7780d18bf
SRL is a total programming language with distinctive features: (i) every program that mentions n registers defines a bijection Z n → Z n , and (ii) the generation of the SRL -program that computes the inverse of that bijection can be automatic. Con
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1bc930304a588c556cda78a2fba9a4ca
http://hdl.handle.net/2318/1734164
http://hdl.handle.net/2318/1734164
Publikováno v:
Reversible Computation ISBN: 9783030524814
RC
Reversible Computation
RC
Reversible Computation
SRL is a reversible programming language conceived as a restriction of imperative programming languages. Each SRL program that mentions n registers defines a bijection on n-tuples of integers. Despite its simplicity, SRL is strong enough to grasp a w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6353c093569cca4e6b0ee976d88aadaf
https://doi.org/10.1007/978-3-030-52482-1_7
https://doi.org/10.1007/978-3-030-52482-1_7
Publikováno v:
Theory of Computing Systems, 59(3), 517-531. Springer New York
Theory of Computing Systems, 59(3), 517-531
Repositório Científico de Acesso Aberto de Portugal
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
Theory of Computing Systems, 59(3), 517-531
Repositório Científico de Acesso Aberto de Portugal
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
We introduced a new method for distinguishing two probability ensembles called one from each method, in which the distinguisher receives as input two samples, one from each ensemble. We compare this new method with multi-sample from the same method a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e9b4b55ce8b0e63445d8d714b9b155e4
https://dare.uva.nl/personal/pure/en/publications/distinguishing-two-probability-ensembles-with-one-sample-from-each-ensemble(ac141f3b-4888-45d1-9816-971926ed5d18).html
https://dare.uva.nl/personal/pure/en/publications/distinguishing-two-probability-ensembles-with-one-sample-from-each-ensemble(ac141f3b-4888-45d1-9816-971926ed5d18).html
Publikováno v:
Repositório Científico de Acesso Aberto de Portugal
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
We prove several results relating injective one-way functions, time-bounded conditional Kolmogorov complexity, and time-bounded conditional entropy. First we establish a connection between injective, strong and weak one-way functions and the expected
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6866ec0c001564990df6881bbc402e2d
https://doi.org/10.1007/s00224-012-9418-z
https://doi.org/10.1007/s00224-012-9418-z
Publikováno v:
IEEE Transactions on Information Theory. 58:4273-4277
There is no generally accepted definition of conditional Renyi entropy. The (unconditional) Renyi entropy depends on a parameter α, which for the case of min-entropy takes the value ∞. Even for this particular case, there are several proposals for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ce3092c052038c34b1f9bf9aa16b89c8
https://doi.org/10.1109/tit.2012.2192713
https://doi.org/10.1109/tit.2012.2192713
Publikováno v:
ICITS
In the present paper, we answer a question raised in the paper Constructions and Bounds for Unconditionally Secure Non-Interactive Commitment Schemes, by Blundo et al., 2002, showing that there is a close relation between unconditionally secure commi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d563576177036c0aa754a63c380c0134
https://doi.org/10.1007/s10623-009-9303-1
https://doi.org/10.1007/s10623-009-9303-1
Publikováno v:
Theory of Computing Systems, 45(4), 724-739. Springer New York
Theory of Computing Systems, 45(4), 724-739
Theory of Computing Systems, 45(4), 724-739
Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an unconditional lower bound on the computation time from a given program in absence
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8f07c730aeff597c5f8984cd0da6d446
https://doi.org/10.1007/s00224-009-9171-0
https://doi.org/10.1007/s00224-009-9171-0
Autor:
Armando B. Matos
Publikováno v:
Theoretical Computer Science. 290:2063-2074
Very simple reversible programming languages can be useful for the study of reversible transformations. For this purpose we define simple reversible language (SRL), a very simple reversible language, and analyse its properties. The language SRL is si
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::19c9fb9ecb316b6d00c752de1ef0e2c0
https://doi.org/10.1016/s0304-3975(02)00486-3
https://doi.org/10.1016/s0304-3975(02)00486-3
Autor:
Armando B. Matos
Publikováno v:
Theoretical Computer Science. 176:175-204
Problems related to the complexity and to the decidability of several languages weaker than Prolog are studied in this paper. In particular, monadic logic programs, that is, programs containing only monadic functions and monadic predicates, are consi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0adf0b2b82f383d0bbfdc04a343900f7
https://doi.org/10.1016/s0304-3975(96)00093-x
https://doi.org/10.1016/s0304-3975(96)00093-x