Frank Cannonito - Academia.edu (original) (raw)

Uploads

Papers by Frank Cannonito

Research paper thumbnail of Review: A. Wlodzimierz Mostowski, On the Decidability of Some Problems in Special Classes of Groups; A. Wlodzimierz Mostowski, Computational Algorithms for Deciding Some Problems for Nilpotent Groups

Journal of Symbolic Logic, Sep 1, 1970

Research paper thumbnail of A note on normal and nonnormal subgroups of given index

Isci, 1980

ABSTRACT In this paper we consider several theoretical aspects of signal design when the signal-m... more ABSTRACT In this paper we consider several theoretical aspects of signal design when the signal-matched filter output is required to possess certain optimality properties. The problem is formulated as a constrained minimax problem in function space. Necessary ...

Research paper thumbnail of On some algorithmic problems for finitely presented groups and lie algebras

Lecture Notes in Mathematics, 1984

Research paper thumbnail of On varietal analogs of Higman’s embedding theorem

Contemporary Mathematics, 1984

Contemporary Mathematics Volume 33, 1984 ON VARIETAL ANALOGS OF HIGMAN'S EMBEDDING THEOREM F... more Contemporary Mathematics Volume 33, 1984 ON VARIETAL ANALOGS OF HIGMAN'S EMBEDDING THEOREM Frank B. Cannonito (To Roger C. Lyndon on his 65th birthday) The purpose of this article ... To paraphrase Quine, this bites off more outology than I knew how to chew ...

Research paper thumbnail of The Gödel incompleteness theorem and intelligent machines

Proceedings of the May 1-3, 1962, spring joint computer conference on - AIEE-IRE '62 (Spring), 1962

ABSTRACT

Research paper thumbnail of Hierarchies of Computable Groups and the Word Problem

The Journal of Symbolic Logic, 1966

ABSTRACT

Research paper thumbnail of The G�del incompleteness theorem and intelligent machines

Research paper thumbnail of Review: B. H. Mayoh, Groups and Semigroups with Solvable Word Problems

Journal of Symbolic Logic, 1971

Research paper thumbnail of Two decidable Markov properties over a class of solvable groups

Research paper thumbnail of Review: S. Tennenbaum, Degree of Unsolvability and the Rate of Growth of Functions

Journal of Symbolic Logic

Research paper thumbnail of On varietal analogs of Higman’s embedding theorem

Contemporary Mathematics Volume 33, 1984 ON VARIETAL ANALOGS OF HIGMAN'S EMBEDDING THEOREM F... more Contemporary Mathematics Volume 33, 1984 ON VARIETAL ANALOGS OF HIGMAN'S EMBEDDING THEOREM Frank B. Cannonito (To Roger C. Lyndon on his 65th birthday) The purpose of this article ... To paraphrase Quine, this bites off more outology than I knew how to chew ...

Research paper thumbnail of Review: Tibor Rado, On a Simple Source for Non-Computable Functions

Journal of Symbolic Logic

Research paper thumbnail of Some algorithms for polycyclic groups

Research paper thumbnail of Review: Clement F. Kent, Constructive Analogues of the Group of Permutations of the Natural Numbers

Journal of Symbolic Logic

Research paper thumbnail of Some algorithms for polycyclic groups

Groups St Andrews 1989, 1991

Research paper thumbnail of A note on normal and nonnormal subgroups of given index

Information Sciences, 1980

ABSTRACT In this paper we consider several theoretical aspects of signal design when the signal-m... more ABSTRACT In this paper we consider several theoretical aspects of signal design when the signal-matched filter output is required to possess certain optimality properties. The problem is formulated as a constrained minimax problem in function space. Necessary ...

Research paper thumbnail of A Note on Inverses of Elementary Permutations

Information Sciences, 1971

ABSTRACT It is shown that there exists an elementary permutation of the natural numbers whose inv... more ABSTRACT It is shown that there exists an elementary permutation of the natural numbers whose inverse is not provably recursive in formal number theory. This result is interpreted with respect to choosing the provably recursive functions as the appropriate formalization of the class of functions effectively computable on intuitive grounds.

Research paper thumbnail of Two decidable Markov properties over a class of solvable groups

Research paper thumbnail of Some recognizable properties of solvable groups

Research paper thumbnail of A Survey of the General Theory of Effectively Computable Functions

Research paper thumbnail of Review: A. Wlodzimierz Mostowski, On the Decidability of Some Problems in Special Classes of Groups; A. Wlodzimierz Mostowski, Computational Algorithms for Deciding Some Problems for Nilpotent Groups

Journal of Symbolic Logic, Sep 1, 1970

Research paper thumbnail of A note on normal and nonnormal subgroups of given index

Isci, 1980

ABSTRACT In this paper we consider several theoretical aspects of signal design when the signal-m... more ABSTRACT In this paper we consider several theoretical aspects of signal design when the signal-matched filter output is required to possess certain optimality properties. The problem is formulated as a constrained minimax problem in function space. Necessary ...

Research paper thumbnail of On some algorithmic problems for finitely presented groups and lie algebras

Lecture Notes in Mathematics, 1984

Research paper thumbnail of On varietal analogs of Higman’s embedding theorem

Contemporary Mathematics, 1984

Contemporary Mathematics Volume 33, 1984 ON VARIETAL ANALOGS OF HIGMAN'S EMBEDDING THEOREM F... more Contemporary Mathematics Volume 33, 1984 ON VARIETAL ANALOGS OF HIGMAN'S EMBEDDING THEOREM Frank B. Cannonito (To Roger C. Lyndon on his 65th birthday) The purpose of this article ... To paraphrase Quine, this bites off more outology than I knew how to chew ...

Research paper thumbnail of The Gödel incompleteness theorem and intelligent machines

Proceedings of the May 1-3, 1962, spring joint computer conference on - AIEE-IRE '62 (Spring), 1962

ABSTRACT

Research paper thumbnail of Hierarchies of Computable Groups and the Word Problem

The Journal of Symbolic Logic, 1966

ABSTRACT

Research paper thumbnail of The G�del incompleteness theorem and intelligent machines

Research paper thumbnail of Review: B. H. Mayoh, Groups and Semigroups with Solvable Word Problems

Journal of Symbolic Logic, 1971

Research paper thumbnail of Two decidable Markov properties over a class of solvable groups

Research paper thumbnail of Review: S. Tennenbaum, Degree of Unsolvability and the Rate of Growth of Functions

Journal of Symbolic Logic

Research paper thumbnail of On varietal analogs of Higman’s embedding theorem

Contemporary Mathematics Volume 33, 1984 ON VARIETAL ANALOGS OF HIGMAN'S EMBEDDING THEOREM F... more Contemporary Mathematics Volume 33, 1984 ON VARIETAL ANALOGS OF HIGMAN'S EMBEDDING THEOREM Frank B. Cannonito (To Roger C. Lyndon on his 65th birthday) The purpose of this article ... To paraphrase Quine, this bites off more outology than I knew how to chew ...

Research paper thumbnail of Review: Tibor Rado, On a Simple Source for Non-Computable Functions

Journal of Symbolic Logic

Research paper thumbnail of Some algorithms for polycyclic groups

Research paper thumbnail of Review: Clement F. Kent, Constructive Analogues of the Group of Permutations of the Natural Numbers

Journal of Symbolic Logic

Research paper thumbnail of Some algorithms for polycyclic groups

Groups St Andrews 1989, 1991

Research paper thumbnail of A note on normal and nonnormal subgroups of given index

Information Sciences, 1980

ABSTRACT In this paper we consider several theoretical aspects of signal design when the signal-m... more ABSTRACT In this paper we consider several theoretical aspects of signal design when the signal-matched filter output is required to possess certain optimality properties. The problem is formulated as a constrained minimax problem in function space. Necessary ...

Research paper thumbnail of A Note on Inverses of Elementary Permutations

Information Sciences, 1971

ABSTRACT It is shown that there exists an elementary permutation of the natural numbers whose inv... more ABSTRACT It is shown that there exists an elementary permutation of the natural numbers whose inverse is not provably recursive in formal number theory. This result is interpreted with respect to choosing the provably recursive functions as the appropriate formalization of the class of functions effectively computable on intuitive grounds.

Research paper thumbnail of Two decidable Markov properties over a class of solvable groups

Research paper thumbnail of Some recognizable properties of solvable groups

Research paper thumbnail of A Survey of the General Theory of Effectively Computable Functions

Log In