On the computational power of algorithmically random constants in blum–shub–Smale machines

Akitoshi Kawamura, Kentarô Yamamoto

Research output: Contribution to conferencePaper

Original languageEnglish
Pages34-35
Number of pages2
Publication statusPublished - Jan 1 2014
Event11th International Conference on Computability and Complexity in Analysis, CCA 2014 - Darmstadt, Germany
Duration: Jul 21 2014Jul 24 2014

Conference

Conference11th International Conference on Computability and Complexity in Analysis, CCA 2014
CountryGermany
CityDarmstadt
Period7/21/147/24/14

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Computer Science Applications

Cite this

Kawamura, A., & Yamamoto, K. (2014). On the computational power of algorithmically random constants in blum–shub–Smale machines. 34-35. Paper presented at 11th International Conference on Computability and Complexity in Analysis, CCA 2014, Darmstadt, Germany.