UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Length Functions and the Dimension of Points in Self-Similar Fractal Trees

IEEE transactions on information theory, 2023-10, Vol.69 (10), p.1-1

Porter, Christopher P.

2023

Volltextzugriff (PDF)

Algorithmic Randomness: Progress and Prospects

1, 2020

Volltextzugriff (PDF)

Selective Recovery of Copper from a Synthetic Metalliferous Waste Stream Using the Thiourea-Functionalized Ion Exchange Resin Puromet MTS9140

Eng (Basel, Switzerland), 2021-12, Vol.2 (4), p.512-530

2021

Volltextzugriff (PDF)

Effective aspects of Bernoulli randomness

Journal of logic and computation, 2019-12, Vol.29 (6), p.933-946

Porter, Christopher P

2019

Volltextzugriff (PDF)

DEGREES OF RANDOMIZED COMPUTABILITY

The bulletin of symbolic logic, 2022-03, Vol.28 (1), p.27-70

2022

Volltextzugriff (PDF)

Randomness extraction in computability theory

Computability, 2023-01, Vol.12 (1), p.1-21

2023

Volltextzugriff (PDF)

Polymeric seal degradation in nuclear power plants: Effect of gamma radiation on sealing properties

Journal of applied polymer science, 2017-03, Vol.134 (12), p.np-n/a

2017

Volltextzugriff (PDF)

The Random Members of a Π 1 0 ${\Pi }_{1}^{0}$ Class

Theory of computing systems, 2018-10, Vol.62 (7), p.1637-1671

2018

Volltextzugriff (PDF)

Polymeric seal degradation in nuclear power plants: Determination of physical and mechanical properties

Journal of applied polymer science, 2018-02, Vol.135 (7), p.n/a

2018

Volltextzugriff (PDF)

An alternative to cyanide leaching of waste activated carbon ash for gold and silver recovery via synergistic dual-lixiviant treatment

Journal of Industrial and Engineering Chemistry, 2020, 92(0), , pp.120-130

2020

Volltextzugriff (PDF)

Trivial Measures are not so Trivial

Theory of computing systems, 2015-04, Vol.56 (3), p.487-512

Porter, Christopher P.

2015

Volltextzugriff (PDF)

Kolmogorov on the role of randomness in probability theory

Mathematical structures in computer science, 2014-06, Vol.24 (3), p.1-17, Article e240302

PORTER, CHRISTOPHER P.

2014

Volltextzugriff (PDF)

DEEP CLASSES

The bulletin of symbolic logic, 2016-06, Vol.22 (2), p.249-286

2016

Volltextzugriff (PDF)

Continuous randomness via transformations of 2-random sequences

Information and computation, 2023-06, Vol.292, p.105028, Article 105028

Porter, Christopher P.

2023

Volltextzugriff (PDF)

The Intersection of Algorithmically Random Closed Sets and Effective Dimension

ACM transactions on computational logic, 2022-10, Vol.23 (4), p.1-19, Article 24

2022

Volltextzugriff (PDF)

Revisiting Chaitin’s Incompleteness Theorem

Notre Dame journal of formal logic, 2021-01, Vol.62 (1)

Porter, Christopher P.

2021

Volltextzugriff (PDF)

Three books on computability, with a special focus on Turing's legacy

Historia Mathematica, 2019-02, Vol.46, p.88-95

Porter, Christopher P.

2019

Volltextzugriff (PDF)

ON THE INTERPLAY BETWEEN EFFECTIVE NOTIONS OF RANDOMNESS AND GENERICITY

The Journal of symbolic logic, 2019-03, Vol.84 (1), p.393-407

2019

Volltextzugriff (PDF)

Random numbers as probabilities of machine behavior

Theoretical computer science, 2017-04, Vol.673, p.1-18

2017

Volltextzugriff (PDF)

The Random Members of a Π10 Class

Theory of computing systems, 2018-10, Vol.62 (7), p.1637-1671

2018

Volltextzugriff (PDF)

RANK AND RANDOMNESS

The Journal of symbolic logic, 2019-12, Vol.84 (4), p.1527-1543

2019

Volltextzugriff (PDF)

ON ANALOGUES OF THE CHURCH–TURING THESIS IN ALGORITHMIC RANDOMNESS

The review of symbolic logic, 2016-09, Vol.9 (3), p.456-479

PORTER, CHRISTOPHER P.

2016

Volltextzugriff (PDF)

Randomness for computable measures and initial segment complexity

Annals of pure and applied logic, 2017-04, Vol.168 (4), p.860-886

2017

Volltextzugriff (PDF)

The Probability of a Computable Output from a Random Oracle

ACM transactions on computational logic, 2017-08, Vol.18 (3), p.1-15

2017

Volltextzugriff (PDF)

DEEP$\Pi _1^0$CLASSES

The bulletin of symbolic logic, 2016-06, Vol.22 (2), p.249-286

2016

Volltextzugriff (PDF)

1 – 25 von 517

Menü

Weitere Dienste

Einstellungen

Length Functions and the Dimension of Points in Self-Similar Fractal Trees

Algorithmic Randomness: Progress and Prospects

Selective Recovery of Copper from a Synthetic Metalliferous Waste Stream Using the Thiourea-Functionalized Ion Exchange Resin Puromet MTS9140

Effective aspects of Bernoulli randomness

DEGREES OF RANDOMIZED COMPUTABILITY

Randomness extraction in computability theory

Polymeric seal degradation in nuclear power plants: Effect of gamma radiation on sealing properties

The Random Members of a Π 1 0 ${\Pi }_{1}^{0}$ Class

Polymeric seal degradation in nuclear power plants: Determination of physical and mechanical properties

An alternative to cyanide leaching of waste activated carbon ash for gold and silver recovery via synergistic dual-lixiviant treatment

Trivial Measures are not so Trivial

Kolmogorov on the role of randomness in probability theory

DEEP CLASSES

Continuous randomness via transformations of 2-random sequences

The Intersection of Algorithmically Random Closed Sets and Effective Dimension

Revisiting Chaitin’s Incompleteness Theorem

Three books on computability, with a special focus on Turing's legacy

ON THE INTERPLAY BETWEEN EFFECTIVE NOTIONS OF RANDOMNESS AND GENERICITY

Random numbers as probabilities of machine behavior

The Random Members of a Π10 Class

RANK AND RANDOMNESS

ON ANALOGUES OF THE CHURCH–TURING THESIS IN ALGORITHMIC RANDOMNESS

Randomness for computable measures and initial segment complexity

The Probability of a Computable Output from a Random Oracle

DEEP$\Pi _1^0$CLASSES

Suchergebnisse filtern