可计算性与复杂性——献给罗德尼·g·唐尼60岁生日的随笔

{"title":"可计算性与复杂性——献给罗德尼·g·唐尼60岁生日的随笔","authors":"A. Day, M. Fellows, Noam Greenberg, B. Khoussainov, A. Melnikov, Frances A. Rosamond","doi":"10.1007/978-3-319-50062-1","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":309016,"journal":{"name":"Computability and Complexity","volume":"73 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Computability and Complexity - Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday\",\"authors\":\"A. Day, M. Fellows, Noam Greenberg, B. Khoussainov, A. Melnikov, Frances A. Rosamond\",\"doi\":\"10.1007/978-3-319-50062-1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":309016,\"journal\":{\"name\":\"Computability and Complexity\",\"volume\":\"73 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computability and Complexity\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-319-50062-1\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computability and Complexity","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-319-50062-1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}