Silvio Capobianco

https://www.etis.ee/CV/Silvio_Capobianco/est
1.08.1975
620 4221
silvio@cs.ioc.ee
I-5439-2015
Scopus Author ID: 25821865400; Google Scholar: scholar.google.com/citations?user=Zwvo78oAAAAJ

Teenistuskäik

Töökohad ja ametid
01.01.2017–...   
Tallinna Tehnikaülikool, Infotehnoloogia teaduskond, Tarkvarateaduse instituut, Vanemteadur (1,00)
08.01.2012–31.12.2016   
Tallinna Tehnikaülikool, TTÜ Küberneetika Instituut, Vanemteadur (1,00)
08.01.2009–07.01.2012   
Tallinna Tehnikaülikool, TTÜ Küberneetika Instituut, Erakorraline vanemteadur (1,00)
01.01.2006–31.12.2008   
Reykjavíki Ülikool, arvutiteaduse teaduskond, järeldoktorant
01.01.2005–31.12.2006   
Rooma La Sapienza Ülikool, arhitektuuri teaduskond, adjunkt
 
 
Haridustee
2000–2005   
Rooma La Sapienza Ülikooli, doktoriõpingud matemaatikas
1993–2000   
Rooma La Sapienza Ülikooli, laurea (=MSc) kraadi õpingud matemaatikas
 
 
Teadusorganisatsiooniline ja -administratiivne tegevus
2010−2010   
korraldaja, minitöötuba rakuautomaatide tarkvarast, Küberneetika Instituut
 
 
Loometöö
2018– Kursuse "ITB8832 Matemaatika arvutiteaduses" õppematerjali väljatöötamine: loenguslaidid, harjutused koos lahendustega, klassiruumiproovid. (Tallinn, Tallinn University of Technology, Silvio Capobianco).
 
 
Lisainfo
Alates 2017.a, kohtunik Zentralblatt MATH ja American Mathematical Society'ile;
Kohtunik eksperdihinnanguga ajakirjatele: Theoretical Computer Science; Natural Computing; Chaos, Solitons, and Fractals; jne.;
Sügis 2019.a: õpetaja, kursus ITB8832 Matemaatika Arvutiteaduses, TTÜ;
Kevad 2019.a: õpetaja, kursus ITT9132 Konkreetne Matemaatika, TTÜ;
Sügis 2018.a: õpetaja, kursus ITB8832 Matemaatika Arvutiteaduses, TTÜ;
Sügis 2016.a: õpetaja, kursus ITT9131 Konkreetne Matemaatika, TTÜ;
Sügis 2014.a: kursus ITT9130 Konkreetne Matemaatika, TTÜ;
Kevad 2013.a: õpetaja, kursus ITT8040 Rakuautomaadid, TTÜ;
Sügis 2012.a: kursus ITT9130 Konkreetne Matemaatika, TTÜ;
Sügis 2010.a: kursus ITT9130 Konkreetne Matemaatika, TTÜ;

Kvalifikatsioon

Teaduskraadid
Silvio Capobianco, doktorikraad, 2005, (juh) Patrizia Mentrasti, Structure and Invertibility in Cellular Automata, University of Rome "La Sapienza".
 
 
Teadustöö põhisuunad
ETIS KLASSIFIKAATOR: 4. Loodusteadused ja tehnika; 4.4. Matemaatika; TÄPSUSTUS: topoloogiline ja sümbooline dünaamika
ETIS KLASSIFIKAATOR: 4. Loodusteadused ja tehnika; 4.6. Arvutiteadused; TÄPSUSTUS: rakuautomaadid

Jooksvad projektid

Lõppenud projektid

Publikatsioonid

Klass
Aasta
Publikatsioon
 
