Results 1 
9 of
9
A FORMAL THEORY OF INDUCTIVE INFERENCE, Part l
 I and II"; Information and Control
, 1964
"... Technology, February 811, 1960 was the subject of Zator Technical Bulletin No. 138. Much of the material of Sections 3.1 to 3.4 rst appeared in Zator Technical Bulletins 138 and 139 of November 1960 and January 1961, respectively. Sections 4.1 and 4.2 are more exact presentations of Zator Technical ..."
Abstract

Cited by 30 (0 self)
 Add to MetaCart
Technology, February 811, 1960 was the subject of Zator Technical Bulletin No. 138. Much of the material of Sections 3.1 to 3.4 rst appeared in Zator Technical Bulletins 138 and 139 of November 1960 and January 1961, respectively. Sections 4.1 and 4.2 are more exact presentations of Zator Technical Bulletins 140 and 141 of April 1961 and April 1962, respectively. 1 In Part II these models are applied to the solution of three problems prediction of the Bernoulli sequence, extrapolation of a certain kind of Markov chain, and the use of phrase structure grammars for induction. Though some approximations are used, the rst of these problems is treated must rigorously. The result is Laplace's rule of succession. The solution to the second problem uses less certain approximations, but the properties of the solution that are discussed, are fairly independent of these approximations. The third application, using phrase structure grammars, is least exact of the three. Fi
Propositional computability logic I
 ACM Transactions on Computational Logic
"... Computability logic (CL) is a systematic formal theory of computational tasks and resources, which, in a sense, can be seen as a semanticsbased alternative to (the syntactically introduced) linear logic. With its expressive and flexible language, where formulas represent computational problems and ..."
Abstract

Cited by 24 (18 self)
 Add to MetaCart
Computability logic (CL) is a systematic formal theory of computational tasks and resources, which, in a sense, can be seen as a semanticsbased alternative to (the syntactically introduced) linear logic. With its expressive and flexible language, where formulas represent computational problems and “truth ” is understood as algorithmic solvability, CL potentially offers a comprehensive logical basis for constructive applied theories and computing systems inherently requiring constructive and computationally meaningful underlying logics. Among the best known constructivistic logics is Heyting’s intuitionistic calculus INT, whose language can be seen as a special fragment of that of CL. The constructivistic philosophy of INT, however, just like the resource philosophy of linear logic, has never really found an intuitively convincing and mathematically strict semantical justification. CL has good claims to provide such a justification and hence a materialization of Kolmogorov’s known thesis “INT = logic of problems”. The present paper contains a soundness proof for INT with respect to the CL semantics. It is expected to constitute part 1 of a twopiece series on the intuitionistic fragment of CL, with part 2 containing an anticipated completeness proof. 1
Computability logic: a formal theory of interaction. In: Interactive Computation: The New Paradigm
, 2006
"... (written as a book chapter) ..."
Observing Complexity and the Complexity of Observation
, 1993
"... in nonlinear systems. Physica, 7D:16, 1983. [52] J.P. Crutchfield. Reconstructing language hierarchies. In H. A. Atmanspracher and H. Scheingraber, editors, Information Dynamics, page 45, New York, 1991. Plenum. [19] J.P. Crutchfield. Knowledge and meaning ... chaos and complexity. In L. Lam and V ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
in nonlinear systems. Physica, 7D:16, 1983. [52] J.P. Crutchfield. Reconstructing language hierarchies. In H. A. Atmanspracher and H. Scheingraber, editors, Information Dynamics, page 45, New York, 1991. Plenum. [19] J.P. Crutchfield. Knowledge and meaning ... chaos and complexity. In L. Lam and V. Naroditsky, editors, Modeling Complex Phenomena, page 66, Berlin, 1992. SpringerVerlag. [20] J.P. Crutchfield. Semantics and thermodynamics. In M. Casdagli and S. Eubank, editors, Nonlinear Modeling and Forecasting, volume XII of Santa Fe Institute Studies in the Sciences of Complexity, page 317, Reading, Massachusetts, 1992. AddisonWesley. [21] P. E. Caines. Linear Stochastic Systems. Wiley, New York, 1988. [22] B. Kitchens and S. Tuncel. Finitary measures for sub shifts of finite type and sofic systems. Memoirs' of the AMS, 58:no. 338, 1985. [23] I. P. Cornfeld, S. V. Fomin, and Ya. G. Sinai. Ergodic Theory. SpringerVerlag, Berlin, 1982. [24] J. E. Hopcroft and J. D. Ullman. Intr
Some A Priori Torah Decryption Principles, Proc ANPA, Cambridge 2007 [2
 PO Box 102
, 2000
"... The author proposes, a priori, a simple set of principles that can be developed into a range of algorithms by which means the Torah might be decoded. It is assumed that the Torah is some form of transposition cipher with the unusual property that the plain text of the Torah may also be the cipher te ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The author proposes, a priori, a simple set of principles that can be developed into a range of algorithms by which means the Torah might be decoded. It is assumed that the Torah is some form of transposition cipher with the unusual property that the plain text of the Torah may also be the cipher text of one or more other documents written in Biblical Hebrew. The decryption principles are based upon the use of Equidistant Letter Sequences (ELS’s) and the notions of Message Length,
Arithmetic and the Incompleteness Theorems
, 2000
"... this paper please consult me first, via my home page. ..."
Chapter 1 IN THE BEGINNING WAS GAME SEMANTICS... ∗
, 2005
"... This chapter presents an overview of computability logic — the gamesemantically constructed logic of interactive computational tasks and resources. ..."
Abstract
 Add to MetaCart
This chapter presents an overview of computability logic — the gamesemantically constructed logic of interactive computational tasks and resources.
Contents
, 2008
"... This chapter presents an overview of computability logic — the gamesemantically constructed logic of interactive computational tasks and resources. There is only one nonoverview, technical section in it, ..."
Abstract
 Add to MetaCart
This chapter presents an overview of computability logic — the gamesemantically constructed logic of interactive computational tasks and resources. There is only one nonoverview, technical section in it,