Computable Functions
Mostrando 1-9 de 9 artigos, teses e dissertações.
-
1. Cálculos de substituições explícitas à La Bruijn com sistemas de tipos com interseção
The ג-calculus is a well known theoretical computation model as old as the concept of computable functions. Due to the substitution definition as a meta-operator there exists a great quantity of variations of this computational system in which the operation of substitution is treated explicitly. In this work we investigate intersection type systems for
Publicado em: 2010
-
2. A categoria computável dos espaços coerentes gerados por conjuntos básicos com aplicação em análise real / The computable category of the coherence spaces generated by basic sets with an application in real analysis
Neste trabalho desenvolve-se um estudo sobre os Espaços Coerentes Gerados por Conjuntos Básicos, dotados de uma estrutura adicional. Por estrutura adicional entende-se uma estrutura algébrica, de ordem pontual, de medidas, topológica e lógica. Estes espaços, denotados por , constituem uma subcategoria dos Espaços Coerentes, cujos objetos, ordenados pe
Publicado em: 2010
-
3. CaracterizaÃÃo aritmÃtica em primeira ordem de funÃÃes computÃveis em espaÃo polinomial
In this work, we develop a characterization of the polynomial space computable functions in the rst order theory of binary strings. We prove a analogous result to Parikh`s Theorem on the polynomial bound on the growth size of de nable functions. This work is a natural extension of Prof. Fernando Ferreira`s system of polynomial time computable arit
Publicado em: 2008
-
4. Extração de aleatoriedade a partir de fontes defeituosas / Randomness extraction from weak random sources
Recently, Barak et al. (2004) constructed explicit deterministic extractors and dispersers (these are polynomial-time computable functions) with much better parameters than what was known before. We introduce the concepts involved in such a construction and mention some of its applications; in particular, we describe how it is possible to obtain much better
Publicado em: 2007
-
5. Investments in infrastructure and effect on the poverty and the distribution of income: an analysis of general balance of the Brazilian economy / Investimentos em infra-estrutura e efeitos sobre a pobreza e a distribuiÃÃo de renda: uma anÃlise de equilÃbrio geral da economia brasileira
This research investigated the effects of an increase in the infrastructures investments on the economic growth and on the poverty and inequality indicators in Brazil. To reach this goal, it was simulated an increase in the public capital investments in a computable general equilibrium model (CGEM). To enhance the effects of this shock in the economy, the fi
Publicado em: 2006
-
6. Da computação paraconsistente a computação quantica
As diferentes interpretações da mecânica quântica levanta sérios problemas filosóficos a respeito da natureza do mundo físico e do estatuto das teorias físicas. Tais interpretações desempenham um papel importante na compreensão dos modelos de computação quântica, e por sua vez os modelos de computação quântica abrem a possibilidade de se con
Publicado em: 2006
-
7. The homogeneity conjecture
We show that, for any function f in which Kleene's O is computable, the ordering of Turning degrees (i.e., degrees of difficulty of computation of functions) is not isomorphic to the ordering of degrees of functions from which f is computable. This refutes a well-known conjecture of H. Rogers, Jr., and others.
-
8. euGenes: a eukaryote genome information system
euGenes is a genome information system and database that provides a common summary of eukaryote genes and genomes, at http://iubio.bio.indiana.edu/eugenes/. Seven popular genomes are included: human, mouse, fruitfly, Caenorhabditis elegans worm, Saccharomyces yeast, Arabidopsis mustard weed and zebrafish, with more planned. This information, automatically ex
Oxford University Press.
-
9. Not all (possibly) “random” sequences are created equal
The need to assess the randomness of a single sequence, especially a finite sequence, is ubiquitous, yet is unaddressed by axiomatic probability theory. Here, we assess randomness via approximate entropy (ApEn), a computable measure of sequential irregularity, applicable to single sequences of both (even very short) finite and infinite length. We indica
The National Academy of Sciences of the USA.