Set Theory and Logic


Refutation of a Fast Algorithm for Network Forecasting Time Series from Definition of Visibility Graph

Authors: Colin James III

We evaluate a definition of the visibility graph as not tautologous to deny a fast algorithm for forecasting time series. Hence the conjecture of a forecasting algorithm is denied. This forms a non tautologous fragment of the universal logic VŁ4. However, we resuscitate the conjecture using the Kanban cell neuron network (KCNN), a linear step-wise function, for the desired conjecture without injected data.

Comments: 1 Page. © Copyright 2019 by Colin James III All rights reserved. Respond to author by email only: info@cec-services dot com. See updated abstract at (We warn troll Mikko at Disqus to read the article four times before hormonal typing.)

Download: PDF

Submission history

[v1] 2019-05-06 21:21:49

Unique-IP document downloads: 9 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus