Unrecognizable Sets of Numbers
From MaRDI portal
Publication:5552168
DOI10.1145/321328.321337zbMath0166.00601OpenAlexW2045304686MaRDI QIDQ5552168
Seymour Papert, Marvin L. Minsky
Publication date: 1966
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/6115
Related Items
How to prove that a sequence is not automatic, Two memory bounds for the recognition of primes by automata, Two memory bounds for the recognition of primes by automata, On the base-dependence of sets of numbers recognizable by finite automata, Arithmetics properties of substitutions and infinite automata, LOGICAL CHARACTERIZATION OF RECOGNIZABLE SETS OF POLYNOMIALS OVER A FINITE FIELD, NOTES ON THE DPRM PROPERTY FOR LISTABLE STRUCTURES, Construction of some nonautomatic sequences by cellular automata, Rudin–Shapiro sequences along squares, The sum of digits of squares, Characteristic Sequences of the Sets of Sums of Squares as Columns of Cellular Automata, Properties and limits of recognition of sets of integers by countable automata, (Non)Automaticity of number theoretic functions, Uniform tag sequences, Automata and transcendence in positive characteristic, Automaticity. IV: Sequences, sets, and diversity, On a problem of Gelfond: the sum of digits of prime numbers, It is decidable whether the image of an \(\mathbb N\)-rational sequence has a base, A definition of measures over language space, On a characterization of the nonregular set of primes, On the complexity of a family of \(k\)-context-free sequences, Tree adjunct languages as integer set recognizers†, Tape-reversal bounded Turing machine computations, Higher order rule characterization of heuristics of compass and straight edge constructions in geometry, Support of an algebraic series as the range of a recursive sequence, Multiplicative functions and \(k\)-automatic sequences
Cites Work
