Calude, Cristian, 1952-
Calude, Cristian S., 1952-....
Cristian Calude Romanian-New Zealand mathematician and computer scientist
Calude, Cristian S.
Calude, Cristian
VIAF ID: 32098649 (Personal)
Permalink: http://viaf.org/viaf/32098649
Preferred Forms
- 200 _ | ââ¡a Caludeâ ââ¡b Cristian S.â ââ¡f 1952-....â
-
- 100 1 _ ââ¡a Calude, Cristianâ
-
-
-
- 100 1 _ ââ¡a Calude, Cristian S.â ââ¡d 1952-â
-
- 100 1 _ ââ¡a Calude, Cristian S.,â ââ¡d 1952-....â
-
- 100 1 _ ââ¡a Calude, Cristianâ ââ¡d 1952-â
- 100 1 _ ââ¡a Calude, Cristianâ ââ¡d 1952-â
- 100 1 _ ââ¡a Calude, Cristianâ ââ¡d 1952-â
-
-
-
- 100 1 _ ââ¡a Calude, Cristian,â ââ¡d 1952-â
- 100 0 _ ââ¡a Cristian Caludeâ ââ¡c Romanian-New Zealand mathematician and computer scientistâ
Â
Â
Â
Â
4xx's: Alternate Name Forms (21)
5xx's: Related Names (9)
- 551 _ _ ââ¡a Aucklandâ ââ¡4 ortwâ ââ¡4 https://d-nb.info/standards/elementset/gnd#placeOfActivityâ
- 510 2 _ ââ¡a Centre for Discrete Mathematics & Theoretical Computer Scienceâ
- 551 _ _ ââ¡a Galatzâ ââ¡4 ortgâ ââ¡4 https://d-nb.info/standards/elementset/gnd#placeOfBirthâ
- 510 2 _ ââ¡a Universitatea din BucureÅtiâ ââ¡4 affiâ ââ¡4 https://d-nb.info/standards/elementset/gnd#affiliationâ ââ¡e Affiliationâ
- 510 2 _ ââ¡a Universitatea din BucureÈtiâ
- 510 2 _ ââ¡a University of Aucklandâ
- 510 2 _ ââ¡a University of Aucklandâ ââ¡4 affiâ ââ¡4 https://d-nb.info/standards/elementset/gnd#affiliationâ ââ¡e Affiliationâ
- 510 2 _ ââ¡a University of Western Ontario. Department of Computer Scienceâ
- 510 2 _ ââ¡a ebrary, Incâ
Works
Title | Sources |
---|---|
Algorithmically Independent Sequences | |
Anytime Algorithms for Non-Ending Computations | |
Bio-steps beyond Turing. | |
Ce sînt limbajele de programare? | |
Chaitin Ω numbers, Solovay machines, and Gödel incompleteness | |
Combinatorics, computation & logic 99 : proceedings of DMTCS'99 and CATS'99, Auckland, New Zealand, 18 -21 January 1999 | |
The complexity of proving chaoticity and the Church-Turing thesis. | |
Computing with cells and atoms : an introduction to quantum, DNA, and membrane computing | |
The Deluge of Spurious Correlations in Big Data | |
Developments in language theory : 8th international conference, DLT 2004, Auckland, New Zealand, December 13-17, 2004 : proceedings | |
Discrete mathematical structures: From dynamics to complexity | |
DLT 2004 | |
DMTCS 2003 | |
Effective category and measure in abstract complexity theory | |
EXACT APPROXIMATIONS OF OMEGA NUMBERS | |
A fast natural algorithm for searching | |
Finite state complexity | |
Finite versus infinite : contributions to an eternal dilemma | |
Foreword | |
Formal Proof: Reconciling Correctness and Understanding | |
Generalisations of disjunctive sequences | |
The human face of computing | |
A hybrid quantum-classical paradigm to mitigate embedding costs in quantum annealing | |
INDUCTIVE COMPLEXITY OF THE P VERSUS NP PROBLEM | |
Information and complexity | |
Information and randomness : an algorithmic perspective | |
Introduction: computability of the physical | |
Is complexity a source of incompleteness? | |
Is Feasibility in Physics Limited by Fantasy Alone? | |
Is independence an exception? | |
Is there a universal image generator? | |
A machine learning PROGRAM to identify COVID-19 and other diseases from hematology data | |
MatematiÄki dokazi na prekretnici | |
Mathematics almost everywhere : in memory of Solomon Marcus | |
Most programs stop quickly or never halt | |
Multiset processing : mathematical, computer science, and molecular computing points of view | |
Natural halting probabilities, partial randomness, and zeta functions | |
A note on accelerated Turing machines | |
Note on the topological structure of random strings | |
AN OBSERVER-BASED DE-QUANTISATION OF DEUTSCH'S ALGORITHM | |
On metrizability of the free monoids | |
On recursive bounds for the exceptional values in speed-up | |
On the Unpredictability of Individual Quantum Measurement Outcomes | |
People & ideas in theoretical computer science | |
Preface to the Special Issue Unconventional Computing 2008 | |
DE-QUANTIZING THE SOLUTION OF DEUTSCH'S PROBLEM | |
Rainbow of computer science : dedicated to Hermann Maurer on the occasion of his 70th birthday | |
Randomness and complexity : from Leibniz to Chaitin | |
Randomness everywhere | |
Randomness on full shift spacesâ | |
Randomness relative to Cantor expansions | |
Relativized topological size of sets of partial recursive functions | |
Representation of left-computable ε-random reals | |
Searching for shortest and least programs | |
The set of independent statements is topologically large | |
Strong Kochen-Specker theorem and incomputability of quantum randomness | |
Theories of computational complexity | |
To halt or not to halt? That is the question, 2024: | |
A topological characterization of random sequences | |
Topology on words | |
UC 2005 | |
Unconventional models of computation : proceedings | |
Value-indefinite observables are almost everywhere | |
Value indefiniteness, randomness and unpredictability in quantum foundations. | |
A variant of the Kochen-Specker theorem localising value indefiniteness | |
Von Neumann Normalisation and Symptoms of Randomness: An Application to Sequences of Quantum Random Bits | |
WTCS 2012 | |
à¦à§à¦®à¦¿à¦à¦¾ | |
মà§à¦à¦¬à¦¨à§à¦§ |