On the amount of nonconstructivity in learning recursive functions

Rūsiņš Mārtiņš Freivalds; Thomas Zeugmann

doi:10.1007/978-3-642-20877-5_33

On the amount of nonconstructivity in learning recursive functions

Rūsiņš Mārtiņš Freivalds
, Thomas Zeugmann

University of Latvia
Hokkaido University
Matemātikas un informātikas institūts

Zinātniskās darbības rezultāts: Nodaļa grāmatā/enciklopēdijā/konferences krājumā › Konferences zinātniskais raksts › Pētniecība › koleģiāli recenzēts

3 Atsauces (Scopus)

Oriģinālvaloda	Angļu
Rīkotāja publikācijas nosaukums	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publikācijas vieta	Berlin ; Heidelberg
Izdevējs	Springer
Lapas	332-343
Sējums	6648 LNCS
ISBN (Drukātā versija)	9783642208768
DOIs	https://doi.org/10.1007/978-3-642-20877-5_33
Publikācijas statuss	Publicēts - 2011
Ārēji publicēts	Jā

Publikāciju sērijas

Nosaukums	Lecture Notes in Computer Science ; Vol. 6648

OECD Zinātnes nozare

1.2 Datorzinātne un informātika

Piekļuve Dokumentiem

10.1007/978-3-642-20877-5_33

Citi faili un saites

http://www.springerlink.com/content/e51164h268835618/

Citēt šo

Freivalds, R. M., & Zeugmann, T. (2011). On the amount of nonconstructivity in learning recursive functions. (gadā) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Sēj. 6648 LNCS, lpp. 332-343). (Lecture Notes in Computer Science ; Vol. 6648). Springer. https://doi.org/10.1007/978-3-642-20877-5_33

Freivalds, Rūsiņš Mārtiņš ; Zeugmann, Thomas. / On the amount of nonconstructivity in learning recursive functions. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Sēj. 6648 LNCS Berlin ; Heidelberg : Springer, 2011. lpp. 332-343 (Lecture Notes in Computer Science ; Vol. 6648).

@inproceedings{6903b1fb321248c3bb0b36ec9170a5c7,

title = "On the amount of nonconstructivity in learning recursive functions",

author = "Freivalds, \{Rūsiņ{\v s} Mārtiņ{\v s}\} and Thomas Zeugmann",

year = "2011",

doi = "10.1007/978-3-642-20877-5\_33",

language = "English",

isbn = "9783642208768",

volume = "6648 LNCS",

series = "Lecture Notes in Computer Science ; Vol. 6648",

publisher = "Springer",

pages = "332--343",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

address = "Germany",

}

Freivalds, RM & Zeugmann, T 2011, On the amount of nonconstructivity in learning recursive functions. (kur) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). sēj. 6648 LNCS, Lecture Notes in Computer Science ; Vol. 6648, Springer, Berlin ; Heidelberg, lpp. 332-343. https://doi.org/10.1007/978-3-642-20877-5_33

On the amount of nonconstructivity in learning recursive functions. / Freivalds, Rūsiņš Mārtiņš; Zeugmann, Thomas.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Sēj. 6648 LNCS Berlin ; Heidelberg: Springer, 2011. lpp. 332-343 (Lecture Notes in Computer Science ; Vol. 6648).

Zinātniskās darbības rezultāts: Nodaļa grāmatā/enciklopēdijā/konferences krājumā › Konferences zinātniskais raksts › Pētniecība › koleģiāli recenzēts

TY - GEN

T1 - On the amount of nonconstructivity in learning recursive functions

AU - Freivalds, Rūsiņš Mārtiņš

AU - Zeugmann, Thomas

PY - 2011

Y1 - 2011

UR - http://www.springerlink.com/content/e51164h268835618/

U2 - 10.1007/978-3-642-20877-5_33

DO - 10.1007/978-3-642-20877-5_33

M3 - Conference paper

SN - 9783642208768

VL - 6648 LNCS

T3 - Lecture Notes in Computer Science ; Vol. 6648

SP - 332

EP - 343

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer

CY - Berlin ; Heidelberg

ER -

Freivalds RM, Zeugmann T. On the amount of nonconstructivity in learning recursive functions. (gadā) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Sēj. 6648 LNCS. Berlin ; Heidelberg: Springer. 2011. lpp. 332-343. (Lecture Notes in Computer Science ; Vol. 6648). doi: 10.1007/978-3-642-20877-5_33