Sciweavers

7988 search results - page 73 / 1598
» A Useful Undecidable Theory
Sort
View

Book
250views
17 years 1 months ago
Algorithmic Information Theory
"The aim of this book is to present the strongest possible version of G¨odel's incompleteness theorem, using an information-theoretic approach based on the size of com...
G J Chaitin
AML
2005
69views more  AML 2005»
15 years 3 months ago
On the relationship between fixed points and iteration in admissible set theory without foundation
In this article we show how to use the result in J
Dieter Probst
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
16 years 3 months ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl
MFCS
2004
Springer
15 years 8 months ago
Captive Cellular Automata
Abstract. We introduce a natural class of cellular automata characterised by a property of the local transition law without any assumption on the states set. We investigate some al...
Guillaume Theyssier
CORR
2008
Springer
126views Education» more  CORR 2008»
15 years 5 months ago
Intrinsically Universal Cellular Automata
Abstract. We introduce a natural class of cellular automata characterised by a property of the local transition law without any assumption on the states set. We investigate some al...
Nicolas Ollinger