1.1.
2017
Capobianco, Silvio; Kari, Jarkko; Taati, Siamak (2017). Post-surjectivity and balancedness of cellular automata over groups. Discrete Mathematics and Theoretical Computer Science, 19 (3), 1−16.10.23638/DMTCS-19-3-4.
3.1.
2016
Capobianco, Silvio; Kari, Jarkko; Taati, Siamak (2016). An "almost dual" to Gottschalk's conjecture. Cellular Automata and Discrete Complex Systems : 22nd IFIP WG 1.5 International Workshop, AUTOMATA 2016, Zurich, Switzerland, June 15–17, 2016, Proceedings. Ed. Cook, Matthew; Neary, Turlough. Springer, 77−89. (Lecture Notes in Computer Science; 9664).10.1007/978-3-319-39300-1_7.
5.2.
2016
Capobianco, Silvio; Veltri, Niccolò (2016). An implementation in Agda of Sutner’s decision algorithms for injectivity and surjectivity of one-dimensional cellular automata. Proceedings of the 27th Nordic Workshop on Programming Theory (NWPT 2015). Ed. Aceto, L.; Fábregas, I.; Garcia-Perez, Á.; Ingólfsdóttir, A. Reykjavík: Reykjavík University, 27−29. (Technical report RUTR-SCS16001, School of Computer Science, Reykjavík University).
3.4.
2015
Capobianco, Silvio; Kari, Jarkko; Taati, Siamak (2015). Post-surjectivity and balancedness of cellular automata over groups. 21st International Workshop on Cellular Automata and Discrete Complex Systems : Exploratory Papers of AUTOMATA 2015. Ed. Kari, Jarkko; Törmä, Ilkka; Szabados, Michal. Turku: Turku Centre for Computer Science, 31−38. (TUCS Lecture Notes; 24).
5.2.
2014
Capobianco, Silvio (2014). The Banach-Tarski paradox and the Garden-of-Eden theorem. FINEST MATH 2014 : Fourth Finnish-Estonian Mathematics Colloquium & Finnish Mathematical Days 2014, Book of Abstracts, University of Helsinki, 9-10 January 2014. Helsinki: University of Helsinki, 24−25.
1.1.
2013
Capobianco, Silvio; Guillon, Pierre; Kari, Jarkko (2013). Surjective cellular automata far from the Garden of Eden. Discrete Mathematics and Theoretical Computer Science, 15 (3), 41−60.
1.1.
2012
Capobianco, Silvio; Toffoli, Tommaso (2012). Conserved quantities in discrete dynamics: what can be recovered from Noether's theorem, how, and why? Natural Computing, 11 (4), 565−577.10.1007/s11047-012-9336-7.
1.1.
2011
Capobianco, Silvio (2011). Generalized Besicovitch and Weyl spaces: topology, patterns, and sliding block codes. Theoretical Computer Science, 412 (30), 3822−3837.10.1016/j.tcs.2011.02.020.
3.1.
2011
Capobianco, Silvio; Toffoli, Tommaso (2011). Can anything from Noether's theorem be salvaged for discrete dynamical systems? Unconventional Computation : 10th International Conference, UC 2011, Turku, Finland, June 6-10, 2011, Proceedings. Heidelberg: Springer, 77−88. (Lecture Notes in Computer Science; 6714).10.1007/978-3-642-21341-0_13.
3.4.
2011
Capobianco, Silvio; Guillon, Pierre; Kari, Jarkko (2011). Garden-of-Eden-like theorems for amenable groups. AUTOMATA 2011 : 17th International Workshop on Cellular Automata and Discrete Complex Systems, Proceedings, [November 21-23, 2011, Santiago, Chile]. _EditorsAbbr Fatés, Nazim; Goles, Eric; Maass, Alejandro; Rapaport, Ivan. Santiago: University of Chile, 233−242.
1.1.
2010
Capobianco, Silvio; Toffoli, Tommaso (2010). Dissipative CA computation without power sources? Journal of Cellular Automata, 5 (3), 169−183.
3.1.
2010
Capobianco, Silvio (2010). On pattern density and sliding block code behavior for the Besicovitch and Weyl pseudo-distances. SOFSEM 2010: Theory and Practice of Computer Science : 36th Conference on Current Trends in Theory and Practice of Computer Science, Špindleruv Mlýn, Czech Republic, January 23-29, 2010, Proceedings. _EditorsAbbr van Leeuwen, J., et al. Berlin: Springer, 259−270. (Lecture Notes in Computer Science; 5901).10.1007/978-3-642-11266-9_22.
3.1.
2010
Capobianco, Silvio; Uustalu, Tarmo (2010). A categorical outlook on cellular automata. Proceedings of JAC 2010 : Journées Automates Cellulaires, December 15-17, 2010, Turku, Finland. _EditorsAbbr Kari, Jarkko. Turku: Turku Center for Computer Science, 88−99. (TUCS Lecture Notes; 13).
1.1.
2009
Capobianco, Silvio (2009). On the induction operation for shift subspaces and cellular automata as presentations of dynamical systems. Information and Computation, 207 (11), 1169−1180.10.1016/j.ic.2009.02.006.
1.1.
2009
Capobianco, Silvio (2009). Surjunctivity for cellular automata in Besicovitch spaces. Journal of Cellular Automata, 4 (2), 89−98.
3.4.
2009
Capobianco, Silvio (2009). Some notes on Besicovitch and Weyl distances over higher-dimensional configurations. Proceedings of 15th International Workshop on Cellular Automata and Discrete Complex Systems, Automata 2009 : São Jose dos Campos, SP, Brazil, October 10-12, 2009. _EditorsAbbr de Oliveira, Pedro P.B.; Kari, Jarkko. São Paulo: Universidade Presbiteriana Mackenzie, 300−308.
1.1.
2008
Aceto, Luca; Capobianco, Silvio; Ingolfsdottir, Anna; Luttik, Bas (2008). The equational theory of prebisimilarity over basic CCS with divergence. Information Processing Letters, 108 (5), 284−289.10.1016/j.ipl.2008.05.019.
1.1.
2008
Toffoli, Tommaso; Capobianco, Silvio; Mentrasti, Patrizia (2008). When - and how - can a cellular automaton be rewritten as a lattice gas? Theoretical Computer Science, 403 (1), 71−88.10.1016/j.tcs.2008.04.047.
1.1.
2008
Capobianco, Silvio (2008). Multidimensional cellular automata and generalization of Fekete's lemma. Discrete Mathematics and Theoretical Computer Science, 10 (3), 95−104.
1.2.
2008
Aceto, Luca; Capobianco, Silvio; Ingolfsdottir, Anna (2008). On the Existence of a Finite Base for Complete Trace Equivalence over BPA with Interrupt. Bulletin of the EATCS, 95, 220−240.
3.1.
2008
Capobianco, Silvio (2008). Induced Subshifts and Cellular Automata. Language and Automata Theory and Applications : Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008, Revised Papers. _EditorsAbbr Martín-Vide, Carlos; Otto, Friedrich; Fernau, Henning. Berlin: Springer, 160−171. (Lecture Notes in Computer Science; 5196).10.1007/978-3-540-88282-4_16.
1.1.
2006
Capobianco, Silvio (2006). Cellular automata over semi-direct product groups: Reduction and invertibility results. International Journal of Algebra and Computation, 16 (6), 1071−1085.10.1142/S0218196706003402.
1.1.
2004
Toffoli, Tommaso; Capobianco, Silvio; Mentrasti, Patrizia (2004). How to turn a second-order cellular automaton into a lattice gas: a new inversion scheme. Theoretical Computer Science, 325 (2), 329−344.10.1016/j.tcs.2004.06.012.
2.3.
2004
Capobianco, Silvio (2004). Structure and Invertibility in Cellular Automata. (Doktoritöö, Università degli Studi di Roma "La Sapienza"). Roma: Università degli Studi di Roma "La Sapienza".
20.09.2019

