×

Found 472 Documents (Results 1–100)

100
MathJax

Computations on counter machines with summator. (English. Russian original) Zbl 1397.68077

Mosc. Univ. Comput. Math. Cybern. 42, No. 1, 31-38 (2018); translation from Vestn. Mosk. Univ., Ser. XV 2018, No. 1, 31-39 (2018).
MSC:  68Q05 03D10 03D20
PDF BibTeX XML Cite
Full Text: DOI

General recursion theory. An axiomatic approach. Reprint of the 1980 original published by Springer. (English) Zbl 1365.03006

Perspectives in Logic. Cambridge: Cambridge University Press; Urbana, IL: Association for Symbolic Logic (ASL) (ISBN 978-1-107-16816-9/hbk; 978-1-316-71707-3/ebook). xii, 225 p. (2016).
PDF BibTeX XML Cite
Full Text: DOI

Recursion theory. Reprint of the 1993 original. (English) Zbl 1366.03001

Lecture Notes in Logic 1. Cambridge: Cambridge University Press; Ithaca, NY: Association of Symbolic Logic (ASL) (ISBN 978-1-107-16808-4/hbk; 978-1-316-71701-1/ebook). vii, 84 p. (2016).
MSC:  03-01 03-02 03Dxx
PDF BibTeX XML Cite
Full Text: DOI

Baire category theory and Hilbert’s tenth problem inside \(\mathbb {Q}\). (English) Zbl 1476.03061

Beckmann, Arnold (ed.) et al., Pursuit of the universal. 12th conference on computability in Europe, CiE 2016, Paris, France, June 27 – July 1, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9709, 343-352 (2016).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Unbounded recursion and non-size-increasing functions. (English) Zbl 1345.03077

Crescenzi, Pierluigi (ed.) et al., Proceedings of ICTCS 2015, the 16th Italian conference on theoretical computer science, Firenze, Italy, September 9–11, 2015. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 322, 197-210, electronic only (2016).
MSC:  03D20 68Q15
PDF BibTeX XML Cite
Full Text: DOI

A non-uniformly C-productive sequence & non-constructive disjunctions. (English) Zbl 1432.03075

Zhao, Xishun (ed.) et al., Proceedings of the 13th Asian logic conference, ALC 2013, Guangzhou, China, September 16–20, 2013. Hackensack, NJ: World Scientific. 29-52 (2015).
PDF BibTeX XML Cite
Full Text: DOI

All functions \(g:\mathbb N\to\mathbb N\) which have a single-fold Diophantine representation are dominated by a limit-computable function \(f:\mathbb N\backslash\{0\}\to\mathbb N\) which is implemented in MuPAD and whose computability is an open problem. (English) Zbl 1349.03041

Daras, Nicholas J. (ed.) et al., Computation, cryptography, and network security. Cham: Springer (ISBN 978-3-319-18274-2/hbk; 978-3-319-18275-9/ebook). 577-590 (2015).
MSC:  03D20 11U05
PDF BibTeX XML Cite
Full Text: DOI arXiv

Complexity classes on spatially periodic cellular automata. (English) Zbl 1359.68204

Mayr, Ernst W. (ed.) et al., 31st international symposium on theoretical aspects of computer science, STACS’ 14, Lyon, France, March 5–8, 2014. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-65-1). LIPIcs – Leibniz International Proceedings in Informatics 25, 112-124 (2014).
MSC:  68Q80 68Q15 68Q45
PDF BibTeX XML Cite
Full Text: DOI

Levels of discontinuity, limit-computability, and jump operators. (English) Zbl 1344.03037

Brattka, Vasco (ed.) et al., Logic, computation, hierarchies. Dedicated to Victor L. Selivanov on the occasion of his 60th birthday. Berlin: De Gruyter (ISBN 978-1-61451-783-2/hbk; 978-1-61451-804-4/ebook). Ontos Mathematical Logic 4, 79-107 (2014).
PDF BibTeX XML Cite
Full Text: arXiv

On the computable theory of bounded analytic functions. (English) Zbl 1277.03064

Mashreghi, Javad (ed.) et al., Blaschke products and their applications. Proceedings based on the presentations at the conference, Toronto, Canada, July 25–29, 2011. New York, NY: Springer; Toronto: Fields Institute for Research in Mathematical Sciences (ISBN 978-1-4614-5340-6/hbk; 978-1-4614-5341-3/ebook). Fields Institute Communications 65, 223-248 (2013).
MSC:  03F60 30J05 30J10
PDF BibTeX XML Cite
Full Text: DOI

Analytic root clustering: a complete algorithm using soft zero tests. (English) Zbl 1416.65068

Bonizzoni, Paola (ed.) et al., The nature of computation. Logic, algorithms, applications. 9th conference on computability in Europe, CiE 2013, Milan, Italy, July 1–5, 2013. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 7921, 434-444 (2013).
MSC:  65D18 03D78 30C15
PDF BibTeX XML Cite
Full Text: DOI Link

Beyond Rogers’ non-constructively computable function. (English) Zbl 1433.03121

Bonizzoni, Paola (ed.) et al., The nature of computation. Logic, algorithms, applications. 9th conference on computability in Europe, CiE 2013, Milan, Italy, July 1–5, 2013. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 7921, 45-54 (2013).
MSC:  03D78 03D20 03D15
PDF BibTeX XML Cite
Full Text: DOI

The use of machine-efficient approximation for standard statistical distribution functions. (English) Zbl 1417.62028

Proceedings of the annual international conference on computational mathematics, computational geometry and statistics (CMCGS 2012), Singapore, January 30–31, 2012. Singapore: Global Science and Technology Forum (GSTF). 141-146 (2012).
MSC:  62E15 65D15
PDF BibTeX XML Cite

Limitwise monotonic functions and their applications. (English) Zbl 1279.03063

Arai, Toshiyasu (ed.) et al., Proceedings of the 11th Asian logic conference in honor of Professor Chong Chitat on his 60th birthday, National University of Singapore, Singapore, June 22–27, 2009. Hackensack, NJ: World Scientific (ISBN 978-981-4360-53-1/hbk; 978-981-4360-54-8/ebook). 59-85 (2012).
PDF BibTeX XML Cite
Full Text: DOI Link

On a relative computability notion for real functions. (English) Zbl 1259.03058

Löwe, Benedikt (ed.) et al., Models of computation in context. 7th conference on computability in Europe, CiE 2011, Sofia, Bulgaria, June 27 – July 2, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21874-3/pbk). Lecture Notes in Computer Science 6735, 270-279 (2011).
MSC:  03D78 03D20
PDF BibTeX XML Cite
Full Text: DOI Link

Computability of the Radon-Nikodym derivative. (English) Zbl 1345.03084

Löwe, Benedikt (ed.) et al., Models of computation in context. 7th conference on computability in Europe, CiE 2011, Sofia, Bulgaria, June 27 – July 2, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21874-3/pbk). Lecture Notes in Computer Science 6735, 132-141 (2011).
MSC:  03D78 28B05
PDF BibTeX XML Cite
Full Text: DOI arXiv

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Classification

Biographic Reference

all top 3

Software