Main

processing priority

4

site type

3 (personal blog or private political site, e.g. Blogspot, Substack, also small blogs on own domains)

review version

11

html import

20 (imported)

Events

first seen date

2024-12-24 22:18:14

expired found date

-

created at

2024-12-24 22:18:14

updated at

2025-08-14 03:02:25

Domain name statistics

length

43

crc

64374

tld

2211

nm parts

0

nm random digits

0

nm rare letters

0

Connections

is subdomain of id

13642151 (wordpress.com)

previous id

0

replaced with id

0

related id

-

dns primary id

0

dns alternative id

0

lifecycle status

0 (unclassified, or currently active)

Subdomains and pages

deleted subdomains

0

page imported products

0

page imported random

0

page imported parking

0

Error counters

count skipped due to recent timeouts on the same server IP

0

count content received but rejected due to 11-799

0

count dns errors

0

count cert errors

0

count timeouts

0

count http 429

0

count http 404

0

count http 403

0

count http 5xx

0

next operation date

-

Server

server bits

server ip

-

Mainpage statistics

mp import status

20

mp rejected date

-

mp saved date

-

mp size orig

160983

mp size raw text

35359

mp inner links count

9

mp inner links status

10 (links queued, awaiting import)

Open Graph

title

Algorithmically Incompressible Thoughts

description

... or are they?

image

site name

Algorithmically Incompressible Thoughts

author

updated

2026-02-21 09:52:39

raw text

Algorithmically Incompressible Thoughts | … or are they? Algorithmically Incompressible Thoughts … or are they? Undecidability from a syntactic perspective November 7, 2010 Robinson arithmetic, a finitely axiomatized fragment of arithmetic, is undecidable, therefore, so is classical first-order predicate logic. This is one usual way of proving the undecidability of first-order logic (with an arithmetic language). What do we mean by undecidability here? That we have no algorithm for deciding whether a formula belongs to a certain theory or not, of course, but how is this notion formalized? Via the notion of Gödel numbering, which allows us to translate formulas into numbers, and the notion of recursive sets of numbers, which in arithmetic terms defines sets membership in which can be algorithmically decided: a theory is decidable if the Gödel numbers of its formulas form a recursive set. These definitions work out very well, but one might wonder whether, in talking about the ...

Text analysis

redirect type

0 (-)

block type

0 (no issues)

detected language

1 (English)

category id

Podsłuchy (13)

index version

1

spam phrases

0

Text statistics

text nonlatin

0

text cyrillic

0

text characters

27610

text words

5660

text unique words

1341

text lines

429

text sentences

221

text paragraphs

53

text words per sentence

25

text matched phrases

0

text matched dictionaries

0

RSS

rss status

32 (unknown)

rss found date

2024-12-24 22:18:18

rss size orig

208860

rss items

9

rss spam phrases

0

rss detected language

1 (English)

inbefore feed id

-

inbefore status

0 (new)

Sitemap

sitemap status

40 (completed successful import of reports.txt file to table in_pages)

sitemap review version

2

sitemap urls count

11

sitemap urls adult

0

sitemap filtered products

0

sitemap filtered videos

0

sitemap found date

2024-12-24 22:18:17

sitemap process date

2025-03-24 04:32:06

sitemap first import date

-

sitemap last import date

2025-08-14 03:02:25