Heiner Marxen and Jürgen Buntrock. Attacking the busy beaver 5. Bulletin of the European Association for Theoretical Computer Science, no. 40 (Feb.1990), pp. 247–251. - Pascal Michel. Busy beaver competition and Collatz-like problems. Archive for mathematical logic, vol. 32 (1993), pp. 351–367.

1998 ◽  
Vol 63 (1) ◽  
pp. 331-332
Author(s):  
Allen H. Brady
Keyword(s):  
Mathematical Logic ◽  
Computer Science ◽  
European Association ◽  
Theoretical Computer Science ◽  
Theoretical Computer

Preface to Special Issue devoted to the memory of Sauro Tulipani

2008 ◽  
Vol 18 (1) ◽  
pp. 1-4 ◽  
Author(s):  
FLAVIO CORRADINI ◽  
CARLO TOFFALORI
Keyword(s):  
Mathematical Logic ◽  
Computer Science ◽  
Crucial Role ◽  
Recursion Theory ◽  
Theoretical Computer Science ◽  
Special Issue ◽  
Nineteen Thirties ◽  
Theoretical Computer ◽  
The Subject ◽  
The Church

2006 was a special year for both mathematical logic and computer science, as it celebrated Gödel's centenary. Although Gödel's work was mainly concerned with mathematics and metamathematics, the crucial role it had in the foundation of modern theoretical computer science is undeniable: for instance, one only has to remember Gödel's contributions to the birth of recursion theory as well as his part in the debate in the nineteen thirties on the subject of the Church Thesis.

scholarly journals Preface

2015 ◽  
Vol 27 (2) ◽  
pp. 92-93
Author(s):  
MARIANGIOLA DEZANI ◽  
SABRINA MANTACI ◽  
MARINELLA SCIORTINO
Keyword(s):  
Data Structure ◽  
Computer Science ◽  
Programming Languages ◽  
European Association ◽  
Wide Spectrum ◽  
Theoretical Computer Science ◽  
Combinatorics On Words ◽  
Special Issue ◽  
Theoretical Computer ◽  
Mathematical Structures

This special issue of Mathematical Structures in Computer Science is devoted to the fourteenth Italian Conference on Theoretical Computer Science (ICTCS) held at University of Palermo, Italy, from 9th to 11th September 2013. ICTCS is the conference of the Italian Chapter of the European Association for Theoretical Computer Science and covers a wide spectrum of topics in Theoretical Computer Science, ranging from computational complexity to logic, from algorithms and data structure to programming languages, from combinatorics on words to distributed computing. For this reason, the contributions here included come from very different areas of Theoretical Computer Science. In fact this special issue is motivated by the desire to give people who have presented their ideas at the 14th ICTCS the opportunity to publish papers on their work. Submitted papers have been subject to a careful and severe reviewing process and 11 of them were selected for this special issue.

Sign in / Sign up

Export Citation Format

Share Document