Stefano's work

The Code of Coal

Presentation by Stefano Cavagnetto and Natalia Ogneva held during the Underground City Workshop Phase III at Prague College

Added on 26.04.2010

Rating: 1  2  3  4  5 
by 11 people

Morality and Artificial Agents in Cyberspace

In this second paper relating to further developmental work concerning the Underground City XXI project we raise some important questions concerning morality of artificial agents in the cyberworld. In particular artificial agents, particularly those in cyberspace, extend the class of entities that can be involved in moral situations. In this paper it is our intention to present arguments that show that such artificial agents can be conceived of as moral agents.

Added on 26.04.2010

Rating: 1  2  3  4  5 
by 7 people

String Rewriting and Proof Complexity: an interpretation of Resolution

In this paper we give a new interpretation using string rewriting systems of the proof system Resolution in its tree-like and sequence-like versions. Also we give a geometric meaning to the interpretation using planar diagrams. [preprint available in pdf]

Added on 14.01.2010

Rating: 1  2  3  4  5 
by 12 people

The Lengths of Proofs: Kreisel’s conjecture and Godel’s speed-up theorem

We collect and compare several results which have been obtained so far in the attempts to prove a statement conjectured by Kreisel, about the lengths of proofs. We also survey several results regarding a speed-up theorem announced by Goedel in an abstract published in 1936. Finally we connect this to Kreisel's conjecture. [preprint available in pdf]

Added on 14.01.2010

Rating: 1  2  3  4  5 
by 12 people

Applications of Propositional Logic to Cellular Automata

In this paper we give a new proof of Richardson’s theorem : a global function G_{A} of a cellular automaton A is injective if and only if the inverse of G_{A} is a global function of a cellular automaton. More- over, we show a way how to construct the inverse cellular automaton using the method of feasible interpolation. We also solve two problems regarding complexity of cellular automata formulated by Bruno Durand.[preprint available in pdf]

Added on 14.01.2010

Rating: 1  2  3  4  5 
by 20 people

< 1 2