Silvio Capobianco

https://www.etis.ee/CV/Silvio_Capobianco/eng
1.08.1975
620 4221
silvio@cs.ioc.ee
I-5439-2015
Scopus Author ID: 25821865400; Google Scholar: scholar.google.com/citations?user=Zwvo78oAAAAJ

Career

Institutions and positions
01.01.2017–...   
Tallinn University of Technology , School of Information Technologies, Department of Software Science, Senior Researcher (1,00)
08.01.2012–31.12.2016   
Tallinn University of Technology , Institute of Cybernetics at TUT, Senior Researcher (1,00)
08.01.2009–07.01.2012   
Tallinn University of Technology , Institute of Cybernetics at TUT, Extraordinary Senior Researcher (1,00)
01.01.2006–31.12.2008   
School of Computer Science, Reykjavik University; Postdoc
01.01.2005–31.12.2006   
First Faculty of Architecture, University of Rome "La Sapienza"; Adjunct
 
 
Education
2000–2005   
University of Rome "La Sapienza", PhD studies in mathematics
1993–2000   
University of Rome "La Sapienza", laurea (=MSc) studies in mathematics
 
 
R&D related managerial and administrative work
2010−2010   
Organizer, Mini-Workshop on Cellular Automata Software, Institute of Cybernetics
 
 
Creative work
2018- Development of teaching material for the course "ITB8832 Mathematics for Computer Science": lecture slides, exercises with solutions, classroom tests. (Tallinn, Tallinn University of Technology, Silvio Capobianco).
 
 
Additional information
Since 2017, referee for Zentralblatt MATH and for American Mathematical Society;
Referee for peer reviewed journals: Theoretical Computer Science; Natural Computing; Chaos, Solitons, and Fractals; etc. ;
Autumn 2019: Instructor, course ITB8832 Mathematics for Computer Science, TalTech;
Spring 2019: Instructor, course ITT9132 Concrete Mathematics, TTÜ;
Fall 2018: Instructor, course ITTB8832 Mathematics for Computer Science, TTÜ;
Fall 2016: Instructor, course ITT9131 Concrete Mathematics, TTÜ;
Fall 2014: Teaching Assistant, course ITT9130 Concrete Mathematics, TTÜ;
Spring 2013: Instructor, course ITT8040 Callular Automata, TUT;
Fall 2012: Teaching Assistant, course ITT9130 Concrete Mathematics, TTÜ;
Fall 2010: Teaching Assistant, course ITT9130 Concrete Mathematics, TTÜ;

