default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSebastiaan Terwijn
Person information
- affiliation: Radboud University Nijmegen, The Netherlands
- affiliation (former): Vienna University of Technology, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c15]Sebastiaan A. Terwijn:
Fixed Point Theorems in Computability Theory. Logics and Type Systems in Theory and Practice 2024: 214-224- [c14]Ekaterina B. Fokina
, Sebastiaan A. Terwijn:
Computable Structure Theory of Partial Combinatory Algebras. CiE 2024: 265-276 - [i15]Sebastiaan A. Terwijn:
Fixed Point Theorems in Computability Theory. CoRR abs/2402.03069 (2024) - 2023
- [i14]Sebastiaan A. Terwijn:
The complexity of completions in partial combinatory algebra. CoRR abs/2307.12685 (2023) - [i13]Sebastiaan A. Terwijn:
Completions of Kleene's second model. CoRR abs/2312.14656 (2023) - 2022
- [j33]Anton Golov, Sebastiaan A. Terwijn:
Fixpoints and relative precompleteness. Comput. 11(2): 135-146 (2022) - [j32]Klaus Ambos-Spies, Wolfgang Merkle, Sebastiaan A. Terwijn:
Normalized information distance and the oscillation hierarchy. J. Comput. Syst. Sci. 124: 65-76 (2022) - [j31]Henk Barendregt, Sebastiaan A. Terwijn:
Partial combinatory algebra and generalized numberings. Theor. Comput. Sci. 925: 37-44 (2022) - [i12]Anton Golov, Sebastiaan A. Terwijn:
Embeddings between partial combinatory algebras. CoRR abs/2204.03553 (2022) - 2021
- [j30]Paul Shafer, Sebastiaan A. Terwijn:
Ordinal Analysis of Partial Combinatory Algebras. J. Symb. Log. 86(3): 1154-1188 (2021) - [i11]Anton Golov, Sebastiaan A. Terwijn:
Fixpoints and relative precompleteness. CoRR abs/2101.12271 (2021) - 2020
- [j29]Sebastiaan A. Terwijn:
The noneffectivity of Arslanov's completeness criterion and related theorems. Arch. Math. Log. 59(5-6): 703-713 (2020) - [j28]Sebastiaan A. Terwijn:
Computability in Partial Combinatory Algebras. Bull. Symb. Log. 26(3-4): 224-240 (2020) - [i10]Paul Shafer, Sebastiaan A. Terwijn:
Ordinal analysis of partial combinatory algebras. CoRR abs/2010.12452 (2020)
2010 – 2019
- 2019
- [j27]Henk Barendregt, Sebastiaan A. Terwijn:
Fixed point theorems for precomplete numberings. Ann. Pure Appl. Log. 170(10): 1151-1161 (2019) - [i9]Hendrik Pieter Barendregt, Sebastiaan A. Terwijn:
Partial combinatory algebra and generalized numberings. CoRR abs/1910.07750 (2019) - [i8]Sebastiaan A. Terwijn:
Computability in partial combinatory algebras. CoRR abs/1910.09258 (2019) - 2018
- [j26]Sebastiaan A. Terwijn:
Generalizations of the Recursion Theorem. J. Symb. Log. 83(4): 1683-1690 (2018) - [i7]Sebastiaan A. Terwijn:
Generalizations of the Recursion Theorem. CoRR abs/1803.10843 (2018) - [i6]Henk Barendregt, Sebastiaan A. Terwijn:
Fixed point theorems for precomplete numberings. CoRR abs/1809.06233 (2018) - 2017
- [j25]Bjørn Kjos-Hanssen, Frank Stephan, Sebastiaan A. Terwijn:
Covering the recursive sets. Ann. Pure Appl. Log. 168(4): 804-823 (2017) - [i5]Klaus Ambos-Spies, Wolfgang Merkle, Sebastiaan A. Terwijn:
Normalized Information Distance and the Oscillation Hierarchy. CoRR abs/1708.03583 (2017) - 2015
- [j24]Andrea Sorbi, Sebastiaan A. Terwijn:
Generalizations of the Weak Law of the Excluded Middle. Notre Dame J. Formal Log. 56(2): 321-331 (2015) - [c13]Bjørn Kjos-Hanssen, Frank Stephan, Sebastiaan A. Terwijn:
Covering the Recursive Sets. CiE 2015: 44-53 - 2014
- [j23]Rutger Kuyper, Sebastiaan Terwijn:
Effective genericity and differentiability. J. Log. Anal. 6 (2014) - 2013
- [j22]Rutger Kuyper, Sebastiaan A. Terwijn:
Model Theory of Measure Spaces and Probability Logic. Rev. Symb. Log. 6(3): 367-393 (2013) - 2011
- [j21]Sebastiaan A. Terwijn, Leen Torenvliet, Paul M. B. Vitányi:
Nonapproximability of the normalized information distance. J. Comput. Syst. Sci. 77(4): 738-742 (2011) - [j20]Bruno Bauwens, Sebastiaan A. Terwijn:
Notes on Sum-Tests and Independence Tests. Theory Comput. Syst. 48(2): 247-268 (2011) - 2010
- [c12]Sebastiaan Terwijn:
Intuitionistic Logic and Computability Theory. WoLLIC 2010: 55-57 - [i4]Sebastiaan Terwijn, Leen Torenvliet, Paul M. B. Vitányi:
Normalized Information Distance is Not Semicomputable. CoRR abs/1006.3275 (2010)
2000 – 2009
- 2009
- [c11]Sebastiaan Terwijn:
Decidability and Undecidability in Probability Logic. LFCS 2009: 441-450 - [i3]Sebastiaan Terwijn, Leen Torenvliet, Paul M. B. Vitányi:
Nonapproximablity of the Normalized Information Distance. CoRR abs/0910.4353 (2009) - 2008
- [j19]Andrea Sorbi, Sebastiaan Terwijn:
Intermediate logics and factors of the Medvedev lattice. Ann. Pure Appl. Log. 155(2): 69-85 (2008) - [j18]Sebastiaan Terwijn:
On the structure of the Medvedev lattice. J. Symb. Log. 73(2): 543-558 (2008) - 2007
- [j17]Sebastiaan Terwijn:
Kripke Models, Distributive Lattices, and Medvedev Degrees. Stud Logica 85(3): 319-332 (2007) - [j16]John M. Hitchcock, Jack H. Lutz, Sebastiaan Terwijn:
The arithmetical complexity of dimension and randomness. ACM Trans. Comput. Log. 8(2): 13 (2007) - 2006
- [j15]Sebastiaan Terwijn:
The Medvedev lattice of computably closed sets. Arch. Math. Log. 45(2): 179-190 (2006) - [j14]Cristian S. Calude, Ludwig Staiger, Sebastiaan Terwijn:
On partial randomness. Ann. Pure Appl. Log. 138(1-3): 20-30 (2006) - [j13]Rodney G. Downey, Denis R. Hirschfeldt, André Nies, Sebastiaan Terwijn:
Calibrating Randomness. Bull. Symb. Log. 12(3): 411-491 (2006) - [j12]Sebastiaan A. Terwijn:
Constructive Logic and the Medvedev Lattice. Notre Dame J. Formal Log. 47(1): 73-82 (2006) - 2005
- [j11]André Nies, Frank Stephan, Sebastiaan Terwijn:
Randomness, relativization and Turing degrees. J. Symb. Log. 70(2): 515-535 (2005) - [j10]Sebastiaan Terwijn:
Probabilistic Logic and Induction. J. Log. Comput. 15(4): 507-515 (2005) - [c10]Sebastiaan Terwijn:
Kripke Models, Distributive Lattices, and Medvedev Degrees. CiE 2005: 486-494 - 2004
- [j9]Sanjay Jain, Frank Stephan, Sebastiaan Terwijn:
Counting extensional differences in BC-learning. Inf. Comput. 188(1): 127-142 (2004) - [i2]John M. Hitchcock, Jack H. Lutz, Sebastiaan Terwijn:
The Arithmetical Complexity of Dimension and Randomness. CoRR cs.LO/0408043 (2004) - [i1]John M. Hitchcock, Jack H. Lutz, Sebastiaan Terwijn:
The Arithmetical Complexity of Dimension and Randomness. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j8]Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Sebastiaan Terwijn:
Almost complete sets. Theor. Comput. Sci. 306(1-3): 177-194 (2003) - [c9]John M. Hitchcock, Jack H. Lutz, Sebastiaan Terwijn:
The Arithmetical Complexity of Dimension and Randomness. CSL 2003: 241-254 - 2002
- [j7]Rodney G. Downey, Sebastiaan Terwijn:
Computably Enumerable Reals and Uniformly Presentable Ideals. Math. Log. Q. 48(S1): 29-40 (2002) - [c8]Sebastiaan Terwijn:
On the Learnability of Hidden Markov Models. ICGI 2002: 261-268 - 2001
- [j6]Sebastiaan Terwijn, Domenico Zambella:
Computational Randomness and Lowness. J. Symb. Log. 66(3): 1199-1205 (2001) - [c7]Klaus Aehlig, Jan Johannsen, Helmut Schwichtenberg, Sebastiaan Terwijn:
Linear Ramified Higher Type Recursion and Parallel Complexity. Proof Theory in Computer Science 2001: 1-21 - 2000
- [c6]Frank Stephan, Sebastiaan Terwijn:
Counting Extensional Differences in BC-Learning. ICGI 2000: 256-269 - [c5]Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Sebastiaan Terwijn:
Almost Complete Sets. STACS 2000: 419-430
1990 – 1999
- 1999
- [j5]Frank Stephan, Sebastiaan Terwijn:
The Complexity of Universal Text-Learners. Inf. Comput. 154(2): 149-166 (1999) - [j4]Antonín Kucera, Sebastiaan Terwijn:
Lowness for The Class of Random Sets. J. Symb. Log. 64(4): 1396-1402 (1999) - [c4]Sebastiaan Terwijn:
Extensional Set Learning (extended abstract). COLT 1999: 243-248 - 1998
- [j3]Sebastiaan Terwijn, Leen Torenvliet:
Arithmetical Measure. Math. Log. Q. 44: 277-286 (1998) - 1997
- [j2]Klaus Ambos-Spies, Sebastiaan Terwijn, Xizhong Zheng:
Resource Bounded Randomness and Weakly Complete Problems. Theor. Comput. Sci. 172(1-2): 195-207 (1997) - [c3]Frank Stephan, Sebastiaan Terwijn:
The Complexity of Universal Text-Learners. FCT 1997: 441-451 - 1996
- [j1]Klaus Ambos-Spies, Hans-Christian Neis, Sebastiaan Terwijn:
Genericity and Measure for Exponential Time. Theor. Comput. Sci. 168(1): 3-19 (1996) - 1994
- [c2]Klaus Ambos-Spies, Sebastiaan Terwijn, Xizhong Zheng:
Resource Bounded Randomness and Weakly Complete Problems. ISAAC 1994: 369-377 - [c1]Klaus Ambos-Spies, Hans-Christian Neis, Sebastiaan Terwijn:
Genericity and Measure for Exponential Time. MFCS 1994: 221-232
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 21:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
