• Publications
  • Influence
Editors' Introduction
The debate over TSE provides a rich case study through which to examine issues associated with the relationships among science, policy, and politics, which observers on the right and left of the US political spectrum agree is a critical area for governance. Expand
Deciding parity games in quasipolynomial time
It is shown that the parity game can be solved in quasipolynomial time and it is proven that coloured Muller games with n nodes and m colours can be decided in time O((mm · n)5); it is also shown that this bound cannot be improved to O((2m · n), for any c, unless FPT = W[1]. Expand
When Cryptocurrencies Mine Their Own Business
This paper shows how a minority of the computation power can incentivize the rest of the network to accept a blockchain of the minority’s choice and attacks are easy to encode in any Nakamoto-consensus-based cryptocurrency which supports a scripting language that is sufficiently expressive to encode its own mining puzzles. Expand
An ordered approach to solving parity games in quasi-polynomial time and quasi-linear space
This work provides a first implementation for a quasi-polynomial algorithm, test it on small examples, and provides a number of side results, including minor algorithmic improvements, and a complexity index associated to the approach, which is compared to the recently proposed register index. Expand
Incremental Concept Learning for Bounded Data Mining
Important refinements of concept learning in the limit from positive data considerably restricting the accessibility of input data are studied and there are cases where redundancy in the hypothesis space is shown to be a resource increasing the learning power of iterative learners. Expand
The Intrinsic Complexity of Language Identification
A new investigation of the complexity of language identification is undertaken using the notion of reduction from recursion theory and complexity theory and it is established that the weak and strong reductions are distinct. Expand
The Synthesis of Language Learners
The proofs of some of the positive results yield, as pleasant corollaries, subset-principle or tell-tale style characterizations for the learnability of the corresponding classes or families indexed. Expand
Language Learning With Some Negative Information
Regular patterns, regular languages and context-free languages
It is shown that this is indeed the case for extended (erasing) pattern languages if alphabet size is at least four and that, for alphabet size at least 4, every erasing pattern language which is context-free is also regular. Expand
Inductive Inference