Qualifications

Academic degrees
Silvio Capobianco, Doctor's Degree, 2005, (sup) Patrizia Mentrasti, Structure and Invertibility in Cellular Automata, University of Rome "La Sapienza".
 
 
Fields of research
ETIS CLASSIFICATION: 4. Natural Sciences and Engineering; 4.4. Mathematics; SPECIFICATION: topological and symbolic dynamics
ETIS CLASSIFICATION: 4. Natural Sciences and Engineering; 4.6. Computer Sciences; SPECIFICATION: cellular automata
 
 

Projects in progress

Completed projects

Publications

Category
Year
Publication
 
1.1.
2017
Capobianco, Silvio; Kari, Jarkko; Taati, Siamak (2017). Post-surjectivity and balancedness of cellular automata over groups. Discrete Mathematics and Theoretical Computer Science, 19 (3), 1−16.10.23638/DMTCS-19-3-4.
3.1.
2016
Capobianco, Silvio; Kari, Jarkko; Taati, Siamak (2016). An "almost dual" to Gottschalk's conjecture. Cellular Automata and Discrete Complex Systems : 22nd IFIP WG 1.5 International Workshop, AUTOMATA 2016, Zurich, Switzerland, June 15–17, 2016, Proceedings. Ed. Cook, Matthew; Neary, Turlough. Springer, 77−89. (Lecture Notes in Computer Science; 9664).10.1007/978-3-319-39300-1_7.
5.2.
2016
Capobianco, Silvio; Veltri, Niccolò (2016). An implementation in Agda of Sutner’s decision algorithms for injectivity and surjectivity of one-dimensional cellular automata. Proceedings of the 27th Nordic Workshop on Programming Theory (NWPT 2015). Ed. Aceto, L.; Fábregas, I.; Garcia-Perez, Á.; Ingólfsdóttir, A. Reykjavík: Reykjavík University, 27−29. (Technical report RUTR-SCS16001, School of Computer Science, Reykjavík University).
3.4.
2015
Capobianco, Silvio; Kari, Jarkko; Taati, Siamak (2015). Post-surjectivity and balancedness of cellular automata over groups. 21st International Workshop on Cellular Automata and Discrete Complex Systems : Exploratory Papers of AUTOMATA 2015. Ed. Kari, Jarkko; Törmä, Ilkka; Szabados, Michal. Turku: Turku Centre for Computer Science, 31−38. (TUCS Lecture Notes; 24).
5.2.
2014
Capobianco, Silvio (2014). The Banach-Tarski paradox and the Garden-of-Eden theorem. FINEST MATH 2014 : Fourth Finnish-Estonian Mathematics Colloquium & Finnish Mathematical Days 2014, Book of Abstracts, University of Helsinki, 9-10 January 2014. Helsinki: University of Helsinki, 24−25.
1.1.
2013
Capobianco, Silvio; Guillon, Pierre; Kari, Jarkko (2013). Surjective cellular automata far from the Garden of Eden. Discrete Mathematics and Theoretical Computer Science, 15 (3), 41−60.
1.1.
2012
Capobianco, Silvio; Toffoli, Tommaso (2012). Conserved quantities in discrete dynamics: what can be recovered from Noether's theorem, how, and why? Natural Computing, 11 (4), 565−577.10.1007/s11047-012-9336-7.
1.1.
2011
Capobianco, Silvio (2011). Generalized Besicovitch and Weyl spaces: topology, patterns, and sliding block codes. Theoretical Computer Science, 412 (30), 3822−3837.10.1016/j.tcs.2011.02.020.
3.1.
2011
Capobianco, Silvio; Toffoli, Tommaso (2011). Can anything from Noether's theorem be salvaged for discrete dynamical systems? Unconventional Computation : 10th International Conference, UC 2011, Turku, Finland, June 6-10, 2011, Proceedings. Heidelberg: Springer, 77−88. (Lecture Notes in Computer Science; 6714).10.1007/978-3-642-21341-0_13.
3.4.
2011
Capobianco, Silvio; Guillon, Pierre; Kari, Jarkko (2011). Garden-of-Eden-like theorems for amenable groups. AUTOMATA 2011 : 17th International Workshop on Cellular Automata and Discrete Complex Systems, Proceedings, [November 21-23, 2011, Santiago, Chile]. _EditorsAbbr Fatés, Nazim; Goles, Eric; Maass, Alejandro; Rapaport, Ivan. Santiago: University of Chile, 233−242.
1.1.
2010
Capobianco, Silvio; Toffoli, Tommaso (2010). Dissipative CA computation without power sources? Journal of Cellular Automata, 5 (3), 169−183.
3.1.
2010
Capobianco, Silvio (2010). On pattern density and sliding block code behavior for the Besicovitch and Weyl pseudo-distances. SOFSEM 2010: Theory and Practice of Computer Science : 36th Conference on Current Trends in Theory and Practice of Computer Science, Špindleruv Mlýn, Czech Republic, January 23-29, 2010, Proceedings. _EditorsAbbr van Leeuwen, J., et al. Berlin: Springer, 259−270. (Lecture Notes in Computer Science; 5901).10.1007/978-3-642-11266-9_22.
3.1.
2010
Capobianco, Silvio; Uustalu, Tarmo (2010). A categorical outlook on cellular automata. Proceedings of JAC 2010 : Journées Automates Cellulaires, December 15-17, 2010, Turku, Finland. _EditorsAbbr Kari, Jarkko. Turku: Turku Center for Computer Science, 88−99. (TUCS Lecture Notes; 13).
1.1.
2009
Capobianco, Silvio (2009). On the induction operation for shift subspaces and cellular automata as presentations of dynamical systems. Information and Computation, 207 (11), 1169−1180.10.1016/j.ic.2009.02.006.
1.1.
2009
Capobianco, Silvio (2009). Surjunctivity for cellular automata in Besicovitch spaces. Journal of Cellular Automata, 4 (2), 89−98.
3.4.
2009
Capobianco, Silvio (2009). Some notes on Besicovitch and Weyl distances over higher-dimensional configurations. Proceedings of 15th International Workshop on Cellular Automata and Discrete Complex Systems, Automata 2009 : São Jose dos Campos, SP, Brazil, October 10-12, 2009. _EditorsAbbr de Oliveira, Pedro P.B.; Kari, Jarkko. São Paulo: Universidade Presbiteriana Mackenzie, 300−308.
1.1.
2008
Aceto, Luca; Capobianco, Silvio; Ingolfsdottir, Anna; Luttik, Bas (2008). The equational theory of prebisimilarity over basic CCS with divergence. Information Processing Letters, 108 (5), 284−289.10.1016/j.ipl.2008.05.019.
1.1.
2008
Toffoli, Tommaso; Capobianco, Silvio; Mentrasti, Patrizia (2008). When - and how - can a cellular automaton be rewritten as a lattice gas? Theoretical Computer Science, 403 (1), 71−88.10.1016/j.tcs.2008.04.047.
1.1.
2008
Capobianco, Silvio (2008). Multidimensional cellular automata and generalization of Fekete's lemma. Discrete Mathematics and Theoretical Computer Science, 10 (3), 95−104.
1.2.
2008
Aceto, Luca; Capobianco, Silvio; Ingolfsdottir, Anna (2008). On the Existence of a Finite Base for Complete Trace Equivalence over BPA with Interrupt. Bulletin of the EATCS, 95, 220−240.
3.1.
2008
Capobianco, Silvio (2008). Induced Subshifts and Cellular Automata. Language and Automata Theory and Applications : Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008, Revised Papers. _EditorsAbbr Martín-Vide, Carlos; Otto, Friedrich; Fernau, Henning. Berlin: Springer, 160−171. (Lecture Notes in Computer Science; 5196).10.1007/978-3-540-88282-4_16.
1.1.
2006
Capobianco, Silvio (2006). Cellular automata over semi-direct product groups: Reduction and invertibility results. International Journal of Algebra and Computation, 16 (6), 1071−1085.10.1142/S0218196706003402.
1.1.
2004
Toffoli, Tommaso; Capobianco, Silvio; Mentrasti, Patrizia (2004). How to turn a second-order cellular automaton into a lattice gas: a new inversion scheme. Theoretical Computer Science, 325 (2), 329−344.10.1016/j.tcs.2004.06.012.
2.3.
2004
Capobianco, Silvio (2004). Structure and Invertibility in Cellular Automata. (Doktoritöö, Università degli Studi di Roma "La Sapienza"). Roma: Università degli Studi di Roma "La Sapienza".
20.09.2019
Detailne otsing
  • Leitud 9 kirjet
ProgrammLiikNumberNimiProjekti algusProjekti lõppVastutav täitjaAsutusFinantseerijapoolne rahastamine
ETFETF7520Algebraline automaatide teooria01.01.200831.12.2011Hellis TammTallinna Tehnikaülikool, TTÜ Küberneetika Instituut43 111,63 EUR
TKEXCSArvutiteaduse tippkeskus - EXCS07.07.200831.08.2015Tarmo UustaluTallinna Tehnikaülikool; Tallinna Tehnikaülikool, TTÜ Küberneetika Instituut4 244 372,58 EUR
MUUIKT29 (3.2.1201.13-0029)Coinduction for semantics, analysis and verification of communicating and concurrent reactive software01.03.201330.11.2015Tarmo UustaluTallinna Tehnikaülikool, TTÜ Küberneetika Instituut526 194,00 EUR
ERMOSERMOS147Group theory and combinatorics for computer science01.09.201231.08.2014Daniele D'AngeliTallinna Tehnikaülikool, TTÜ Küberneetika Instituut64 100,00 EUR
TKAlamprojektTAR16013 (EXCITE) (TK148)IT Tippkeskus EXCITE01.09.201601.03.2023Maarja KruusmaaTallinna Tehnikaülikool, Infotehnoloogia teaduskond, Biorobootika keskus; Cybernetica AS2 642 075,15 EUR
ETFETF9398Paralleeltarkvara kontrollitavad garantiid01.01.201231.03.2016Silvio CapobiancoTallinna Tehnikaülikool, TTÜ Küberneetika Instituut46 440,00 EUR
IUTIUT33-13Tugevate garantiidega tarkvara meetodid, tööriistad ja protsessid01.01.201531.12.2020Tarmo UustaluTallinna Tehnikaülikool, TTÜ Küberneetika Instituut; Tallinna Tehnikaülikool, Infotehnoloogia teaduskond, Tarkvarateaduse instituut900 000,00 EUR
SFSF0322709s06Usaldusväärsed tarkvara- ja inimkeeletehnoloogiad01.01.200631.12.2011Tarmo UustaluTallinna Tehnikaülikool, TTÜ Küberneetika Instituut968 170,23 EUR
SFSF0140007s12Usaldusväärsed tarkvara- ja inimkeeletehnoloogiad01.01.201231.12.2014Tarmo UustaluTallinna Tehnikaülikool, TTÜ Küberneetika Instituut514 620,00 EUR